Contact
How to shop
Delivery
Shopping guide
A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem
English
94 b
Delivery to Austria
Up to 30 days for returns
Customers also purchased
/
Paperback
32.19
€
/
Paperback
10.69
€
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.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Hardback
12.09
€
/
Paperback
17.09
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?