A geometric view of cryptographic equation solving

DOI10.1515/JMC.2008.004zbMath1146.68072OpenAlexW2102010256MaRDI QIDQ3516766

Maura B. Paterson, Sean Murphy

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

multivariate polynomialsprojective geometrycryptologylinearisationVeronese varietydeterminantal varietyXL algorithmGeometricXL algorithmrelinearisation

Mathematics Subject Classification ID

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

Related Items (2)

Boolean ring cryptographic equation solving ⋮ Free nilpotent and \(H\)-type Lie algebras. Combinatorial and orthogonal designs

Uses Software

• FGb

Cites Work

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

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