Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

84

Voted

CHES
2010
Springer

132views Cryptology» more CHES 2010»

Fast Exhaustive Search for Polynomial Systems in F2

15 years 3 months ago

Fast Exhaustive Search for Polynomial Systems in F2

Download www.iis.sinica.edu.tw

Charles Bouillaguet, Hsieh-Chung Chen, Chen-Mou Ch

Real-time Traffic

CHES 2010 | Cryptology |

claim paper

Related Content

» Highspeed Factorization Architecture for Softdecision ReedSolomon Decoding

» Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations

» Approximating covering problems by randomized search heuristics using multiobjective model...

» An Improved Algebraic Attack on Hamsi256

» Fast motion estimation with modified diamond search for variable motion block sizes

» Visual Attention for Object Recognition in Spatial 3D Data

» Fast Structural Similarity Search Based on Topology String Matching

» Fast Translation Rule Matching for Syntaxbased Statistical Machine Translation

» A graph theory based scheduling algorithm For MIMOCDMA systems using zero forcing beamform...

Post Info
More Details (n/a)

Added	08 Nov 2010
Updated	08 Nov 2010
Type	Conference
Year	2010
Where	CHES
Authors	Charles Bouillaguet, Hsieh-Chung Chen, Chen-Mou Cheng, Tung Chou, Ruben Niederhagen, Adi Shamir, Bo-Yin Yang

Comments (0)