Fast Exhaustive Search for Polynomial Systems in ${\mathbb{F}_2}$
From MaRDI portal
Publication:3583450
DOI10.1007/978-3-642-15031-9_14zbMath1297.94055MaRDI QIDQ3583450
Charles Bouillaguet, Adi Shamir, Bo-Yin Yang, Ruben Niederhagen, Chen-Mou Cheng, Tung Chou, Hsieh-Chung Chen
Publication date: 17 August 2010
Published in: Cryptographic Hardware and Embedded Systems, CHES 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15031-9_14
multivariate polynomials; parallelization; exhaustive search; solving systems of equations; Graphic Processing Units (GPUs)
68W30: Symbolic computation and algebraic computation
94A60: Cryptography
11T06: Polynomials over finite fields