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.
"synopsis" may belong to another edition of this title.
About the Author
S. REVATHI. Department of Mathematics,University of Thiruvalluar, Theivanai Ammal College for Women,Villupuram-605 602.
"About this title" may belong to another edition of this title.
Search results for A Scalar Multiplication Algorithm for Elliptic Curve...
Seller Image
A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem
Published by
LAP LAMBERT Academic Publishing Okt 2017, 2017
ISBN 10: 6202016647
ISBN 13: 9786202016643
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 72 pp. Englisch. Seller Inventory # 9786202016643
Stock Image
A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem
Published by
LAP LAMBERT Academic Publishing, 2017
ISBN 10: 6202016647
ISBN 13: 9786202016643
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 72 pages. 8.66x5.91x0.17 inches. In Stock. Seller Inventory # zk6202016647
Buy New
£ 53.46
£ 10 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem
Published by
LAP LAMBERT Academic Publishing, 2017
ISBN 10: 6202016647
ISBN 13: 9786202016643
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: A. Subrayan S. RevathiS. REVATHI. Department of Mathematics,University of Thiruvalluar, Theivanai Ammal College for Women,Villupuram-605 602.Since the introduction of public-key cryptography by Diffe and Hellman in 1976, the pote. Seller Inventory # 385901600
Buy New
£ 27.79
£ 42.27 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem
Published by
LAP LAMBERT Academic Publishing Okt 2017, 2017
ISBN 10: 6202016647
ISBN 13: 9786202016643
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 72 pp. Englisch. Seller Inventory # 9786202016643
Seller Image
A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem
Published by
LAP LAMBERT Academic Publishing, 2017
ISBN 10: 6202016647
ISBN 13: 9786202016643
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9786202016643
Seller Image
A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem
Published by
LAP LAMBERT Academic Publishing, 2017
ISBN 10: 6202016647
ISBN 13: 9786202016643
New
Taschenbuch
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. A Scalar Multiplication Algorithm for Elliptic Curve Cryptosystem | S. Revathi A. Subrayan | Taschenbuch | 72 S. | Englisch | 2017 | LAP LAMBERT Academic Publishing | EAN 9786202016643 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Seller Inventory # 110181104