By Topic

Results of an elliptic-curve-approach for use in cryptosystems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rauscher, R. ; Dept. of Comput. Sci., Hamburg Univ., Germany ; Bohnsack, F.

This paper presents new research results concerning cryptosystems based upon elliptic curves. The system which has been developed is similar to that of T. ElGamal (1985) over a finite field Fq. The investigations cover those elliptic curves with primary characteristics over Fq (216⩽q⩽2257 , q is a prime number). The aim of the study is the determination of dependencies between calculation time required by the cryptosystem and size of the keys and length of messages. Additionally, possible areas vulnerable to attacks are identified

Published in:

EUROMICRO Conference, 1999. Proceedings. 25th  (Volume:2 )

Date of Conference: