By Topic

Efficient implementation of elliptic curve Diffie-Hellman (ECDH) key distribution algorithm in pool-based cryptographic systems (PBCSs)

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)
Toyran, M. ; TUBITAK, UEKAE, Kocaeli, Turkey ; Berber, S.

In Reference, the subject of efficient use of random numbers was studied. We gave examples for inefficient and efficient use of random numbers for the case which a random number r is generated according to the rule r <; n, where r and n are k-bit integers and n is a fixed integer. In this work, we will show how to apply the 2 methods presented in while implementing elliptic curve Diffie-Hellman (ECDH) algorithm in pool-based cryptographic systems (PBCSs). In this work, we also present a 3. method to use random numbers more efficiently and compare all the 3 methods. To our knowledge, this is the first work on using pool-based random numbers in the implementations of ECDH algorithm.

Published in:

Signal Processing and Communications Applications Conference (SIU), 2010 IEEE 18th

Date of Conference:

22-24 April 2010