The complexity of certain multi-exponentiation techniques in cryptography
From MaRDI portal
Publication:2499259
DOI10.1007/s00145-004-0229-5zbMath1096.94021OpenAlexW2157992966WikidataQ87182187 ScholiaQ87182187MaRDI QIDQ2499259
Publication date: 14 August 2006
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-004-0229-5
exponentiationXTRscalar multiplicationelliptic and hyperelliptic curvesinteger recodinggroups with automorphismstrace zero varieties
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Finite abelian groups (20K01)
Related Items (13)
On Group Structures Realized by Elliptic Curves over a Fixed Finite Field ⋮ On Group Structures Realized by Elliptic Curves over Arbitrary Finite Fields ⋮ Certificateless Proxy Re-Encryption Without Pairings ⋮ Post-quantum anonymous one-sided authenticated key exchange without random oracles ⋮ Non-interactive multisignatures in the plain public-key model with efficient verification ⋮ Succinct Diophantine-satisfiability arguments ⋮ A note on asynchronous multi-exponentiation algorithm using binary representation ⋮ Faster Addition and Doubling on Elliptic Curves ⋮ Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions ⋮ Efficient message transmission via twisted Edwards curves ⋮ PRE: stronger security notions and efficient construction with non-interactive opening ⋮ Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations ⋮ ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS
Uses Software
This page was built for publication: The complexity of certain multi-exponentiation techniques in cryptography
