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

DOI10.1080/0020716021000059151zbMath1028.11078OpenAlexW2056686327MaRDI QIDQ4707308

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

elliptic curvessievingfactorizationquantum computingindex calculusdiscrete logarithmspublic-key securityXedni calculus

Mathematics Subject Classification ID

Quantum computation (81P68) Factorization (11Y05)

Cites Work

• The development of the number field sieve
• Factoring integers with elliptic curves
• The Xedni calculus and the elliptic curve discrete logarithm problem
• Analysis of the Xedni calculus attack
• An Implementation of the Number Field Sieve
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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