Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus

DOI10.1080/0020716021000059151MaRDI QIDQ4707308zbMATH OpenOpenAlexFDO

Authors Song Yuan Yan

Publication date 26 October 2003

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020716021000059151

zbMATH Keywords

discrete logarithmselliptic curvesfactorizationindex calculuspublic-key securityquantum computingsievingXedni calculus

Mathematics Subject Classification ID

Factorization (11Y05) Quantum computation (81P68)

Recommendations

• Computation of discrete logarithms in prime fields
• scientific article; zbMATH DE number 503279
• scientific article; zbMATH DE number 549859
• Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
• Number-theoretical methods of factoring composite numbers and calculating the discrete logarithm
• On reducing factorization to the discrete logarithm problem modulo a composite
• Discrete logarithms: The effectiveness of the index calculus method
• The Xedni calculus and the elliptic curve discrete logarithm problem
• Computing discrete logarithms with the general number field sieve
• scientific article; zbMATH DE number 4077312

Cites work

• An Implementation of the Number Field Sieve
• Analysis of the Xedni calculus attack
• Factoring integers with elliptic curves
• scientific article; zbMATH DE number 1696618 (Why is no real title available?)
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 4212179 (Why is no real title available?)
• scientific article; zbMATH DE number 5787962 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 706265 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• The development of the number field sieve
• The Xedni calculus and the elliptic curve discrete logarithm problem

Cited in

(3)

• The Xedni calculus and the elliptic curve discrete logarithm problem
• Discrete logarithms: The effectiveness of the index calculus method
• scientific article; zbMATH DE number 2154291 (Why is no real title available?)

This page was built for publication: Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4707308)