Cca-Secure Key Encapsulation Mechanism Based on Factoring Assumption

Márton Gyöngyvér

doi:10.2478/v10127-012-0043-7

.blurhash-client-img { display: none !important; }

Cca-Secure Key Encapsulation Mechanism Based on Factoring Assumption

Tatra Mountains Mathematical Publications

Volume 53 (2012): Issue 1 (December 2012)

By: Márton Gyöngyvér

Open Access

|Feb 2013

Abstract

In this article a key encapsulation mechanism is presented which is based on squaring function, where the input element is from QR⁺_N, where QR⁺_N denotes the signed quadratic residue group, and N is a Blum integer. The article presents the soundness, the efficiency and the proof of CCA security of the proposed mechanism

References

[1] BLEICHENBACHER, D.: Chosen ciphertext attacks against protocols based on the RSAencryption standard PKCS #1, in: Advances in Cryptology-CRYPTO ’98, 18th Annual International Cryptology Conference, Santa Barbara, CA, USA, 1998 (H. Krawczyk, ed.), Lect. Notes Comput. Sci. Vol. 1462, Springer-Verlag, Berlin, 1998, pp. 1-12.
Search in Google Scholar
[2] BLUM, L.-BLUM, M.-SHUB, M.: Comparison of two pseudo random number generators, in: Advances in Cryptology-CRYPTO ’82, Santa Barbara, California, USA, 1982 (T. Sherman et al., eds.), Plenum Press, New York, 1983, pp. 61-78.10.1007/978-1-4757-0602-4_6
Search in Google Scholar
[3] BLUM, M.-GOLDWASSER, S.: An effcient probabilistic public-key encryption schemewhich hides all partial information, in: Advances in Cryptology-CRYPTO ’84 Santa Barbara, California, USA, 1984 (G. R. Blakley et al., eds.), Lect. Notes Comput. Sci. Vol. 196, Springer-Verlag, Berlin, 1985, pp. 289-302.10.1007/3-540-39568-7_23
Search in Google Scholar
[4] CRAMER, R.-SHOUP, V.: Design and analysis of practical public-key encryptionschemes secure against adaptive chosen ciphertext attack, SIAM J. Comput. 33 (2003), 167-226.10.1137/S0097539702403773
Search in Google Scholar
[5] HOFHEINZ, D.-KILTZ, E.-SHOUP, V.: Practical chosen ciphertext secure encryptionfrom factoring, J. Cryptology, Online FirstTM, 19 December, 2011, 1-17.10.1007/s00145-011-9115-0
Search in Google Scholar
[6] RABIN, M.: Digitalized signatures as intractable as factorization, Technical Report MIT/LCS/TR-212, MIT Laboratory for Computer Science, January 1979.
Search in Google Scholar
[7] WIENER, M. J.: Safe prime generation with a combined sieve, Crypto Eprint Archive entry 2003:186.
Search in Google Scholar