scientific article; zbMATH DE number 1504820
From MaRDI portal
Publication:4502798
zbMath0993.11064MaRDI QIDQ4502798
Publication date: 26 September 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmfinite fieldspoint multiplicationelliptic scalar multiplicationsnon-supersingular elliptic curves
Cryptography (94A60) Elliptic curves over global fields (11G05) Number-theoretic algorithms; complexity (11Y16)
Related Items (17)
Localized Electromagnetic Analysis of Cryptographic Implementations ⋮ An efficient method against side-channel attacks on ECC ⋮ 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 ⋮ Traces of the group law on the Kummer surface of a curve of genus 2 in characteristic 2 ⋮ Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers ⋮ Differential addition on binary elliptic curves ⋮ Fast Point Multiplication on Elliptic Curves without Precomputation ⋮ Montgomery Ladder for All Genus 2 Curves in Characteristic 2 ⋮ Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography ⋮ Speeding up regular elliptic curve scalar multiplication without precomputation ⋮ Fault-based attack on Montgomery's ladder algorithm ⋮ Methods for Increasing the Resistance of Cryptographic Designs Against Horizontal DPA Attacks ⋮ Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis ⋮ Binary Huff Curves ⋮ High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\)
This page was built for publication:
