21 search results - page 4 / 5 » Block Ciphers and Systems of Quadratic Equations |
ASIACRYPT
2005
Springer
13 years 10 months ago
2005
Springer
The XSL “algorithm” is a method for solving systems of multivariate polynomial equations based on the linearization method. It was proposed in 2002 as a dedicated method for ex...
EUROCRYPT
2009
Springer
14 years 5 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
ACISP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. XL was first introduced to solve determined or overdetermined systems of equations over a finite field as an “algebraic attack” against multivariate cryptosystems....
FCCM
2006
IEEE
13 years 11 months ago
2006
IEEE
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
TCOS
2010
13 years 1 hour ago
2010
Abstract. In [24] Raddum and Semaev propose a technique to solve systems of polynomial equations over F2 as occurring in algebraic attacks on block ciphers. This approach is known ...