Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
Survey
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 2369/2002
Book
Algorithmic Number Theory
DOI
10.1007/3-540-45455-1
Copyright
2002
ISBN
978-3-540-43863-2
DOI
10.1007/3-540-45455-1_3
Pages
11-18
Subject Collection
Computer Science
SpringerLink Date
Tuesday, January 01, 2002
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (196.4 KB)
Free Preview
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
Survey
Antoine Joux
5
(5)
DCSSI Crypto Lab, 51, Bd de Latour Maubourg, F-75700 Paris 07 SP, France
Abstract
Elliptic curves were first proposed as a tool for cryptography by V. Miller in 1985 [
29
]. Indeed, since elliptic curves have a group structure, they nicely fit as a replacement for more traditional groups in discrete logarithm based systems such as Diffie-Hellman or ElGamal. Moreover, since there is no non-generic algorithm for computing discrete logarithms on elliptic curves, it is possible to reach a high security level while using relatively short keys.
Antoine
Joux
Email:
Antoine.Joux@m4x.org
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Referenced by
3 newer articles
Galbraith, Steven D. (2007) Simplified pairing computation and security implications.
Journal of Mathematical Cryptology
1(3)
[CrossRef]
Dehkordi, Massoud Hadian (2009) Zero-knowledge identification scheme based on Weil pairing.
Lobachevskii Journal of Mathematics
30(3)
[CrossRef]
Cheon, Jung-Hee (2009) A NOTE ON SELF-BILINEAR MAPS.
Bulletin of the Korean Mathematical Society
46(2)
[CrossRef]
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.105 • Server: mpweb01
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)