Special prime numbers and discrete logs in finite prime fields

DOI10.1090/S0025-5718-00-01308-9zbMath1057.11070MaRDI QIDQ2759106

I. A. Semaev

Publication date: 10 December 2001

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

zbMATH Keywords

cryptographydiscrete logarithmsNumber Field Sieve

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (7)

Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation ⋮ A Kilobit Hidden SNFS Discrete Logarithm Computation ⋮ Updating key size estimations for pairings ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле ⋮ Refined analysis to the extended tower number field sieve ⋮ A Brief History of Pairings

Cites Work

• On a problem of Oppenheim concerning Factorisatio Numerorum
• Factoring integers with elliptic curves
• Discrete logarithms in \(\mathrm{GF}(p)\)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Solving sparse linear equations over finite fields
• New directions in cryptography
• Searching for Primitive Roots in Finite Fields
• Discrete logarithms and local units
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Special prime numbers and discrete logs in finite prime fields