A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem - Couverture souple

A. Subrayan, S. Revathi

Couverture souple

ISBN 10 : 6202016647 ISBN 13 : 9786202016643

Editeur : LAP LAMBERT Academic Publishing, 2017

Synopsis

Since the introduction of public-key cryptography by Diffe and Hellman in 1976, the potential for the use of the discrete logarithm problem in public-key cryptosystems has been recognized. Although the discrete logarithm problem as first employed by Diffe and Hellman was defined explicitly as the problem of finding logarithms with respect to a generator in the multiplicative group of the integers module a prime, this idea can be extended to arbitrary groups and in particular, to elliptic curve groups. The resulting public – key systems provide relatively small block size, high speed, and high security. This book identifies an efficient performance of a scalar multiplication, which is one of the main operation in ECC. Adopting potential concurrent property using complementary recoding for scalar multiplication and having the elements of GF(2^m), particularly in the polynomial basis (PB) to use in an elliptic curve cryptosystems, computation of scalar multiplication is done.

Détails de l'édition

• Éditeur: LAP LAMBERT Academic Publishing
• Date d'édition: 2017
• Langue: anglais
• ISBN 10: 6202016647
• ISBN 13: 9786202016643
• Reliure: Broché
• Nombre de pages: 72
• Coordonnées du fabricant: non disponible
• Personne responsable: KreGa Onlinehandel GmbH; 4950000000000; info@krega-onlinehandel.de; ; Birkenweg 31; Brakel; 33034; Allemagne