Journal of Symbolic Computation
Fast cryptanalysis of the Matsumoto-Imai public key scheme
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
I: Basic technologies: TESS: A security system based on discrete exponentiation
Computer Communications
Irreducible polynomials with consecutive zero coefficients
Finite Fields and Their Applications
A survey on fast correlation attacks
Cryptography and Communications
On polynomial systems arising from a weil descent
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 754.84 |
A method for determining logarithms in GF(2^{n})is presented. Its asymptotic running time isO(exp (cn^{1/3} log^{2/3} n))for a small constantc, while, by comparison, Adleman's scheme runs in timeO(exp (c^{'}n^{1/2} log^{1/2} n )). The ideas give a dramatic improvement even for moderate-sized fields such as GF(2^{127}), and make (barely) possible computations in fields of size around2^{400}. The method is not applicable to GF(q)for a large primeq.