scientific article; zbMATH DE number 1349933
This book is a very well written description of the use of elliptic curves in public key cryptography. It could be read by students/researchers in cryptography, mathematics or by engineers. The book contains ten chapters and an appendix. The security of public key schemes is based on the difficulty of solving mathematical problems. Whereas the integer factorization problem (IFP) gave birth in the 70s to RSA, the discrete logarithm problem produced cryptography based on finite groups. The first chapter of the book under review introduces these concepts, especially: the Diffie-Hellman key exchange, the ElGamal encryption, the ElGamal digital signature scheme, the digital signature algorithm, and the Nyberg-Rueppel digital signature scheme. The advantage of formulating the discrete logarithm problem for elliptic curves defined over finite fields (ECDLP) is provided by the fact that, to date, no algorithm is known which breaks the ECDLP in sub-exponential time, whereas there exist algorithms which can factorize integers in sub-exponential time. As a consequence, to date, elliptic curves defined over finite fields provide with small parameters the same amount of security as e.g. RSA with bigger parameters. Hence elliptic curves are particularly useful in the context of chip cards. Chapter two is devoted to the implementation of the underlying field arithmetic, both in the case of odd and even characteristic. In the case of odd characteristic, the underlying field is simply \({\mathbb F}_p\), where \(p\) denotes a large prime (of length at least \(163\) bits say). Chapter three is a very nice abstract of the theory of the arithmetic on elliptic curves, with special insight devoted to curves defined over finite fields, and the Weil pairing. Isogenies and modular polynomials are introduced as well. Chapter four is more practical: it describes point addition, multiplication, compression and the Frobenius expansion. Chapter five describes the state of the art regarding known attacks on ECDLP. As a consequence, the reader knows which situations to avoid in order to have a (hopefully) secure scheme based on elliptic curves. An important step for elliptic curve cryptography is to determine the group order. Chapter six describes the main approaches. The most used method for random curves is provided by Schoof's algorithm, later refined by Atkin, Elkies, then by Couveignes, Morain, Müller, etc. as described in chapter seven. The problem of computing the order of the group defined by an elliptic curve defined over a finite fields requires, as seen above, lots of stuff and computation time. A more practical way would be to reverse the problem: given a number \(n\), is it possible to construct an elliptic curve defined over a finite field whose group order equals \(n\), and which is useful in cryptography? The answer is (sometimes) yes, and provided by elliptic curves with complex multiplication, as described in chapter eight. Elliptic curves may have other practical applications: finding small factors (say up to \(40\) bits) of integers, or proving that a given number is prime (ECPP). These applications are outlined in chapter nine. The last chapter considers the generalization of systems based on elliptic curves to hyperelliptic curves. An appendix contains explicit examples, and is very well detailed. Apart from a preface, a guide for abbreviations and notations, and the content described above, the book contains of course a bibliography, but also an author and a very useful subject index. Many of the techniques described in this book are currently discussed in order to be standardized (IEEE-P1363 and ANSI X9.42, X9.62, X9.63 of the American Bankers Association). This shows how close to practical applications this book is.
- Computing pairings using x-coordinates only
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Constructive and destructive use of compilers in elliptic curve cryptography
- Cryptographic hash functions from expander graphs
- A note on window \(\tau\)-NAF algorithm
- Self-certified multi-proxy signature schemes with message recovery
- On the relationship between squared pairings and plain pairings
- Constructive and destructive facets of Weil descent on elliptic curves
- A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two
- Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves
- Pairing-based cryptography on elliptic curves
- On the 2-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\)
- High-performance generic-point parallel scalar multiplication
- A note on the kernel of group homomorphism of the Weil descent method
- Self-certified threshold proxy signature schemes with message recovery, nonrepudiation, and traceability
- Efficient algorithms for Koblitz curves over fields of characteristic three
- On the complexity of the discrete logarithm and Diffie-Hellman problems
- Computing zeta functions of Artin-Schreier curves over finite fields. II
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
- Irreducible compositions of polynomials over finite fields of even characteristic
- Formalization of definitions and theorems related to an elliptic curve over a finite prime field by using Mizar
- The state of elliptic curve cryptography
- Solving some affine equations over finite fields
- Protecting ECC against fault attacks: the ring extension method revisited
- Complexity bounds on Semaev's naive index calculus method for ECDLP
- Algebraic approaches for solving isogeny problems of prime power degrees
- A blind signature scheme based on bilinear pairings
- Efficient FPGA design of exception-free generic elliptic curve cryptosystems
- Comments on efficient batch verification test for digital signatures based on elliptic curves
- Inferring sequences produced by elliptic curve generators using Coppersmith's methods
- Solving \(x+x^{2^l}+\ldots +x^{2^{ml}}=a\) over \(\mathbb{F}_{2^n} \)
- Operations of points on elliptic curve in affine coordinates
- Novel hybrid-size digit-serial systolic multiplier over \(\mathrm{GF}(2^m)\)
- On the arithmetic operations over finite fields of characteristic three with low complexity
- Polynomial interpolation of the Naor-Reingold pseudo-random function
- Further refinement of pairing computation based on Miller's algorithm
- Analysis and design of a secure key exchange scheme
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Cryptography on elliptic curves over \(p\) -adic number fields
- Singular points of cyclic weighted shift matrices
- Counting points on hyperelliptic curves in average polynomial time
- Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings
- All-in-one group-oriented cryptosystem based on bilinear pairing
- Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography
- Computing the height of volcanoes of -isogenies of elliptic curves over finite fields
- A nonlinear elliptic curve cryptosystem based on matrices
- How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
- On the bit security of the Diffie-Hellman key
- The GN-authenticated key agreement
- Efficient algorithms for speeding up the computations of elliptic curve cryptosystems
- Efficient proxy signature schemes using self-certified public keys
- Self-inversive Hilbert space operator polynomials with spectrum on the unit circle
- Attacking the linear congruential generator on elliptic curves via lattice techniques
- On oracle factoring of integers
- Elliptic curves in cryptography
- Elliptic curves and their applications to cryptography. An introduction
- Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods
- An efficient deterministic test for Kloosterman sum zeros
- Design, analysis and performance evaluation of group key establishment in wireless sensor networks
- New lattice attacks on DSA schemes
- Subgroup security in pairing-based cryptography
- Application of differential cryptography to a GN authentication hierarchy scheme
- Implementing elliptic curve cryptography
- On the Security of Supersingular Isogeny Cryptosystems
- Computing the \ell -power torsion of an elliptic curve over a finite field
- Algebraic cryptography: new constructions and their security against provable break
- Computing Hilbert class polynomials with the Chinese remainder theorem
- Binary Kloosterman sums with value 4
- Elliptic curves for applications
- Efficient system parameters for identity-based encryption using supersingular elliptic curves
- scientific article; zbMATH DE number 438988 (Why is no real title available?)
- A public key cryptoscheme using bit-pairs with provable semantical security
- scientific article; zbMATH DE number 7232772 (Why is no real title available?)
- Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых
- Construction of strong elliptic curves suitable for cryptographic applications
- Efficient scalar multiplication for elliptic curves over binary fields
- Elliptic curves. An elementary exposition for cryptography.
- An efficient ECDSA-based signature scheme for wireless networks
- A semantically secure public key cryptoscheme using bit-pair shadows
- A provably secure non-iterative hash function resisting birthday attack
- Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three
- A Tree-Based Approach for Computing Double-Base Chains
- Fast algorithms for computing isogenies between elliptic curves
- Choosing the correct elliptic curve in the CM method
- Pairings in Trusted Computing
- Digit Set Randomization in Elliptic Curve Cryptography
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Exponent Recoding and Regular Exponentiation Algorithms
- Lifting and Elliptic Curve Discrete Logarithms
- Modular composition modulo triangular sets and applications
- Complexity of computation in finite fields
- Exponential sums over points of elliptic curves
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
- A public key cryptosystem based on three new provable problems
- Fast arithmetics in Artin-Schreier towers over finite fields
- Some lattice attacks on DSA and ECDSA
- scientific article; zbMATH DE number 1936525 (Why is no real title available?)
- scientific article; zbMATH DE number 2042246 (Why is no real title available?)
- Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4265362)
