Abstract
In some applications of public-key cryptography it is desirable, and perhaps even necessary, that the key size be as small as possible. Moreover, the cryptosystem just needs to be secure enough so that breaking it is not cost-effective. The purpose of this paper is to investigate the security and practicality of elliptic curve cryptosystems with small key sizes of about 100 bits.
Cite
CITATION STYLE
Harper, G., Menezes, A., & Vanstone, S. (1993). Public-key cryptosystems with very small key lengths. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 658 LNCS, pp. 163–173). Springer Verlag. https://doi.org/10.1007/3-540-47555-9_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
