Public Key Cryptography - PKC 2006

DOI10.1007/11745853zbMath1151.94499OpenAlexW4205680410MaRDI QIDQ5898943

An Commeine, I. A. Semaev

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11745853

zbMATH Keywords

number field sievediscrete logarithms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (9)

Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ When e-th Roots Become Easier Than Factoring ⋮ A Kilobit Hidden SNFS Discrete Logarithm Computation ⋮ The number field sieve for integers of low weight ⋮ Updating key size estimations for pairings ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Refined analysis to the extended tower number field sieve ⋮ Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case

This page was built for publication: Public Key Cryptography - PKC 2006