Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs
Top Cited Papers
Open Access
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Instruction set extension for long integer modulo arithmetic on RISC-based smart cardsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Implementing an efficient elliptic curve cryptosystem over $GF(p)$ on a smart cardANZIAM Journal, 2003
- Elliptic Curve Cryptography on Smart Cards without CoprocessorsPublished by Springer Nature ,2000
- Efficient Elliptic Curve Exponentiation Using Mixed CoordinatesLecture Notes in Computer Science, 1998
- A practical implementation of elliptic curve cryptosystems over GF(p) on a 16-bit microcomputerPublished by Springer Nature ,1998
- Optimal extension fields for fast arithmetic in public-key algorithmsPublished by Springer Nature ,1998
- Speeding up the computations on an elliptic curve using addition-subtraction chainsRAIRO - Theoretical Informatics and Applications, 1990