The complexity of certain multi-exponentiation techniques in cryptography
From MaRDI portal
Publication:2499259
DOI10.1007/s00145-004-0229-5zbMath1096.94021WikidataQ87182187 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
exponentiation; XTR; scalar multiplication; elliptic and hyperelliptic curves; integer recoding; groups with automorphisms; trace zero varieties
68Q25: Analysis of algorithms and problem complexity
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
20K01: Finite abelian groups
Related Items
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, Post-quantum anonymous one-sided authenticated key exchange without random oracles, A note on asynchronous multi-exponentiation algorithm using binary representation, 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, 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, Certificateless Proxy Re-Encryption Without Pairings, ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS
Uses Software
