Elliptic curve cryptography on constraint environments

被引：0

作者：

de Santos, MD ^{[1
]}

Sanchez-Avila, C ^{[1
]}

Sanchez-Reillo, R ^{[1
]}

机构：

[1] Univ Politecn Madrid, ETSI Telecommun, Dpto Matemat Aplicada, E-28040 Madrid, Spain

来源：

38TH ANNUAL 2004 INTERNATIONAL CARNAHAN CONFERENCE ON SECURITY TECHNOLOGY, PROCEEDINGS | 2004年

关键词：

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The main target of this work is to expose the capacities that make elliptic curve cryptography the most suitable one to be implemented in environments with several constraints related to processor speed, bandwidth, security and memory. We have analyzed several elliptic curve cryptosystems with other public key ones. We have made a comparison among different public key cryptosystems (such as ElGamal for encryption and Diffie-Hellman for key exchanging) and the corresponding ones based on elliptic curve theory; highlighting algorithm speed characteristics.

引用

页码：212 / 220

页数：9

共 14 条

[1] [Anonymous], FINITE FIELDS COMPUT
[2] Boneh D., 1997, Advances in Cryptology - EUROCRYPT '97. International Conference on the Theory and Application of Cryptographic Techniques Proceedings, P37
[3] *IEEE, 1999, P1363 IEEE
[4] Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
Koc, CK
Sunar, B
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (03) : 353 - 356
[5] Kocher P. C., 1996, Advances in Cryptology - CRYPTO'96. 16th Annual International Cryptology Conference. Proceedings, P104
[6] LPEZ J, 1998, SAC 98, P201
[7] MENEZES A, 2000, 9934 U WAT DEPT C O
[8] Menezes AJ., 1997, HDB APPL CRYPTOGRAPH
[9] MILLER V, 1986, LECT NOTES COMPUTER, P417
[10] MOHAMMED E, 2001, IEEE 7803 01, P213

← 1 2 →