A geometric view of cryptographic equation solving

DOI10.1515/JMC.2008.004MaRDI QIDQ3516766zbMATH OpenOpenAlexFDO

Authors Sean Murphy, Maura Paterson

Publication date 11 August 2008

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/jmc.2008.004

zbMATH Keywords

cryptologydeterminantal varietyGeometricXL algorithmlinearisationmultivariate polynomialsprojective geometryrelinearisationVeronese varietyXL algorithm

Mathematics Subject Classification ID

Projective techniques in algebraic geometry (14N05) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Geometric ideas for cryptographic equation solving in even characteristic
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• All in the XL Family: Theory and Practice
• scientific article; zbMATH DE number 1962148
• The XL-Algorithm and a Conjecture from Commutative Algebra

Cites work

• A new efficient algorithm for computing Gröbner bases (F₄)
• Chordal varieties of Veronese varieties and catalecticant matrices
• Résolution des systèmes d'équations algébriques
• Solving systems of algebraic equations
• The Veronese variety and catalecticant matrices
• Über Veronesesche Varietäten und deren Projektionen

Cited in

(5)

• Geometric ideas for cryptographic equation solving in even characteristic
• scientific article; zbMATH DE number 4048521 (Why is no real title available?)
• scientific article; zbMATH DE number 58014 (Why is no real title available?)
• Free nilpotent and \(H\)-type Lie algebras. Combinatorial and orthogonal designs
• Boolean ring cryptographic equation solving

Describes a project that uses

Uses Software

• FGb

This page was built for publication: A geometric view of cryptographic equation solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3516766)