By Topic

Evolutionary computing based secure key management protocol

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

3 Author(s)
Ayachit, N.H. ; BVB Coll. Eng. & Technol., Hubli, India ; Deshpande, S.L. ; Prasad, V.K.

The Many cryptographic protocols require random or pseudorandom inputs at various points, e.g., for auxiliary quantities used in generating digital signatures, or for generating challenges in authentication protocols. Security of an algorithm rests in keys. If cryptographically weak process is used to generate keys then the whole system will be weak. Only the key should be secret. Cryptographic mechanisms depend on the confidentiality of keys as algorithms are in the public domain. To engage in secure communications there is a need to securely distribute a secret key or public key. Keys should be dynamic Hence a cryptographically strong key must be generated, and thus the key management becomes the major issue in cryptography. In this paper the ant colony based NP problem solving technique is used along with some random functions to ensure that a strong and efficient key management is achieved for symmetric key cryptography that can be employed in the symmetric key algorithms.

Published in:

Computing Communication and Networking Technologies (ICCCNT), 2010 International Conference on

Date of Conference:

29-31 July 2010