On ideal lattices, Gröbner bases and generalized hash functions

DOI10.1142/S0219498818501128zbMath1391.14048arXiv1410.2011MaRDI QIDQ4563584

Maria Francis, Ambedkar Dukkipati

Publication date: 1 June 2018

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.2011

zbMATH Keywords

hash functionsGröbner bases over ringsmultivariate ideal lattices

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

A signature-based algorithm for computing Gröbner bases over principal ideal domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Binomial generation of the radical of a lattice ideal
• On the construction of Gröbner bases using syzygies
• Gröbner bases and primary decomposition of polynomial ideals
• Birational automorphisms of higher-dimensional algebraic varieties
• Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
• Computing toric ideals
• Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings
• Gröbner bases with coefficients in rings
• Generalized Compact Knapsacks Are Collision Resistant
• Lattice-Based Identification Schemes Secure Under Active Attacks
• Asymptotically Efficient Lattice-Based Digital Signatures
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures