Mohlo by se vám také líbit

Více informací o knize A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 91 bodů

Anotace knihy

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.

Parametry knihy

• Plný název: A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem
• Autor: S. Revathi A. Subrayan
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 72
• EAN: 9786202016643
• ID: 18375872
• Nakladatelství: LAP Lambert Academic Publishing
• Hmotnost: 126 g
• Rozměry: 220 × 150 × 4 mm
• Rok vydání: 2017

Oblíbené z jiného soudku

---

---

---