Design of RSRM protocol and analysis of the computational complexity of RLR algorithm for communication over the internet

Authors:
Reena Bhaindarkar;Sandhya Suman;Reema Raghava;T. J. Mathew
Affiliations:
P.G. Dept of Computer Science, S.N.D.T. Women's University, Mumbai, India;P.G. Dept of Computer Science, S.N.D.T. Women's University, Mumbai, India;P.G. Dept of Computer Science, S.N.D.T. Women's University, Mumbai, India;Jankidevi Bajaj Institute of Management Studies, S.N.D.T. Women's University, Mumbai, India
Venue:
ICCC '02 Proceedings of the 15th international conference on Computer communication
Year:
2002

Citing 4
Cited 0

Differential cryptanalysis of the data encryption standard

Differential cryptanalysis of the data encryption standard
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM - Special 25th Anniversary Issue
Cryptography and data security

Cryptography and data security
Handbook of Applied Cryptography

Handbook of Applied Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

RLR [8] (the first letter in the name of each of its designers, - Reena, Ligy and Rashi) is a secret key cryptographic algorithm that applies the well-known principles of design of symmetric key cryptographic algorithms. Although the authors discuss about the testing of the algorithm, results related to the computational complexity or protocols for implementing the algorithm in practice, are not reported. This paper deals with the design of a protocol (RSRM) and analysis of the computational complexity of RLR algorithm and discusses various attacks against which the algorithm is tested.