A subrayan s revathi (6 risultati)

Autore
Perfeziona con la Ricerca avanzata

Perfeziona la tua ricerca

  • Libri (6)

  • Nuovo (6)

a

Fascia di prezzo personalizzata (EUR)

a

    • Lingua: Inglese

      Editore: LAP LAMBERT Academic Publishing, 2017

      6202016647 / 9786202016643

      • Brossura

      Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 64,21

      EUR 11,66 spedizione 
      Spedito da Regno Unito a U.S.A.

      Quantità: 1 disponibili

      Paperback. Condizione: Brand New. 72 pages. 8.66x5.91x0.17 inches. In Stock.

    • Lingua: Inglese

      Editore: LAP LAMBERT Academic Publishing, 2017

      6202016647 / 9786202016643

      • Brossura

      Da: preigu, Osnabrück, Germaniapreigu

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 33,30

      EUR 70,00 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: 5 disponibili

      Taschenbuch. Condizione: 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.

    • Lingua: Inglese

      Editore: LAP LAMBERT Academic Publishing Okt 2017, 2017

      6202016647 / 9786202016643

      • Brossura
      • Print on Demand

      Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 35,90

      EUR 23,00 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: 2 disponibili

      Taschenbuch. Condizione: 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.

    • Lingua: Inglese

      Editore: LAP LAMBERT Academic Publishing, 2017

      6202016647 / 9786202016643

      • Brossura
      • Print on Demand

      Da: moluna, Greven, Germaniamoluna

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 31,27

      EUR 48,99 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: Più di 20 disponibili

      Condizione: 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.

    • Lingua: Inglese

      Editore: LAP LAMBERT Academic Publishing, 2017

      6202016647 / 9786202016643

      • Brossura
      • Print on Demand

      Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 53,13

      EUR 30,50 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: 1 disponibili

      Taschenbuch. Condizione: 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.

    • Lingua: Inglese

      Editore: LAP LAMBERT Academic Publishing Okt 2017, 2017

      6202016647 / 9786202016643

      • Brossura
      • Print on Demand

      Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 35,90

      EUR 60,00 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: 1 disponibili

      Taschenbuch. Condizione: 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.