Username:

Password:

Register
(Forums, Upload)


Elliptic Curve Cryptography

27-09-06 17:41
Age: 5 yrs

BY: GHOSAL, RAJA ; COLE, PETER


Public key cryptography systems are based on sound mathematical foundations that are designed to make the problem hard for an intruder to break into the system. The major approaches that since 1976 have withstood intruder attacks, are the discrete logarithm problem (as in D-H), and the integer factorisation problem as in RSA. The growing area of lightweight devices, such as mobile cell phones, PDA’s, palmtops, where memory, processing power, bandwidths are limited, are constrained in using public key cryptography systems, which are based on large key sizes. The larger key requires higher computation power. Elliptic Curve Cryptography (ECC) is a newer approach, with a novelty of low key size for the user, and hard exponential time challenge for an intruder to break into the system. In ECC a 160 bits key, provides the same security as RSA 1024 bits key, thus lower computer power is required. The advantage of elliptic curve cryptosystems is the absence of subexponential time algorithms, for attack.






Files:
AUTOIDLABS-WP-HARDWARE-026.pdf


<- Back to: Publications


Comments

Post a comment — please log in
Call for Papers - IoT2012

The 3rd International Conference on the Internet of Things (IoT2012) will include a highly selective dual-track program for technical papers, accompanied by reports on business projects from seasoned ...

[more]
CALL FOR PAPERS - PerHot 2012

Mark Weiser first proposed Pervasive Computing two decades ago and we've explored the space of his ideas in that time. It's time to explore new wild and crazy -- "hot" -- ideas! The goal of PerHot is ...

[more]
Auto-ID Labs Research Update at GS1 Event

As part of their research for GS1, members of the Auto-ID Labs research network have presented a recent update at GS1's Industry and Standards Event in Brooklyn, March 2011.

[more]
RSS For a List of RSS 2.0 Feeds: Please Click Here