Research ArticleOpen AccessGoogle Scholar indexed
Double-Moduli Gaussian Encryption/Decryption with Primary Residues and Secret Controls
- 1
International Journal of Communications, Network and System Sciences·Volume 04 (2011)·Pages 475–481·Published 6 July 2011·DOI10.4236/ijcns.2011.47058
Copy link · social · email
Abstract
In this paper an encryption-decryption algorithm based on two moduli is described: one in the real field of integers and another in the field of complex integers. Also the proper selection of cryptographic system parameters is described. Several numeric illustrations explain step-by-step how to precondition a plaintext, how to select secret control parameters, how to ensure feasibility of all private keys and how to avoid ambiguity in the process of information recovery. The proposed cryptographic system is faster than most of known public key cryptosystems, since it requires a small number of multiplications and additions, and does not require exponentiations for its implementation.
Keywordsambiguity-free information recoverycomplex moduluscryptosystem designcycling identityinformation hidingplaintext preconditioningprimary residuepublic-key cryptographysecret controlsthreshold parameters
- J. Hoffstein, J. Pipher and J. Silverman, “NTRU: A Ring- Based Public Key Cryptosystem,” Algorithmic Number Theory: 3rd International Symposium (Lecture Notes in Computer Science), Portland, Vol. 1423, 21-25 June 1998, pp. 267-288.
- J. Hoffstein, J. Pipher and J. Silverman, “NSS: An NTRU Lattice-Based Signature Scheme,” Advances in Cryptology—EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques (Lecture Notes in Computer Science), Innsbruck, Vol. 2045, 6-10 May 2001, pp. 211-228.
- N. Howgrave-Graham, P. Nguyen, D. Pointcheval, J. Proos, J. Silverman, A. Singer and W. Whyte, “The Impact of Decryption Failures on the Security of NTRU Encryption,” Advances in Cryptology—CRYPTO 2003: 23rd Annual International Cryptology Conference (Lecture Notes in Computer Science), Santa Barbara, Vol. 2729, 17-21 August 2003, pp. 226-246.
- D. Coppersmith and A. Shamir, “Lattice Attacks on NTRU,” Advances in Cryptology—EUROCRYPT ’97: International Conference on the Theory and Application of Cryptographic Techniques (Lecture Notes in Computer Science), Konstanz, Vol. 1233, 11-15 May 1997, pp. 52-61.
- E. Jaulmes and A. Joux, “A Chosen Ciphertext Attack against NTRU,” Advances in Cryptology—CRYPTO 2000: 20th Annual International Cryptology Conference (Lecture Notes in Computer Science), Santa Barbara, Vol. 1880, 20-24 August 2000, pp. 20-35.
- B. Verkhovsky, “Protection of Sensitive Messages Based on Quadratic Roots of Gaussians: Groups with Complex Modulus,” International Journal Communications, Network and System Sciences, Vol. 4, No. 5, 2011, pp. 287- 296. doi:10.4236/ijcns.2011.45033
- B. Verkhovsky, “Cubic Root Extractors of Gaussian Integers and Their Application in Fast Encryption for Time-Constrained Secure Communication,” International Journal Communications, Network and System Sciences, Vol. 4, No. 4, 2011, pp. 197-204. doi:10.4236/ijcns.2011.44024
- N. Koblitz and A. J. Menezes, “A Survey of Public-Key Cryptosystems,” Research Report, Department of Combinatorics & Optimization, University of Waterloo, Waterloo, August 2004, pp. 1-47.
- A. L. Toom, “The Complexity of a Scheme of Functional Elements Realizing the Multiplication of Integers,” Soviet Mathematics Doklady, No. 3, 1963, pp. 714-716.
- D. J. Bernstein, “Fast Multiplication and its Applications,” In: J. P. Buhler, P. Stevenhagen, Eds., “Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography”, MSRI, Cambridge University Press, New York, 2008, pp. 325-384.