double-moduli gaussian encryptiondecryption with primary residues and secret controlsdouble-moduli高斯encryptiondecryption主要残留和秘密控制.pdfVIP

Int. J. Communications, Network and System Sciences, 2011, 4, 475-481 doi:10.4236/ijcns.2011.47058 Published Online July 2011 (http://www.SciRP.org/journal/ijcns) Double-Moduli Gaussian Encryption/Decryption with Primary Residues and Secret Controls Boris S. Verkhovsky Computer Science Department, New Jersey Institute of Technology , University Heights, Newark, USA E-mail : verb73@ Received June 22, 2011; revised July 5, 2011; accepted July 19, 2011 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 pa- rameters is described. Several numeric illustrations explain step-by-step how to pre-condition a plaintext, how to select secret control parameters, how to ensure feasibility of all private keys and how to avoid ambi- guity in the process of information recovery. The proposed public key 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. Keywords: Ambiguity-Free Information Recovery, Complex Modulus, Cryptosystem Design, Cycling Identity, Information Hiding, Plaintext Preconditioning, Primary Residue, Public-Key Cryptography, Secret Controls, Threshold Parameters 1. Introduction and Primary Residues formation. In the proposed cryptosystem there is no necessity to This paper describes and briefly analyzes a public key consider polynomials with binary coefficients as