Guide to elliptic curve cryptography.
The growing field of elliptic curve cryptography (ECC) has seen the publishing in the last years of several books with the common feature of gathering together mathematical materials related to the arithmetic and geometry of elliptic curves, in particular those defined over a finite ground field, together with its applications to public key cryptography. The weight of each one of these two ingredients varies in function of the objectives of each book and its foreseen reader's typology. The present book does not seek to put the emphasis in the mathematical aspects of the theory of elliptic curves. In the authors' words: ``the presentation is targeted to a diverse audience, and generally assumes no more than an undergraduate degree in computer science, engineering or mathematics. Accordingly topics such as the point counting algorithms: SEA (Schoof, Elkies and Atkins), Satoh, etc. are only mentioned (in the Preface the authors say that ``presenting these topics in a readable and concise form is a formidable challenge postponed for another day). Neither does the book approach the analysis of the specific attacks to the elliptic curve discrete logarithm problem such as the MOV (Menezes, Okamoto and Vanstone) attack, the Frey and Ruck attack or the Weil descent attack. The interested reader can find such materials in other books with a similar title, for example ``Elliptic Curves in Cryptography by \textit{I. F. Blake, G. Seroussi} and \textit{N. P. Smart} [Vol I (London Mathematical Society Lecture Note Series 265, Cambridge U. Press) (1999; Zbl 0937.94008); and Vol II (Cambridge U. Press) (2005)]. Instead the present book puts the emphasis in the practical side of the field to be a summary of the implementations on security aspects for ECC. Particular attention is paid to the existent industry and government ECC standards (ANSI, IEEE, and ISO/IEC) and to the algorithmic aspects of the treated topics (throughout the text, there are more than a hundred algorithms). After an introductory chapter the book focuses on the study of efficient methods to perform the arithmetic in a finite field \(\mathbb{F}_q\) (Chapter 2) and the arithmetic on an elliptic curve defined over \(\mathbb{F}_q\) (Chapter 3). Chapter 4 studies some selected protocols for digital signature, public key encryption and key establishment. Finally Chapter 5 deals with some issues in software and hardware implementation as well as a paragraph that studies the side channel attacks and their countermeasures. A paragraph of Notes at the end of each chapter provide to the reader complementary information and pertinent references (the Bibliography of the book has 489 items).
- Extractors for binary elliptic curves
- Constructive and destructive use of compilers in elliptic curve cryptography
- Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves
- Pairing-based cryptography on elliptic curves
- LWDSA: light-weight digital signature algorithm for wireless sensor networks
- Provably secure and pairing-based strong designated verifier signature scheme with message recovery
- High-performance generic-point parallel scalar multiplication
- Pseudorandom bit sequence generator for stream cipher based on elliptic curves
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
- Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves
- Authenticated communication from quantum readout of pufs
- Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\)
- Injective encodings to binary ordinary elliptic curves
- Secure simultaneous bit extraction from Koblitz curves
- Cryptanalysis of a communication-efficient three-party password authenticated key exchange protocol
- Speeding up Huff form of elliptic curves
- Quantum algorithm to find invariant linear structure of MD hash functions
- Complexity bounds on Semaev's naive index calculus method for ECDLP
- Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited
- Efficient arithmetic in (pseudo-)Mersenne prime order fields
- Efficient FPGA design of exception-free generic elliptic curve cryptosystems
- The rank-based cryptography library
- An application of crypto cloud computing in social networks by cooperative game theory
- Speeding up regular elliptic curve scalar multiplication without precomputation
- Koblitz curves over quadratic fields
- Fast elliptic curve point multiplication based on window non-adjacent form method
- Analysis and enhancement of a password authentication and update scheme based on elliptic curve cryptography
- Design of improved password authentication and update scheme based on elliptic curve cryptography
- Computing the modular inverses is as simple as computing the GCDs
- On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- Cold boot attacks in the discrete logarithm setting
- Leakage-resilient cryptography over large finite fields: theory and practice
- Ultra high-performance ASIC implementation of SM2 with SPA resistance
- Elliptic curves and their applications to cryptography. An introduction
- DCapBAC: embedding authorization logic into smart things through ECC optimizations
- ECC on your fingertips: a single instruction approach for lightweight ECC design in \(\mathrm{GF}(p)\)
- Energy-efficient elliptic curve cryptography for MSP430-based wireless sensor nodes
- Provably secure and pairing-free certificateless digital signature scheme using elliptic curve cryptography
- New DES based on elliptic curves
- Implementing elliptic curve cryptography
- Memory-constrained implementations of elliptic curve cryptography in co-Z coordinate repre\-sentation
- Cryptographic aspects of real hyperelliptic curves
- Secure data aggregation in wireless sensor networks: homomorphism versus watermarking approach
- Algebraic cryptography: new constructions and their security against provable break
- Batch Computations Revisited: Combining Key Computations and Batch Verifications
- A key escrow-free identity-based signature scheme without using secure channel
- Improving smart card security using elliptic curve cryptography over prime field \((F_{p})\)
- Improved precomputation scheme for scalar multiplication on elliptic curves
- Elliptic curves for applications
- Square always exponentiation
- On application of elliptic curves in some electronic voting protocols
- Efficient system parameters for identity-based encryption using supersingular elliptic curves
- A general method to decompose modular multiplicative inverse operators over group of units
- Lattice-based fault attacks against ECMQV
- scientific article; zbMATH DE number 7228861 (Why is no real title available?)
- Fast Hashing to G 2 on Pairing-Friendly Curves
- A model of hierarchical key assignment scheme
- Low-weight primes for lightweight elliptic curve cryptography on 8-bit AVR processors
- Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves
- VSH, an Efficient and Provable Collision-Resistant Hash Function
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition
- On Avoiding ZVP-Attacks Using Isogeny Volcanoes
- Double-Base Number System for Multi-scalar Multiplications
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Jacobi Quartic Curves Revisited
- Fast Elliptic-Curve Cryptography on the Cell Broadband Engine
- On Modular Decomposition of Integers
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
- On Software Parallel Implementation of Cryptographic Pairings
- Overview of elliptic curve cryptography
- On the distribution of Atkin and Elkies primes
- Implementing the 4-dimensional GLV method on GLS elliptic curves with j-invariant 0
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication
- Enhanced secure anonymous authentication scheme for roaming service in global mobility networks
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- An ID-based three-party authenticated key exchange protocol using elliptic curve cryptography for mobile-commerce environments
- EPG-representations with Small Grid-Size
- Free storage basis conversion over finite fields
- A novel elliptic curve scalar multiplication algorithm against power analysis
- Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields
- On algorithmic constructions of isogenies of elliptic curves over finite fields and their applications
- Simplified small exponent test for batch verification
- Scalar multiplication in elliptic curve libraries
- The soft graphic integer sub-decomposition method for elliptic scalar multiplication
- Small scalar multiplication on Weierstrass curves using division polynomials
- Elliptic curve with Optimal mixed Montgomery-Edwards model for low-end devices
- Online template attack on ECDSA: extracting keys via the other side
- Pairing-based cryptography
- Computational hardness of IFP and ECDLP
- Impact of randomization in VKO mechanisms on overall security level
- Speeding up the elliptic curve scalar multiplication using non adjacent form
- Unconditionally Anonymous Controllable ID-Based Ring Signatures
- Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation over \(\mathrm{GF}(p)\)
- On Random Number Generation for Kernel Applications
- Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\)
- One-point Goppa codes on some genus 3 curves with applications in quantum error-correcting codes
- Multiple point compression on elliptic curves
This page was built for publication: Guide to elliptic curve cryptography.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4826108)