4 ms·
Here is what Bernstein has to say about RSA https://www.hyperelliptic.org/tanja/vortraege/facthacks-29C3.pdf https://www.hyperelliptic.org/tanja/vortraege/fact
by aborsy 6y ago
Here is what Bernstein has to say about RSA
https://www.hyperelliptic.org/tanja/vortraege/facthacks-29C3.pdf https://www.hyperelliptic.org/tanja/vortraege/facthacks-29C3...
See the conclusion slides. In short, RSA is secure if primes are large and random.
It’s worth mentioning, Bernstein is the author of a competing algorithm. There are hundreds of scientific talks and articles about RSA by renowned cryptographers.
- FartyMcFarter 6y agoI'm not a crypto expert, but these slides mostly focus on "factoring" attacks, and don't cover other kinds of attacks mentioned in the submission link. For example, the slides you linked don't mention padding or exponent weaknesses.
- based2 6y agohttp://math.uni.lu/eml/projects/reports/prime-distribution.pdf http://math.uni.lu/eml/projects/reports/prime-distribution.p...