• Publications
  • Influence
Handbook of Applied Cryptography
From the Publisher: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of
Guide to Elliptic Curve Cryptography
This guide explains the basic mathematics, describes state-of-the-art implementation methods, and presents standardized protocols for public-key encryption, digital signatures, and key establishment, as well as side-channel attacks and countermeasures.
The Elliptic Curve Digital Signature Algorithm (ECDSA)
The ANSI X9.62 ECDSA is described and related security, implementation, and interoperability issues are discussed, and the strength-per-key-bit is substantially greater in an algorithm that uses elliptic curves.
Reducing elliptic curve logarithms to logarithms in a finite field
The main result of the paper is to demonstrate the reduction of the elliptic curve logarithm problem to the logariths problem in the multiplicative group of an extension of the underlying finite field, thus providing a probabilistic subexponential time algorithm for the former problem.
The State of Elliptic Curve Cryptography
This paper surveys the development of elliptic curve cryptosystems from their inception in 1985 by Koblitz and Miller to present day implementations.
An Efficient Protocol for Authenticated Key Agreement
This paper proposes an efficient two-pass protocol for authenticated key agreement in the asymmetric (public-key) setting. The protocol is based on Diffie-Hellman key agreement and can be modified to
The concept of an optimal normal basrs is introduced in order to reduce the hardware complexity of multlplymg field elements of GF(2”) IS and ConstructIons for these bases m GF( 2’) and extensions of the results to GF(p”).
Low complexity normal bases
Optimal normal bases in GF(pn)
An implementation for a fast public-key cryptosystem
In this paper we examine the development of a high-speed implementation of a system to perform exponentiation in fields of the form GF(2n). For sufficiently large n, this device has applications in