{"product_id":"a-revathi-s-subrayan-a-scalar-multiplication-algorithm-for-elliptic-curve-cryptosystem-9786202016643","title":"A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem","description":"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.","brand":"LAP LAMBERT Academic Publishing","offers":[{"title":"Default Title","offer_id":54744406655318,"sku":null,"price":0.0,"currency_code":"EUR","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0925\/5829\/5382\/files\/product_image_9786202016643_1.jpg?v=1790951938","url":"https:\/\/www.momoxbooks.com\/products\/a-revathi-s-subrayan-a-scalar-multiplication-algorithm-for-elliptic-curve-cryptosystem-9786202016643","provider":"momox","version":"1.0","type":"link"}