Discrete Lattice Cryptosystem based on q-ary Lattice Polynomial
Keywords:
DLC, q-ary, Field, Vector Space, Linear transformation, Probabilistic distributionAbstract
In this paper, a new post-quantum lattice cryptosystem is proposed based on the discrete structure of the lattice referred to as the discrete lattice cryptosystem (DLC). There are three concepts in DLC, i.e. polynomial algebra, reduction modulo and probability. The proposed DLC is secure and practical, both due to the hardness of the discrete structure of the lattice defined over the q-ary matrix transformation. The q-ary lattice problems are the extended lattice problems over the field; thus these are advanced lattice problems with more hardness than the lattice problems due to its extension possibilities in finite-dimensional vector spaces over the field. The flexibility and extendibility of the hardness of q-ary lattice problems interact with standard cryptographic protocols. This paper deals with q-ary lattice problems and their application in a cryptosystem with computational complexity and flow algorithms. The hardness of q-ary lattice problems interacts with the field characteristics and its extension through finite-dimensional vector spaces, linear transformations, and probabilistic distributions.
References
W. Diffie and M. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644–654, Nov. 1976.
T. Elgamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, vol. 31, no. 4, pp. 469–472, Jul. 1985.
M. Ajtai, “Generating hard instances of lattice problems (extended abstract),” Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing - STOC ’96, pp. 99–108, 1996.
M. Ajtai, R. Kumar, and D. Sivakumar, “A sieve algorithm for the shortest lattice vector problem,” STOC ’01: Proceedings of the thirty-third annual ACM symposium on Theory of Computing, pp. 601–610, Jul. 2001.
O. Regev, “On lattices, learning with errors, random linear codes, and cryptography,” Journal of the ACM, vol. 56, no. 6, pp. 1–40, Sep. 2009.
O. Regev, “The Learning with Errors Problem,” CCC '10: Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity, pp. 191 – 2, 2010.
R. R. L and A. L, “On Data Banks and Privacy Homomorphism. In DeMillo, R.A., Ed., Foundations of Secure Computation, Academic Press, New York, 169-179. Scientific Research Publishing,” Scirp.org, 2017.
R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120–126, Feb. 1978.
N. P. Smart and F. Vercauteren, “Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes,” Cryptology ePrint Archive, Dec. 2009.
