article

Discrete logarithms in GF(P) using the number field sieve

Author:

Daniel M. GordonAuthors Info & Claims

SIAM Journal on Discrete Mathematics, Volume 6, Issue 1

Pages 124 - 138

https://doi.org/10.1137/0406010

Published: 01 February 1993 Publication History

Abstract

No abstract available.

Cited By

View all

Biryukov AFisch BHerold GKhovratovich DLeurent GNaya-Plasencia MWesolowski B(2024)Cryptanalysis of Algebraic Verifiable Delay FunctionsAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68382-4_14(457-490)Online publication date: 18-Aug-2024
Yun YMiao FXu Z(2023)A provable secure group key management scheme based on the Chinese remainder theorem and Pohlig-Hellman Exponential CipherProceedings of the 2023 4th International Conference on Computer Science and Management Technology10.1145/3644523.3644633(602-608)Online publication date: 13-Oct-2023
(2022)Democratizing CryptographyundefinedOnline publication date: 24-Aug-2022
Show More Cited By

Index Terms

Discrete logarithms in GF(P) using the number field sieve
1. Mathematics of computing
  1. Discrete mathematics
  2. Mathematical software

Recommendations

An algorithm to solve the discrete logarithm problem with the number field sieve
PKC'06: Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography

Recently, Shirokauer's algorithm to solve the discrete logarithm problem modulo a prime p has been modified by Matyukhin, yielding an algorithm with running time $L_{p}[\frac{1}{3},1.09018...]$, which is, at the present time, the best known estimate of ...
An experiment of number field sieve over GF(p) of low hamming weight characteristic
IWCC'11: Proceedings of the Third international conference on Coding and cryptology

The security of the digital signature algorithm (DSA) and Diffie-Hellman key exchange is based on the difficulty of the discrete logarithm problems (DLP) over prime field GF(p), and thus it is important to evaluate the difficulty of the DLP over GF(p) ...
Improvements to the general number field sieve for discrete logarithms in prime fields: a comparison with the Gaussian integer method

In this paper, we describe many improvements to the number field sieve. Our main contribution consists of a new way to compute individual logarithms with the number field sieve without solving a very large linear system for each logarithm. We show that, ...

Comments

Information & Contributors

Information

Published In

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 February 1993

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

56
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Biryukov AFisch BHerold GKhovratovich DLeurent GNaya-Plasencia MWesolowski B(2024)Cryptanalysis of Algebraic Verifiable Delay FunctionsAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68382-4_14(457-490)Online publication date: 18-Aug-2024
Yun YMiao FXu Z(2023)A provable secure group key management scheme based on the Chinese remainder theorem and Pohlig-Hellman Exponential CipherProceedings of the 2023 4th International Conference on Computer Science and Management Technology10.1145/3644523.3644633(602-608)Online publication date: 13-Oct-2023
(2022)Democratizing CryptographyundefinedOnline publication date: 24-Aug-2022
Döttling NGarg S(2021)Identity-based Encryption from the Diffie-Hellman AssumptionJournal of the ACM10.1145/342237068:3(1-46)Online publication date: 22-Mar-2021
Chen QHan JLi JChen LLi S(2021)A Privacy-Preserving Logistics Information System with TraceabilityCyberspace Safety and Security10.1007/978-3-030-94029-4_11(145-163)Online publication date: 9-Nov-2021
Dinur IKeller NKlein O(2020)An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret SharingJournal of Cryptology10.1007/s00145-019-09330-233:3(824-873)Online publication date: 1-Jul-2020
De Micheli GGaudry PPierrot C(2020)Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite FieldsAdvances in Cryptology – CRYPTO 202010.1007/978-3-030-56880-1_2(32-61)Online publication date: 17-Aug-2020
Hastings MHeninger NWustrow E(2019)Short Paper: The Proof is in the PuddingFinancial Cryptography and Data Security10.1007/978-3-030-32101-7_24(396-404)Online publication date: 18-Feb-2019
Mizuide TTakayasu ATakagi T(2019)Tight Reductions for Diffie-Hellman Variants in the Algebraic Group ModelTopics in Cryptology – CT-RSA 201910.1007/978-3-030-12612-4_9(169-188)Online publication date: 4-Mar-2019
Adrian DBhargavan KDurumeric ZGaudry PGreen MHalderman JHeninger NSpringall DThomé EValenta LVanderSloot BWustrow EZanella-Béguelin SZimmermann P(2018)Imperfect forward secrecyCommunications of the ACM10.1145/329203562:1(106-114)Online publication date: 19-Dec-2018
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

An algorithm to solve the discrete logarithm problem with the number field sieve

An experiment of number field sieve over GF(p) of low hamming weight characteristic

Improvements to the general number field sieve for discrete logarithms in prime fields: a comparison with the Gaussian integer method

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations