Abstract
In this paper, we draw connections between ideal lattices and multivariate polynomial rings over integers using Gröbner bases. Univariate ideal lattices are ideals in the residue class ring, [Formula: see text] (here [Formula: see text] is a monic polynomial) and cryptographic primitives have been built based on these objects. Ideal lattices in the univariate case are generalizations of cyclic lattices. We introduce the notion of multivariate cyclic lattices and show that ideal lattices are a generalization of them in the multivariate case too. Based on multivariate ideal lattices, we construct hash functions using Gröbner basis techniques. We define a worst case problem, shortest substitution problem with respect to an ideal in [Formula: see text], and use its computational hardness to establish the collision resistance of the hash functions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
