An asymmetric Diffie-Hellman protocol with enhanced efficiency through parallelization

DOI10.62056/AEE0FHSFGMaRDI QIDQ7390772zbMATH OpenFDO

Authors Koki Jimbo

Publication date 2025

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AEE0FHSFG

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Advances in Cryptology - CRYPTO 2003
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
• CSIDH: an efficient post-quantum commutative group action
• scientific article; zbMATH DE number 4191102 (Why is no real title available?)
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 1302855 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 1759796 (Why is no real title available?)
• Monte Carlo Methods for Index Computation (mod p)
• More efficient oblivious transfer extensions
• New directions in cryptography
• On Diffie-Hellman Key Agreement with Short Exponents
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Public Key Cryptography – PKC 2004

This page was built for publication: An asymmetric Diffie-Hellman protocol with enhanced efficiency through parallelization

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