CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

144-Bit Encryption/Decryption Technique

by Puvvula Bhargava, Kuppam Hari Kishan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 21
Year of Publication: 2010
Authors: Puvvula Bhargava, Kuppam Hari Kishan
10.5120/53-647

Puvvula Bhargava, Kuppam Hari Kishan . 144-Bit Encryption/Decryption Technique. International Journal of Computer Applications. 1, 21 ( February 2010), 63-70. DOI=10.5120/53-647

@article{ 10.5120/53-647,
author = { Puvvula Bhargava, Kuppam Hari Kishan },
title = { 144-Bit Encryption/Decryption Technique },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 21 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 63-70 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number21/53-647/ },
doi = { 10.5120/53-647 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:47:35.552684+05:30
%A Puvvula Bhargava
%A Kuppam Hari Kishan
%T 144-Bit Encryption/Decryption Technique
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 21
%P 63-70
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, we introduce a new 144-bit cryptographic algorithm .This is done using a 16-segment electronic display and arranging the bits in a rectangular matrix and then converting it into nearest square matrix with the addition of dummy bits and rearranging the individual bits by a newly proposed mathematical approach.

References
  1. Ronald L. Rivest: The MD4 Message Digest Algorithm. Internet : RFC 1320 April 1992.
  2. Ronald L. Rivest: The MD5 Message Digest Algorithm. Internet : RFC 1321 April 1992.
  3. Xiaoyun Wang, Yiqun Lisa Yin and Hongbo Yu, Finding Collisions in the Full SHA-1, Crypto 2005
  4. S. L. M. Barreto, V. Rijmen, "The WHIRLPOOL Hashing Function," First open NESSIE Workshop, Leuven, 13-14 November 2000.
  5. Florent Chabaud, Antoine Joux: Differential Collisions in SHA-0. CRYPTO 1998. pp56–71
  6. Petitcolas, F. A. P., Anderson, R. J., Kuhn, M. G.: Information Hiding: A Survey. Proc. of the IEEE, Vol. 87, No.7, pp.1062-1078 (1999).
  7. Bruce Schneier. Applied Cryptography. John Wiley & Sons, 1996.
  8. Data Security -By Johnson and Peter (Tata Mc -Hill)
  9. Secure communication -By Marquis (Tata Mc -Hill)
Index Terms

Computer Science
Information Sciences

Keywords

Assignment mode pattern mode base code element code

Powered by PhDFocusTM