fuklief
Joined 11 years ago
Joined 11 years ago
Crypto noob here, but isn't modular inverse the same as modular exponentiation through Fermat's little theorem? I.e., x^-1 mod n is the same as computing x^{n - 2} mod n which we know how to do in a constant-time way with a Montgomery ladder. Or is that too slow?
[0]: https://cyber.gouv.fr/en/publications/follow-position-paper-...
- Get them into a decent high school, e.g., Henri 4 or Louis Le Grand in Paris.
- Hope they have good grades and manage to get into a good preparatory class [1], e.g., Henri 4, Louis Le Grand in Paris, or Hoche and Sainte-Geneniève in Versailles.
- Make sure they don't slack off, and hope they get into a good engineer school, e.g., Ecole Polytechnique, Ecole des Mines, Ecole Nationale des Ponts et Chaussés, CentraleSupelec.
(Lists are not exhaustive)
If they manage to get into one of these schools, they will most likely end up not have any difficulty to find a somewhat well-paid job in France.
[1]: https://en.wikipedia.org/wiki/Classe_pr%C3%A9paratoire_aux_g...
It's not a parsing library, but a printing one, i.e., double -> string. https://github.com/fastfloat/fast_float is a parsing library, i.e., string -> double, not by Google though, but was indeed motivated by parsing JSON fast https://lemire.me/blog/2020/03/10/fast-float-parsing-in-prac...
Actually a former CS prof at Maryland moving to industry. https://mhicks.me/
Source on AMD CPUs having support for CHERI-style capabilities ? Afaik, there is only the Arm Morello prototype out right now and FPGAs.