21 search results - page 1 / 5 » Fast Exhaustive Search for Polynomial Systems in F2 |
CHES
2010
Springer
13 years 5 months ago
2010
Springer
ICCD
2006
IEEE
14 years 1 months ago
2006
IEEE
Reed-Solomon (RS) codes are among the most widely utilized error-correcting codes in modern communication and computer systems. Among the decoding algorithms of RS codes, the rece...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard ove...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
FSE
2011
Springer
12 years 8 months ago
2011
Springer
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...