A new scheme for transmitting encrypted data across networks from sender to receiver through multiple channels. The CRT-RSA algorithm is used for generating cipher text from original message blocks of data. The inverse transformation of the algorithm is applied at the receiver end for decryption of cipher text into original message. The theory implementation of this scheme is described in this paper.
Keywords |
| Cryptography, Secure transmission, CRT, RSA, Multiple Channels, Block cipher |
INTRODUCTION |
| The transfer of confidential or proprietary information requires
secure channel. Many secure transmission methods require a
type of encryption. To open an encrypted file the exchange of
keys is done through other transmission methods. Encryption
is the cryptographic primitive method mostly used in
protecting the secrecy of the data. The Chinese remainder
theorem CRT [1] states that if q0, q1...qk -1 are k pair wise
relatively prime positive integers and a0, a1...ak -1 are positive
integers then there exists exactly one integer a where 0 a < q
for q=k-1 i=0 qi such that a = ai mod qi for 0 i < k. The
integers q0, q1...qk -1 are called the moduli while the integers
a0, a1...ak -1 are called the residues. The CRT has well known
applications in both secret sharing and error correcting codes
[2]. In this work, RSA encryption with Chinese remainder
theorem will be combined to produce a scheme for
transmitting sensitive data over multiple channels.
In digital communications, parallel transmission is the
simultaneous transmission of related signal elements over two
or more separate paths. Multiple cables are used which can
transmit multiple bits simultaneously, which allows for higher
data transfer rates than can be achieved with serial
transmission. RSA (which stands for Rivest, Shamir and
Adleman who first publicly described it) is an algorithm for
asymentric public key cryptography. |
PROPOSED MODEL |
| Using R number of multiple transmission channels between
the sender and the receiver from which S Channels are chosen
using some selection criteria. The original message or plain
text is divided into N bits of cipher blocks. These blocks are
encrypted using an RSA-CRT module. The encrypted data is
transmitted over a set of S-selected channels. The remaining
R-S channels are used to transmit irrelevant data in order to
decrease the ability of the intruders from hacking.
At the receiver side, the inverse of the RSA-CRT is applied to
the original N-bit cipher block which where received through S-channels, and then decrypt module is used to get the original
message or plain text. Prior to transmission of cipher data the
selected S-channels are informed at the receiver side. The data
received through R-S channels at the received end are
discarded. |
 |
| Figure 1: Data Blocks |
| The plain text is being spitted into equal size of blocks. These
blocks of data are being sent to the intended receiver through
multiple selected channels, after applying RSA-CRT
transformations. |
Session Phase |
| There is two different sessions executed during transmission.
The first sessions is initiated before the transmission while the
second session initiated at the end of the transmission. The
first session is termed as sender session, while the second
session is receiver session |
Sender Session |
| The sender process executes the following steps:
1.On data arrival for transmission, the data or message M is
partitioned into blocks.
2.The partitioned block is transmitted after applying RSACRT
transformation.
3. Transmit the transformed data into S selected channels.
4. The sender process waits for more input until data available
for sending. This sender side is a blocked phase. |
Receiver Session |
| The receiver process executes the following steps:
1.Select the channels step.
2. In this step, the receiver process waits for input from
different channels. This operation is blocking.
3. The received data on each channel is maintained as separate
blocks.
4. These blocks are decrypted using inverse module of RSACRT
transformation.s |
Channel Selection |
| The transmission channels S a subset from R is chosen on
accounting of various constraints such as, network traffic,
congestion occurrence, and previous network failures. On the
R-S transmission channels irrelevant data is sent. For
identifying irrelevant data a stream of pre-determined bits are
being added to blocks of data before transmission on R-S
channels. |
Number of Channels |
| The maximum number of channels max(S) used for
transmission is based on the number of blocks to be
transmitted with an max_constraint on the max(S). |
Chinese Reminder Theorem in RSA |
| The usage of Chinese Reminder Theorem (CRT) during
decryption results much faster. The RSA-CRT differs from the
standard RSA in key generation and decryption. |
RSA-CRT key generation |
 |
| In this particular technique of transferring data using multiple
channel and RSA-CRT, we can justify that the security is
maintained because there may be a chance for the intruders to
break the encrypted method by using long permutation
method. So, we can surely justify that data will be more secured by using multiple channels compared to data using
single channels. In serial transmission even though the data’s
security can be maintained but the chance for maintaining the
reliability is very less. That is, there are some types of users
who aim only in affecting the reliability of the transmission
but not about breaking the secrecy of the data. In our paper
since we are dealing with multiple channels, the rate of
reliability will be high compared with single channel. |
 |
| Table 1: Total number of lost packets due to factors of
reliability |
 |
CONCLUSION |
| In this paper new technique for transmitting data is introduced.
The proposed scheme is found to be more secure by
transmitting data through different channels for the same
receiver in various blocks |
References |
- Aho A., Hopcroft J., and Ullman J. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
- GoldreichOded, Ron Dana, Sudan Madhu, Chinese Remaindering with errors. Proceedings of the Thirty- First annual ACM Symposium on Theory of Computing 1998.
- Ahmed A. Belal, Alexandria, Secure Transmission of sensitive data using multiple channels.
- Dan Boneh and HovavShacham, Winter/Spring 2002. Fast Variants of RSA. CryptoBytes-Volume 5, No. 1, Winter/Spring 2002, pg 1-9. Available:http://www.rsasecurity.com/rsalabs/cryptobytes /CryptoBytes_January_2002_final.pdf
- Hung-Min Sun and Mu-En Wu, 2005, February. An Approach Towards Rebalanced RSA-CRT with Short Public Exponent. Cryptology ePrint Archive: Report 2005/053, Available: http://eprint.iacr.org/2005/053
|
Menu