The complexity of certain multi-exponentiation techniques in cryptography

DOI10.1007/S00145-004-0229-5MaRDI QIDQ2499259zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Roberto Maria Avanzi

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

zbMATH Keywords

elliptic and hyperelliptic curvesexponentiationgroups with automorphismsinteger recodingscalar multiplicationtrace zero varietiesXTR

Mathematics Subject Classification ID

Finite abelian groups (20K01) Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1057744
• Complexity theoretic aspects of some cryptographic functions
• Number theoretic methods in cryptography. Complexity lower bounds
• scientific article; zbMATH DE number 1024029
• Parallel computation of the multi-exponentiation for cryptosystems
• The Complexity of Public-Key Cryptography
• scientific article; zbMATH DE number 1322886
• scientific article; zbMATH DE number 1024499
• Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption
• On the complexity of multiplication in finite fields

Cited in

(21)

• Non-interactive multisignatures in the plain public-key model with efficient verification
• PRE: stronger security notions and efficient construction with non-interactive opening
• Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
• The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
• Succinct Diophantine-satisfiability arguments
• On group structures realized by elliptic curves over a fixed finite field
• On group structures realized by elliptic curves over arbitrary finite fields
• Exponentiating in pairing groups
• Certificateless proxy re-encryption without pairings
• The new concept of path contributing to the cryptographic strength exceeding 2N
• ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS
• A note on asynchronous multi-exponentiation algorithm using binary representation
• scientific article; zbMATH DE number 2085203 (Why is no real title available?)
• Efficient message transmission via twisted Edwards curves
• Faster Addition and Doubling on Elliptic Curves
• Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations
• Public Key Cryptography - PKC 2005
• Topics in Cryptology – CT-RSA 2004
• Post-quantum anonymous one-sided authenticated key exchange without random oracles
• Fuzzy perspective of online games by using cryptography and cooperative game theory
• Application of Mordell-Weil lattices with large kissing numbers to acceleration of multiscalar multiplication on elliptic curves

Describes a project that uses

Uses Software

• Maple

This page was built for publication: The complexity of certain multi-exponentiation techniques in cryptography

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