Abstract
The key-generation algorithm for the RSA cryptosystem is specified in several standards, such as PKCS#1, IEEE 1363-2000, FIPS 186-3, ANSIX9.44, or ISO/IEC 18033-2. All of them substantially differ in their requirements. This indicates that for computing a “secure” RSA modulus it does not matter how exactly one generates RSA integers. In this work we show that this is indeed the case to a large extend: First, we give a theoretical framework that will enable us to easily compute the entropy of the output distribution of the considered standards and show that it is comparatively high. To do so, we compute for each standard the number of integers they define (up to an error of very small order) and discuss different methods of generating integers of a specific form. Second, we show that factoring such integers is hard, provided factoring a product of two primes of similar size is hard.
Chapter PDF
Similar content being viewed by others
Keywords
References
Accredited Standards Committee X9, ANSI X9.44-2007: Public Key Cryptography Using Reversible Algorithms for the Financial Services Industry: Transport of Symmetric Algorithm Keys Using RSA. Technical report, American National Standards Institute, American Bankers Association (2007)
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 (1992), http://dx.doi.org/10.1007/3-540-48071-4_26
Cocks, C.C.: A note on ’non-secret encryption’. CESG Memo (1973) http://www.cesg.gov.uk/publications/media/notense.pdf (last download May 12, 2009)
Cox, M.J., Engelschall, R., Henson, S., Laurie, B.: OpenSSL 0.9.8j. Open source implementation (2009), http://www.openssl.org/ Refer to, http://www.openssl.org/ (last download April 21, 2009)
Decker, A., Moree, P.: Counting RSA-integers. Results in Mathematics 52, 35–39 (2008), http://dx.doi.org/10.1007/s00025-008-0285-5
Ellis, J.H.: The possibility of secure non-secret digital encryption (1970), http://cryptocellar.web.cern.ch/cryptocellar/cesg/possnse.pdf (last download May 12, 2009)
Free Software Foundation, GNU Crypto. Open source implementation (2009), http://www.gnu.org/software/gnu-crypto/ Refer to gnu-crypto-2.0.1.tar.bz2 (last download April 21, 2009)
Goldreich, O.: Foundations of Cryptography: Basic Tools, vol. 1. Cambridge University Press, Cambridge (2001) ISBN 0-521-79172-3
IEEE working group 2000. IEEE 1363-2000: Standard Specifications For Public Key Cryptography. IEEE standard, IEEE, New York, NY 10017, http://grouper.ieee.org/groups/1363/P1363/
Information Technology Laboratory, FIPS 186-3: Digital Signature Standard (DSS). Technical report, National Institute of Standards and Technology (2009)
International Organization for Standards, ISO/IEC 18033-2, Encryption algorithms — Part 2: Asymmetric ciphers. Technical report, International Organization for Standards (2006)
Jonsson, J., Kaliski, B.: Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1 (2003), http://tools.ietf.org/html/rfc3447 RFC 3447
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) ISBN 978-3-540-46559-1. ISSN 0302-9743, http://dx.doi.org/10.1007/11894063_13
Knuth, D.E.: The Art of Computer Programming, Seminumerical Algorithms, 3rd edn., vol. 2. Addison-Wesley, Reading (1998) ISBN 0-201-89684-2, 1st edn. (1969)
Loebenberger, D., Nüsken, M.: Coarse-grained integers. e-print arXiv:1003.2165v1 (2010), http://arxiv.org/abs/1003.2165
Loebenberger, D., Nüsken, M.: Analyzing standards for RSA integers – extended version. e-print arXiv:1104.4356v2 (2011), http://www.arxiv.org/abs/1104.4356
Maurer, U.M.: Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters. Journal of Cryptology 8(3), 123–155 (1995), http://dx.doi.org/10.1007/BF00202269
NESSIE working group, NESSIE D20 - NESSIE security report. Technical report, NESSIE (2003)
von Neumann, J.: Various techniques used in connection with random digits. Monte Carlo methods. National Bureau of Standards, Applied Mathematics Series, vol. 12, pp. 36–38 (1951)
de Raadt, T., Provos, N., Friedl, M., Beck, B., Campbell, A., Song, D.: OpenSSH 2.1.1. Open source implementation (2009), http://www.openssh.org/ , Refer to openssh-2.1.1p4.tar.gz (last download April 21,2009)
Rivest, R.L., Shamir, A., Adleman, L.M.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Technical Report MIT/LCS/TM-82, Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, Massachusetts (1977)
Rivest, R.L., Shamir, A., Adleman, L.M.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(2), 120–126 (1978)
RSA Laboratories :RSAES-OAEP Encryption Scheme. Algorithm specification and supporting documentation, RSA Security Inc., Bedford, MA 01730 USA (2000), ftp://ftp.rsasecurity.com/pub/rsalabs/rsa_algorithm/rsa-oaep_spec.pdf
Skala, M., Roth, M., Hernaeus, N., Guyomarch, R., Koch, W.: GnuPG. Open source implementation (2009), http://www.gnupg.org Refer to gnupg-2.0.9.tar.bz2 (last download April 21, 2009)
Wohlmacher, P.: Bekanntmachung zur elektronischen Signatur nach dem Signaturgesetz und der Signaturverordnung (Übersicht über geeignete Algorithmen). Bundesanzeiger 13, 346–350 (2009), http://www.bundesnetzagentur.de/media/archive/14953.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loebenberger, D., Nüsken, M. (2011). Analyzing Standards for RSA Integers. In: Nitaj, A., Pointcheval, D. (eds) Progress in Cryptology – AFRICACRYPT 2011. AFRICACRYPT 2011. Lecture Notes in Computer Science, vol 6737. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21969-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-21969-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21968-9
Online ISBN: 978-3-642-21969-6
eBook Packages: Computer ScienceComputer Science (R0)