Muutke küpsiste eelistusi
  • Formaat - PDF+DRM
  • Hind: 59,79 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book is devoted to efficient pairing computations and implementations, useful tools for cryptographers working on topics like identity-based cryptography and the simplification of existing protocols like signature schemes.

As well as exploring the basic mathematical background of finite fields and elliptic curves, Guide to Pairing-Based Cryptography offers an overview of the most recent developments in optimizations for pairing implementation. Each chapter includes a presentation of the problem it discusses, the mathematical formulation, a discussion of implementation issues, solutions accompanied by code or pseudocode, several numerical results, and references to further reading and notes.

Intended as a self-contained handbook, this book is an invaluable resource for computer scientists, applied mathematicians and security professionals interested in cryptography.
Foreword vii
Symbol Description ix
1 Pairing-Based Cryptography Sebastien Canard and Jacques Traore
1(1)
2 Mathematical Background Jean-Luc Beuchat, Nadia El Mrabet, Laura Fuentes-Castaneda, and Francisco Rodriguez-Henriquez
2(3)
3 Pairings Sorina Ionica and Damien Robert
3(1)
4 Pairing-Friendly Elliptic Curves Safia Haloui and Edlyn Teske
4(1)
5 Arithmetic of Finite Fields Jean Luc Beuchat, Luis J. Dominguez Perez, Sylvain Duquesne, Nadia El Mrabet, Laura Fuentes-Castaneda, and Francisco Rodriguez-Henriquez
5(1)
6 Scalar Multiplication and Exponentiation in Pairing Groups Joppe Bos, Craig Costello, and Michael Naehrig
6(1)
7 Final Exponentiation Jean-Luc Beuchat, Luis J. Dominguez Perez, Laura Fuentes-Castaneda, and Francisco Rodriguez-Henriquez
7(1)
8 Hashing into Elliptic Curves Eduardo Ochoa-Jimenez, Francisco Rodriguez-Henriquez, and Mehdi Tibouchi
8(1)
9 Discrete Logarithms Aurore Guillevic and Francois Morain
9(1)
10 Choosing Parameters Sylvain Duquesne, Nadia El Mrabet, Safia Haloui, Damien Robert, and Franck Rondepierre
10(1)
11 Software Implementation Diego F. Aranha, Luis J. Dominguez Perez, Amine Mrabet, and Peter Schwabe
11(1)
12 Physical Attacks Nadia El Mrabet, Louis Goubin, Sylvain Guilley, Jacques Fournier, Damien Jauvart, Martin Moreau, Pablo Rauzy, and Franck Rondepierre
12
Bibliography 1
Index 1
Nadia El Mrabet  is an assistant professor at SAS - Ecole des Mines de Saint Etienne, Gardanne, France. She previously taught at the University of Paris 8 Vincennes, Saint-Denis, France. She completed her PhD at Université Montpellier 2, France, in 2009.









Marc Joye received his Ph.D. degree in applied sciences (cryptography) from the Université Catholique de Louvain, Belgium, in 1997. In 1998 and 1999, he was a post-doctoral fellow of the National Science Council, Taiwan. From 1999 to 2006, he was with the Card Security Group, Gemplus (now Gemalto), France. From 2006 to 2016, he was with Technicolor (formerly Thomson R&D), France & USA. Since 2016, he has been with NXP Semiconductors, USA.