Multi-exponentiation (cryptographic protocols)
From MaRDI portal
Publication:4323590
DOI10.1049/ip-cdt:19941271zbMath0815.94009OpenAlexW2146443249MaRDI QIDQ4323590
Arjen K. Lenstra, Chi-Sung Laih, Sung-Ming Yen
Publication date: 23 February 1995
Published in: IEE Proceedings - Computers and Digital Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1049/ip-cdt:19941271
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Parallel algorithms in computer science (68W10)
Related Items (9)
Speeding up the computations of elliptic curves cryptoschemes ⋮ Fast batch modular exponentiation with common-multiplicand multiplication ⋮ Fast modular multi-exponentiation using modified complex arithmetic ⋮ Parallel algorithms for modular multi-exponentiation ⋮ Multiple point compression on elliptic curves ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation ⋮ SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM ⋮ Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation ⋮ Parallel computation of the multi-exponentiation for cryptosystems
This page was built for publication: Multi-exponentiation (cryptographic protocols)