Abstract
Fully saturated zero-dimensional binomial ideals (lattice ideals) describe lattices on Z n that are of interest in cryptanalysis. Gröbner basis computation for these ideals are computationally very intensive. We sketch a modified version of Buchberger's algorithm for lattice ideals that are closed with respect to a group action on their indeterminates. The main idea is to exploit the symmetries of such ideals to avoid performing S-polynomial reductions that are "equivalent" with respect to the group action. Using our techniques the number of S-polynomials to be considered can be reduced by a factor up to the order of the group.
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.
