Abstract
We present several new side-channel attacks against RSA key generation. Our attacks may be combined and are powerful enough to fully reveal RSA primes generated on a tamper-resistant device, unless adequate countermeasures are implemented. More precisely, we describe a DPA attack, a template attack and several fault attacks against prime generation. Our experimental results confirm the practicality of the DPA and template attacks. To the best of our knowledge, these attacks are the first of their kind and demonstrate that basic timing and SPA countermeasures may not be sufficient for high-security applications.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Finke, T., Gebhardt, M., Schindler, W.: A New Side-Channel Attack on RSA Prime Generation. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 141–155. Springer, Heidelberg (2009)
Common Criteria Portal: Security Targets of ICs, Smart Cards and Smart Card-Related Devices and Systems, http://www.commoncriteriaportal.org/products/ (retrieved in December 2011)
Kocher, P., Jaffe, J., Jun, B.: Differential Power Analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388–397. Springer, Heidelberg (1999)
Chari, S., Rao, J., Rohatgi, P.: Template Attacks. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 13–28. Springer, Heidelberg (2003)
Boneh, D., DeMillo, R.A., Lipton, R.J.: On the Importance of Checking Cryptographic Protocols for Faults. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 37–51. Springer, Heidelberg (1997)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. In: Public-Key Parameters, ch. 4. CRC Press (1996)
Damgård, I., Landrock, P., Pomerance, C.: Average Case Error Estimates for the Strong Probable Prime Test. Mathematics of Computation 61(203), 177–194 (1993)
Brandt, J., Damgård, I., Landrock, P.: Speeding up Prime Number Generation. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol. 739, pp. 440–449. Springer, Heidelberg (1993)
Brandt, J., Damgård, I.B.: On Generation of Probable Primes by Incremental Search. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 358–370. Springer, Heidelberg (1993)
Silverman, R.D.: Fast Generation of Random, Strong RSA Primes. Cryptobytes 3(1), 9–13 (1997)
Federal Information Processing Standards: Digital Signature Standard (DSS). FIPS PUB 186-3 (2009)
Joye, M., Paillier, P., Vaudenay, S.: Efficient Generation of Prime Numbers. In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 340–354. Springer, Heidelberg (2000)
Joye, M., Paillier, P.: Fast Generation of Prime Numbers on Portable Devices: An Update. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 160–173. Springer, Heidelberg (2006)
Clavier, C., Coron, J.-S.: On the Implementation of a Fast Prime Generation Algorithm. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 443–449. Springer, Heidelberg (2007)
Yen, S.-M., Joye, M.: Checking Before Output Not Be Enough Against Fault-Based Cryptanalysis. IEEE Trans. Computers 49(9), 967–970 (2000)
Riscure. Diode Laser Station DLS 1.0.0714 Datasheet (2011)
Gallagher, P.X.: On the Distribution of Primes in Short Intervals. Mathematika 23, 4–9 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vuillaume, C., Endo, T., Wooderson, P. (2012). RSA Key Generation: New Attacks. In: Schindler, W., Huss, S.A. (eds) Constructive Side-Channel Analysis and Secure Design. COSADE 2012. Lecture Notes in Computer Science, vol 7275. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29912-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-29912-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29911-7
Online ISBN: 978-3-642-29912-4
eBook Packages: Computer ScienceComputer Science (R0)