The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Generic Algorithm for Preparing Unbreakable Cipher: A Short Study
|
|
Author(s): R. A. Balachandar (Anna University, India), M. Balakumar (Anna University, India)and S. Anil Kumar (Anna University, India)
Copyright: 2007
Pages: 9
Source title:
Web Services Security and E-Business
Source Author(s)/Editor(s): G. Radhamani (Multimedia University, Malaysia)and G. S.V. Radha Krishna Rao (Multimedia University, Malaysia)
DOI: 10.4018/978-1-59904-168-1.ch015
Purchase
|
Abstract
This chapter addresses the need of cryptographic algorithm to prepare unbreakable cipher. Though the performance of symmetric key algorithms is far better than asymmetric key algorithms, it still suffers with key distribution problems. It is highly evident that there is always a demand for an algorithm to transfer the secret key in a secure manner between the participants. This chapter argues that by providing the randomness to the secret key, it would be increasingly difficult to hack the secret key. This chapter proposes an algorithm effectively utilizes the random nature of stock prices inconjunction with plain text to generate random cipher. This algorithm can be used to exchange the secret key in a secure manner between the participants.
Related Content
|
Rismawati Rismawati, Salju Salju.
© 2026.
30 pages.
|
|
D. Velumoni, M. Soundarya, Devapitchai Joel Jebadurai, D. Yamuna, M. Jayaseely, D. Gopika.
© 2026.
32 pages.
|
|
Koppala Venugopal, Santosh Neelam Ranganath, Mulugeta Negash Wodage, Nadiminti Madhu, Deekonda Pranaya.
© 2026.
36 pages.
|
|
Sonia Munjal, Deepa Verma, Pawan Kumar.
© 2026.
20 pages.
|
|
Zbigniew Grzymała, Agnieszka Jadwiga Wójcik-Czerniawska.
© 2026.
20 pages.
|
|
Shabina Shaikh, Asadullah Shah.
© 2026.
26 pages.
|
|
Wissal Errayem.
© 2026.
30 pages.
|
|
|