Abstract
Factoring-based public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which requires the generation of prime numbers. This is most inconvenient in settings where the key-generation is not an one-off process, e.g., for forwards secrecy. To this end, we extend the Goldwasser-Micali (GM) cryptosystem to a provably secure system, denoted SIS, where the generation of primes is bypassed. By developing on the correct choice of the parameters of SIS, we align SIS’s security guarantees (i.e., resistance to factoring of moduli, etc.) to those of other well-known factoring-based cryptosystems. Taking into consideration different possibilities to implement the fundamental operations, we explicitly compare and contrast the asymptotic complexity of well-known public-key cryptosystems (e.g., GM and/or RSA) with that of SIS’s. The latter shows that once we are ready to accept an increase in the size of the moduli, SIS offers a generally lower asymptotic complexity than, e.g., GM or even RSA.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Institute of Electrical and Electronics Engineers: IEEE Standard Specifications for Public Key Cryptography. IEEE 1363-2000 (2000), http://grouper.ieee.org/groups/1363/
Institute of Electrical and Electronics Engineers: ECRYPT II Yearly Report on Algorithms and Key Sizes. ECRYPT (2011), http://www.ecrypt.eu.org/documents/D.SPA.17.pdf
Bellovin, S.M., Merritt, M.: Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attacks. In: IEEE Symposium on Research in Security and Privacy, pp. 72–84 (1992)
Chernoff, H.: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations. The Annals of Mathematical Statistics 23(4), 493–507 (1952)
Erdös, P., Kac, M.: The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions. American Journal of Mathematics 62(1), 738–742 (1940)
The GNU Multiple Precision Arithmetic Library, http://gmplib.org
Goldwasser, S., Micali, S.: Probabilistic Encryption. J. Comput. Syst. Sci. 28(2), 270–299 (1984)
Hardy, G., Ramanujan, S.: The Normal Number of Prime Factors of a Number n. Quart. J. Math. 48, 76–92 (1917)
Hildebrand, A., Tenenbaum, G.: Integers without Large Prime Factors. Prépublications de l’Institut Elie Cartan. Dép. de Math., Univ. de Nancy I (1991)
Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory. Springer (1990)
Joye, M., Libert, B.: Efficient Cryptosystems From 2k-th Power Residue Symbols. In: EUROCRYPT (2013)
Karatsuba, A., Ofman, Y.: Multiplication of Multidigit Numbers on Automata. Soviet Physics Doklady 7, 595–596 (1978)
Knuth, D.E., Pardo, L.T.: Analysis of a Simple Factorization Algorithm. Theoretical Computer Science 3(3), 321–348 (1976)
Lenstra, A.K., Lenstra Jr., H.W. (eds.): The Development of the Number Field Sieve. Lecture Notes in Mathematics, vol. 1554. Springer, Berlin (1993)
Lenstra Jr., H.W.: Factoring Integers with Elliptic Curves. Ann. of Math. (2) 126(3), 649–673 (1987)
van de Lune, J., Wattel, E.: On the Numerical Solution of a Differential-Difference Equation Arising in Analytic Number Theory. Mathematics of Computation 23, 417–421 (1969)
Mceliece, R.J.: A Public-Key Cryptosystem Based on Algebraic Coding Theory. Tech. rep., Jet Propulsion Lab Deep Space Network Progress Report (1978)
Mohassel, P.: Efficient and Secure Delegation of Linear Algebra. Cryptology ePrint Archive, Report 2011/605 (2011), http://eprint.iacr.org/
Monnerat, J.: Short Undeniable Signatures: Design, Analysis, and Applications. Ph.D. thesis, École Polytechnique Fédérale de Lausanne (2006)
Monnerat, J., Vaudenay, S.: Short Undeniable Signatures Based on Group Homomorphisms. Journal of Cryptology 24(3), 545–587 (2011)
Rivest, R.L., Shamir, A., Adleman, L.: A method for Obtaining Digital Signatures and Public-Key Cryptosystems. Commun. ACM 21, 120–126 (1978)
Sage Mathematics Software, http://www.sagemath.org
Schönhage, A., Strassen, V.: Schnelle Multiplikation grosser Zahlen. Computing 7, 281–292 (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bogos, S., Boureanu, I., Vaudenay, S. (2013). Primeless Factoring-Based Cryptography. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds) Applied Cryptography and Network Security. ACNS 2013. Lecture Notes in Computer Science, vol 7954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38980-1_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-38980-1_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38979-5
Online ISBN: 978-3-642-38980-1
eBook Packages: Computer ScienceComputer Science (R0)