9786202016643 - a scalar multiplication algorithm for elliptic curve cryptosystem de a. subrayan, s. revathi (6 resultados)
- Tapa blanda
Librería: Revaluation Books, Exeter, , Reino UnidoRevaluation Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 63,79
Envío por EUR 11,59Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: Brand New. 72 pages. 8.66x5.91x0.17 inches. In Stock.
- Tapa blanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 33,20
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: 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.
- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 35,90
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: 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.
- Tapa blanda
- Impresión bajo demanda
Librería: moluna, Greven, , Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 31,27
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: 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 an…d Hellman in 1976, the pote.
- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 35,90
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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 firs…t 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.
- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 37,20
Envío por EUR 60,63Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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.
