Optimieren Sie Ihre Suche

  • Bücher (6)

  • Neu (6)

bis

Benutzerdefinierte Preisspanne (EUR)

bis

S revathi a subrayan (6 Ergebnisse)

Autor: 
Mit der Detailsuche verfeinern
  • Sprache: Englisch

    Verlag: LAP LAMBERT Academic Publishing, 2017

    6202016647 / 9786202016643

    • Softcover

    Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 65,78

    EUR 11,95 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: 1 verfügbar

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

  • Sprache: Englisch

    Verlag: LAP LAMBERT Academic Publishing, 2017

    6202016647 / 9786202016643

    • Softcover

    Anbieter: preigu, Osnabrück, Deutschlandpreigu

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 33,30

    EUR 70,00 Versand 
    Versand von Deutschland nach USA

    Anzahl: 5 verfügbar

    Taschenbuch. Zustand: 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. …

  • Sprache: Englisch

    Verlag: LAP LAMBERT Academic Publishing Okt 2017, 2017

    6202016647 / 9786202016643

    • Softcover
    • Print-on-Demand

    Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, DeutschlandBuchWeltWeit Ludwig Meier e.K.

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 35,90

    EUR 23,00 Versand 
    Versand von Deutschland nach USA

    Anzahl: 2 verfügbar

    Taschenbuch. Zustand: 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.…

  • Sprache: Englisch

    Verlag: LAP LAMBERT Academic Publishing, 2017

    6202016647 / 9786202016643

    • Softcover
    • Print-on-Demand

    Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 41,69

    EUR 35,00 Versand 
    Versand von Deutschland nach USA

    Anzahl: 1 verfügbar

    Taschenbuch. Zustand: 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.…

  • Sprache: Englisch

    Verlag: LAP LAMBERT Academic Publishing, 2017

    6202016647 / 9786202016643

    • Softcover
    • Print-on-Demand

    Anbieter: moluna, Greven, Deutschlandmoluna

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 31,27

    EUR 48,99 Versand 
    Versand von Deutschland nach USA

    Anzahl: Mehr als 20 verfügbar

    Zustand: 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.…

  • Sprache: Englisch

    Verlag: LAP LAMBERT Academic Publishing Okt 2017, 2017

    6202016647 / 9786202016643

    • Softcover
    • Print-on-Demand

    Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschlandbuchversandmimpf2000

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 35,90

    EUR 60,00 Versand 
    Versand von Deutschland nach USA

    Anzahl: 1 verfügbar

    Taschenbuch. Zustand: 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.…