Guide to Elliptic Curve Cryptography

@inproceedings{Hankerson2004GuideTE,
  title={Guide to Elliptic Curve Cryptography},
  author={Darrel Hankerson and Scott A. Vanstone and Alfred Menezes},
  booktitle={Springer Professional Computing},
  year={2004}
}
After two decades of research and development, elliptic curve cryptography now has widespread exposure and acceptance. Industry, banking, and government standards are in place to facilitate extensive deployment of this efficient public-key mechanism. Anchored by a comprehensive treatment of the practical aspects of elliptic curve cryptography (ECC), this guide explains the basic mathematics, describes state-of-the-art implementation methods, and presents standardized protocols for public-key… 
A survey on elliptic curve cryptography
TLDR
A ground up survey on elliptic curve cryptography is provided, which tailors the mathematics behind elliptic Curve to the applicability within a cryptosystem.
A Survey of Hardware Implementations of Elliptic Curve Cryptographic Systems
TLDR
The paper outlines ECC’s vulnerability against quantum attacks and references one possible solution to that problem, and the suitability of the hardware/software approach in regard to the security challenges opposed by the low-end embedded devices of the Internet of Things is briefly examined.
Review of Hardware Implementations of Elliptic Curve Cryptography System
TLDR
The paper outlines ECC’s vulnerability against quantum attacks and references one possible solution to that problem, and the suitability of the hardware/software approach in regard to the security challenges opposed by the low-end embedded devices of the Internet of Things is briefly examined.
On the Security of Elliptic Curve Cryptosystems against Attacks with Special-Purpose Hardware
TLDR
It is shown that the security of ECC-163 against hardware attacks is several orders of magnitude harder than that of RSA-1024, and is considered ECC over over prime fields to be far more secure than commonly believed.
A Review of Techniques for Implementing Elliptic Curve Point Multiplication on Hardware
TLDR
A systematic review of literature on ECPM implementations on both Field-Programmable Gate Array (FPGA) and Application-Specific Integrated Circuit (ASIC) shows which methods and technologies have been used to implement ECPM on hardware and some findings of the choices available to the hardware designers are presented.
Increasing the Robustness of Point Operations in Co-Z Arithmetic against Side-Channel Attacks
TLDR
Three schemes to counter power analysis cryptographic attacks are described and the users can optimize the trade-off between speed, cost, and security level according to their needs and resources.
An Enhanced Approach of Elliptic Curve Cryptosystem based Unicode Representation
TLDR
This paper aims to propose an enhanced approach of elliptic curve cryptosystem based Unicode representation, which transforms the text message into an affine point called Pm on the elliptic Curve, over the finite field GF(p).
Increasing the Robustness of Point Operations in CoZ Arithmetic against Side-Channel Attacks
  • M. Sima
  • Computer Science, Mathematics
  • 2013
TLDR
Three schemes to counter power analysis cryptographic attacks are described and an atomic block that consists of addition, multiplication and addition [A-M-A] is introduced that provides a very good scalar multiplication protection but with increased computation cost.
VLSI implementation and its optimisation for digital cryptosystems
TLDR
This PhD thesis attempts to optimise the non-linear S-box defined over Galois field of 28, GF(28), and designs a new common subexpression elimination (CSE) algorithm to choose the isomorphic mapping that results in the lowest implementation cost.
Introduction to Public-Key Cryptography
TLDR
The basic mathematics and security evaluations of public-key cryptography are explained and Pairing-based cryptography, first proposed in 2000, can be incorporated in security technologies that are not practical with the previous public- key cryptographies.
...
...

References

SHOWING 1-10 OF 378 REFERENCES
Implementation of Elliptic Curve Cryptography with Built-In Counter Measures against Side Channel Attacks
TLDR
A study of software counter measures against side channel attacks for elliptic curve cryptosystems is presented, and two new counter measures are introduced, namely, homogeneous group operations and a non-deterministic method of point exponentiation with precomputations.
A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems
  • L. Goubin
  • Computer Science, Mathematics
    Public Key Cryptography
  • 2003
TLDR
It is shown that, for many elliptic curves, such a DPA-protection of the "scalar" multiplication is not sufficient and the problem of randomizing the basepoint may be more difficult than expected and that "standard" techniques have still to be improved, which may also have an impact on the performances of the implementations.
Elliptic curves in cryptography
TLDR
This book summarizes knowledge built up within Hewlett-Packard over a number of years, and explains the mathematics behind practical implementations of elliptic curve systems, to help engineers and computer scientists wishing (or needing) to actually implement such systems.
Validation of Elliptic Curve Public Keys
We present practical and realistic attacks on some standardized elliptic curve key establishment and public-key encryption protocols that are effective if the receiver of an elliptic curve point does
A New Elliptic Curve Scalar Multiplication Algorithm to Resist Simple Power Analysis
TLDR
This paper presents a new defence against Simple Power Analysis (SPA), based on the NAF (non-adjacent form) representation of a scalar and requires 44% fewer additions and 11% extra doublings than the commonly recommended defence of performing a point addition in every loop of the binary scalar multiplication algorithm.
An End-to-End Systems Approach to Elliptic Curve Cryptography
TLDR
A programmable hardware accelerator to speed up point multiplication for elliptic curves over binary polynomial fields GF(2m) and delivers optimized performance for a set of commonly used curves through hard-wired reduction logic.
Generic GF(2) Arithmetic in Software and Its Application to ECC
TLDR
This work presents algorithms that are especially suited to high-performance devices like large-scaled server computers and shows how to perform an efficient field multiplication for operands of arbitrary size, and how to achieve efficient field reduction for dense polynomials.
A Practical Implementation of Elliptic Curve Cryptosystems over GF(p) on a 16-bit Microcomputer
TLDR
A practical software implementation of a cryptographic library which supports 160-bit elliptic curve DSA (ECDSA) signature generation, verification and SHA-1 on the processor and this library also includes general integer arithmetic routines for applicability to other cryptographic algorithms.
Exponentiation Cryptosystems on the IBM PC
  • P. Comba
  • Computer Science
    IBM Syst. J.
  • 1990
TLDR
A mixed system that combines the superior key management capabilities inherent in public key cryptosystems with the much higher bulk-encryption speed obtainable with the Data Encryption Algorithm is discussed.
Weierstraß Elliptic Curves and Side-Channel Attacks
TLDR
This paper shows how to rewrite the addition on the general Weierstras form of elliptic curves so that the same formulae apply equally to add two different points or to double a point.
...
...