<--- Back to Details
First PageDocument Content
Elliptic curve cryptography / Pairing-based cryptography / Public-key cryptography / Group theory / Finite fields / Tate pairing / Hyperelliptic curve / Weil pairing / BonehLynnShacham / BonehFranklin scheme / Pairing / ID-based encryption
Date: 2009-07-13 10:25:27
Elliptic curve cryptography
Pairing-based cryptography
Public-key cryptography
Group theory
Finite fields
Tate pairing
Hyperelliptic curve
Weil pairing
BonehLynnShacham
BonehFranklin scheme
Pairing
ID-based encryption

Bilinear Pairings in Cryptography Master thesis #603 by

Add to Reading List

Source URL: www.math.ru.nl

Download Document from Source Website

File Size: 399,72 KB

Share Document on Facebook

Similar Documents

Edwards Curves and the ECM Factorisation Method Peter Birkner Eindhoven University of Technology  The 12th Workshop on Elliptic Curve Cryptography

Edwards Curves and the ECM Factorisation Method Peter Birkner Eindhoven University of Technology The 12th Workshop on Elliptic Curve Cryptography

DocID: 1vnty - View Document

Analysis of Efficient Techniques for Fast Elliptic Curve Cryptography on x86-64 based Processors Patrick Longa, and Catherine Gebotys Department of Electrical and Computer Engineering, University of Waterloo, Canada, {pl

Analysis of Efficient Techniques for Fast Elliptic Curve Cryptography on x86-64 based Processors Patrick Longa, and Catherine Gebotys Department of Electrical and Computer Engineering, University of Waterloo, Canada, {pl

DocID: 1vaTL - View Document

Elliptic Curves over Q Peter Birkner Technische Universiteit Eindhoven DIAMANT Summer School on Elliptic and Hyperelliptic Curve Cryptography

Elliptic Curves over Q Peter Birkner Technische Universiteit Eindhoven DIAMANT Summer School on Elliptic and Hyperelliptic Curve Cryptography

DocID: 1v7hw - View Document

Crafting Certified Elliptic Curve Cryptography Implementations in Coq Andres Erbsen Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree o

Crafting Certified Elliptic Curve Cryptography Implementations in Coq Andres Erbsen Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree o

DocID: 1uYe1 - View Document

Elliptic curve cryptography on FPGAs: How fast can we go with a single chip? Kimmo Järvinen Department of Information and Computer Science Aalto University, Finland

Elliptic curve cryptography on FPGAs: How fast can we go with a single chip? Kimmo Järvinen Department of Information and Computer Science Aalto University, Finland

DocID: 1uOhT - View Document