Publication:2757235
From MaRDI portal
zbMath0973.11520MaRDI QIDQ2757235
Publication date: 25 November 2001
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
11Y16: Number-theoretic algorithms; complexity
Related Items
Factoring multivariate polynomials via partial differential equations, Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method, A Kilobit Special Number Field Sieve Factorization, Proving properties of matrices over \({\mathbb{Z}_{2}}\), An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\), Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm, A new efficient algorithm for computing Gröbner bases \((F_4)\), \(\mathbb F _2 \) Lanczos revisited, On polynomial selection for the general number field sieve, Euclid’s algorithm and the Lanczos method over finite fields