Improved resultant attack against arithmetization-oriented primitives
From MaRDI portal
Cites work
- \textsc{Poseidon}2: a faster version of the \textsc{Poseidon} hash function
- \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications
- A new efficient algorithm for computing Gröbner bases (F₄)
- A new security evaluation method based on resultant for arithmetic-oriented algorithms
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Fast arithmetic for triangular sets: from theory to practice
- Faster change of order algorithm for Gröbner bases under shape and stability assumptions
- scientific article; zbMATH DE number 3709576 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- Improved resultant attack against arithmetization-oriented primitives
- New design techniques for efficient arithmetization-oriented hash functions: \texttt{Anemoi} permutations and \texttt{Jive} compression mode
- On fast multiplication of polynomials over arbitrary algebras
- Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
- The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives
- Using Algebraic Geometry
Cited in
(2)
This page was built for publication: Improved resultant attack against arithmetization-oriented primitives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862746)