The index calculus method using non-smooth polynomials

DOI10.1090/S0025-5718-01-01298-4zbMath0982.11071MaRDI QIDQ2719078

Daniel Panario, Theodoulos Garefalakis

Publication date: 14 May 2001

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

finite fieldscryptographydiscrete logarithmssmooth polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items (4)

The generalized Weil pairing and the discrete logarithm problem on elliptic curves ⋮ Enumeration of decomposable combinatorial structures with restricted patterns ⋮ Permutation polynomials and factorization ⋮ Sequences of consecutive smooth polynomials over a finite field

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Advances in Cryptology - CRYPTO '90. A conference on the theory and application of Cryptography, Univ. of California, Santa Barbara, USA, August 11--15, 1990. Proceedings
• Fast evaluation of logarithms in fields of characteristic two
• Computing Logarithms in Finite Fields of Characteristic Two
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• On the covering radius of binary, linear codes meeting the Griesmer bound
• Solving sparse linear equations over finite fields
• New directions in cryptography
• Computing discrete logarithms in real quadratic congruence function fields of large genus
• Gauss periods: orders and cryptographical applications
• Polynomials over finite fields free from large and small degree irreducible factors
• Factoring polynomials over finite fields: A survey

This page was built for publication: The index calculus method using non-smooth polynomials