Open Access
RSU Algorithm for Secured Communication
Sunil Shirsat,Swapnil Sanap +1 more
- 08 Mar 2012
- Iss: 1, pp 34-37
TL;DR: In this paper, RSU algorithm is proposed which encodes the message by using reversible Boolean functions and combinatory which provides extremely better security for data.
read more
Abstract: The essential aspect of secured communications is secret key cryptography. The key selection mechanism and the encoding methodology determine the efficiency of the cipher text generated. In this paper, RSU algorithm is proposed which encodes the message by using reversible Boolean functions and combinatory. In this method, same keys are used for both encryption and decryption. The plaintext and secret keys are modified before encryption. This increases the complexity of deciphering the cipher text by intruders. Thereby it provides extremely better security for data.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
•Book
Quantum Computation and Quantum Information
Michael A. Nielsen,Isaac L. Chuang +1 more
- 01 Jan 2000
TL;DR: In this article, the quantum Fourier transform and its application in quantum information theory is discussed, and distance measures for quantum information are defined. And quantum error-correction and entropy and information are discussed.
Quantum Computation and Quantum Information
Michael A. Nielsen,Isaac L. Chuang +1 more
- 01 Dec 2010
TL;DR: This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
19.6K
Logical reversibility of computation
TL;DR: This result makes plausible the existence of thermodynamically reversible computers which could perform useful computations at useful speed while dissipating considerably less than kT of energy per logical step.
4K
The thermodynamics of computation—a review
TL;DR: In this paper, the authors consider the problem of rendering a computation logically reversible (e.g., creation and annihilation of a history file) in a Brownian computer, and show that it is not the making of a measurement that prevents the demon from breaking the second law but rather the logically irreversible act of erasing the record of one measurement to make room for the next.
2K
•Book
Cryptography and Network Security
Debdeep Mukhopadhyay,Behrouz A. Forouzan,Forouzan +2 more
- 01 Jan 2015
TL;DR: This book includes the following chapters: Introduction to Modern Symmetric-Key Ciphers, Mathematics of Cryptography, and Message Integrity and Message Authentication, and Security at the Network Layer: IPSec.
1.1K