Concepedia

Attacking RSA–CRT signatures with faults on montgomery multiplication

Pierre-Alain Fouque, Nicolas Guillermin, Delphine Leresteux, Mehdi Tibouchi, Jean-Christophe Zapalowicz

Journal of Cryptographic Engineering · 2013 · 11 citations · 13 references

Concepts

ComputingComputer EngineeringComputer ScienceComputer SecurityCryptographyFault-tolerant ComputingChinese Remainder TheoremElliptic Curve CryptographyElliptic CurvesCrt In Elliptic Curve ComputationCryptographic Fault AnalysisElliptic Curve Cryptography VulnerabilitiesFault Model AnalysisMontgomery Curves

References

13

Modular multiplication without trial division

Peter L. Montgomery · Mathematics of Computation · 1985 · 2.4K citations

Natural Sciences, Computer Science, Mathematics +9

Analyzing and comparing Montgomery multiplication algorithms

Çetin Kaya Koç, T. Acar, Burton S. Kaliski · IEEE Micro · 1996 · 558 citations

Computing, Computer Engineering, Computer Science +11

On the Importance of Eliminating Errors in Cryptographic Computations

Dan Boneh, Richard A. DeMillo, Richard J. Lipton · Journal of Cryptology · 2000 · 511 citations · Full text

Computing, Computer Engineering, Computer Science +14

The residue number system

Harvey L. Garner · 1959 · 342 citations

Computing, Computer Science, Mathematics +9

Simplifying quotient determination in high-radix modular multiplication

Holger Orup · 2002 · 168 citations

Computing, Computer Engineering, Computer Science +14