Back to Results
First PageMeta Content
Polynomials / Post-quantum cryptography / Computer algebra / Finite fields / Algebraic geometry / Hidden Field Equations / Multivariate cryptography / Gröbner basis / Field extension / Abstract algebra / Algebra / Mathematics


A Family of Weak Keys in HFE (and the Corresponding Practical Key-Recovery) Charles Bouillaguet1 , Pierre-Alain Fouque1 , Antoine Joux2,3 , and Joana Treger2 1 Ecole Normale Supérieure
Add to Reading List

Document Date: 2009-12-15 10:42:41


Open Document

File Size: 377,18 KB

Share Result on Facebook

City

Fq0 / /

/

IndustryTerm

polynomial time algorithms / polynomial systems / faster algorithm / crypto-processor / namely computing / polynomial decomposition algorithms / linear applications / particular solution / generic algorithms / basis algorithms / random systems / quantum algorithms / /

Organization

Ecole Normale Supérieure / Organization of the Paper Section / /

Person

Patarin / Weak Keys / /

ProgrammingLanguage

L / /

ProvinceOrState

Oregon / /

Technology

polynomial decomposition algorithms / faster algorithm / cryptography / degree polynomial using Berlekamp algorithm / public key / quantum algorithms / known algorithms / IP algorithms / 3 Known Algorithms / private key / secret key / polynomial time algorithms / polynomial-time IP algorithms / Gröbner basis algorithms / F5 algorithm / /

SocialTag