Publication:4502798
From MaRDI portal
zbMath0993.11064MaRDI QIDQ4502798
Publication date: 26 September 2002
algorithm; finite fields; point multiplication; elliptic scalar multiplications; non-supersingular elliptic curves
94A60: Cryptography
11G05: Elliptic curves over global fields
11Y16: Number-theoretic algorithms; complexity
Related Items
Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves, Key Bit-Dependent Attack on Protected PKC Using a Single Trace, Protecting the most significant bits in scalar multiplication algorithms, Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography, Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis, Traces of the group law on the Kummer surface of a curve of genus 2 in characteristic 2, Fault-based attack on Montgomery's ladder algorithm, High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\), Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers, Speeding up regular elliptic curve scalar multiplication without precomputation, Differential addition on binary elliptic curves, Localized Electromagnetic Analysis of Cryptographic Implementations, Binary Huff Curves, Methods for Increasing the Resistance of Cryptographic Designs Against Horizontal DPA Attacks, An efficient method against side-channel attacks on ECC, Fast Point Multiplication on Elliptic Curves without Precomputation, Montgomery Ladder for All Genus 2 Curves in Characteristic 2
