Beyond sequential walks: parallelizing the GA-dlog problem

DOI10.1007/978-3-032-13301-4_11MaRDI QIDQ6840150zbMATH OpenFDO

Authors Sudeshna Karmakar, Abul Kalam, Santanu Sarkar

Publication date 23 March 2026

Full work available at URL https://doi.org/10.1007/978-3-032-13301-4_11

zbMATH Keywords

GA-dlogMay-Ostuzzi algorithmparallelizationrandom walks

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• A monte carlo method for factorization
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Rigorous Subexponential Algorithm For Computation of Class Groups
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Authenticated key exchange secure against dictionary attacks
• Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
• Counting points on elliptic curves over finite fields
• CSI-FiSh: efficient isogeny based signatures through class group computations
• CSIDH: an efficient post-quantum commutative group action
• Elliptic Curve Cryptosystems
• Fast quantum algorithms for computing the unit group and class group of a number field
• scientific article; zbMATH DE number 503244 (Why is no real title available?)
• scientific article; zbMATH DE number 2086697 (Why is no real title available?)
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• Multiple group action dlogs with(out) precomputation
• New directions in cryptography
• Parallel collision search with cryptanalytic applications
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• SeaSign: compact isogeny signatures from class group actions
• The Discrete Logarithm problem with preprocessing
• Towards practical key exchange from ordinary isogeny graphs
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

This page was built for publication: Beyond sequential walks: parallelizing the GA-dlog problem

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