Könyv A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem S. Revathi A. Subrayan

A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem

Nyelv: Angol
Kötés: Puha kötésű
Elérhetőség: Beszállítói készleten
Küldés 5-8 napon belül
12 017 Ft
Since the introduction of public-key cryptography by Diffe and Hellman in 1976, the potential for th...

Információk a könyvről

Nyelv
Angol
Kötés
Könyv - Puha kötésű
Kiadva
2017
oldal
72
EAN
9786202016643
Enbook ID
18375872
Súly
126
Méretek
150 x 220 x 4

Teljes leírás

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.

Érdekelheti

Book of Spells

MR Brian Daniel Starr
5 823 Ft

London Visitors' Map

Bensons MapGuides
1 752 Ft

One Day

M G Cheats
2 488 Ft
2 501 Ft

The Creator

Nigel Shindler
9 163 Ft

Law of Manifestation

Dr S. Sagoe-Nkansah
7 678 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták