- Record: found
- Abstract: not found
- Book Chapter: not found
Cryptographic Hardware and Embedded Systems, CHES 2010
Fast Exhaustive Search for Polynomial Systems in ${\mathbb{F}_2}$
other
Read this book at
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references17
- Record: found
- Abstract: not found
- Article: not found
A new efficient algorithm for computing Gröbner bases (F4)
Jean-Charles Faugère (1999)
- Record: found
- Abstract: not found
- Conference Proceedings: not found
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Jean Charles Faugère (2002)
- Record: found
- Abstract: not found
- Book Chapter: not found
Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
Jacques Patarin (1996)