Sciweavers

21 search results - page 1 / 5
» Fast Exhaustive Search for Polynomial Systems in F2
Sort
View
CHES
2010
Springer
132views Cryptology» more  CHES 2010»
13 years 12 months ago
Fast Exhaustive Search for Polynomial Systems in F2
Charles Bouillaguet, Hsieh-Chung Chen, Chen-Mou Ch...
ICCD
2006
IEEE
113views Hardware» more  ICCD 2006»
14 years 7 months ago
High-speed Factorization Architecture for Soft-decision Reed-Solomon Decoding
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...
Xinmiao Zhang
EUROCRYPT
2000
Springer
14 years 2 months ago
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
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...
Nicolas Courtois, Alexander Klimov, Jacques Patari...
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
14 years 4 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
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...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
FSE
2011
Springer
264views Cryptology» more  FSE 2011»
13 years 2 months ago
An Improved Algebraic Attack on Hamsi-256
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...
Itai Dinur, Adi Shamir