International Journal of Innovative Technology and Exploring Engineering (IJITEE)

ISSN: 2278-3075 (Online), Volume-9 Issue-7, May 2020

Algorithm for Clustering the Moduli of RNS for

the Application of Optimization of Time
Complexity in Standard Cipher System
Radhakrishna Dodmane, Ganesh Aithal, Surendra Shetty

 The RNS is widely accepted in cryptographic process because

Abstract: Residue number system (RNS) has emerged as a of its knocking characteristics such as modularity, parallelism
knocking field of research due to its high speed, fault tolerant, and the carry free operation [1-3]. In RNS, the set of residues
carry free and parallel characteristics. Due to these features it has
are computed from the given large number by using the
got important role in high performance computing especially with
reduced delay. There are various algorithms have been found as a moduli sets, identified / determined in advance, this may be
result of the research with respect to RNS. Additionally, since RNS termed as forward conversion. All the arithmetic operations
reduces word length due to the modular operations, its are then carried out on these residues as modulo operations by
computations are faster compared to binary computations. But using the corresponding moduli’s. Once completing all the
the major challenges are the selection of moduli sets for the operations, these non-weighted residues are converted back
forward (decimal to residue numbers) and reverse (residue
numbers to decimal) conversion. RNS performance is purely
as single large number, this process may be termed as reverse
depending on how efficiently an algorithm computes / chooses the conversion. These RNS process is shown in the Fig. 1.
moduli sets [1]-[6].
This paper proposes new method for selecting the moduli sets
and its usage in cryptographic applications based on Schonhage
modular factorization. The paper proposes six moduli sets {6qk 1,
6qk+1, 6qk+3, 6qk+5, 6qk+7, 6qk+11} for the RNS conversions
but the Schonhage moduli sets are expressed as the exponents that
creates a large gap between the moduli’s computed. Hence, a new
method is proposed to for computing moduli sets that helps in
representing all the decomposed values approximately in the same
range.
Fig. 1. RNS Processor
Keywords: Residue arithmetic, conversion, moduli set, residue Even though RNS have got advantages, the reverse
number system (RNS). conversion process may influence the performance due to its
overhead. Therefore, the moduli’s required must be selected
I. INTRODUCTION carefully and must design a precise algorithm for both
In cryptography, computation speed reduces as the value of forward and reverse process to capture the advantages of
the data considered for the operation increases. Therefore, the RNS. To exploit the parallelism, it is very important to have
best solution is to reduce the value of the data or may be the balanced set of moduli’s for the applications [4]-[5].
key space used, but it becomes more vulnerable to the attacks Additionally, the reverse conversion process itself is complex
as go on reduce value. Hence, there is a need of simple and and slow because it has to combine all the residues computed
efficient model / system to handle this problem. One of the in the forward conversion [6].
solutions is Residual Number System (RNS) that could There are many proposals for selecting the moduli sets for
handle the large value as a smaller component which can be the RNS such as three, four and five moduli sets [7]-[9], but
operated in parallel and thus helps in increasing the these moduli sets are not suitable for applications that operate
computation speed. on large word length. Similarly, there are other set of moduli’s
with dynamic range are proposed in [10]-[18]. In all the
Revised Manuscript Received on May 30, 2020. moduli sets proposed, one common finding is the difference
* Correspondence Author
Radhakrishna Dodmane*, Computer Science and Engineering, NMAM between moduli’s selected are in terms of 2n (where n ≥ 0).
Institute of Technology, Nitte, Karkala, INDIA. Email: This large difference reveals some statistics about data used in
[email protected] the RNS process, which would be advantage for the
Ganesh Aithal, Vice-principal, SMVITM, Bantakal, INDIA. Email:
[email protected]
cryptanalyst if adopted in cryptographic process. Hence, it
Surendra Shetty, HOD, MCA, NMAM Institute of Technology, Nitte, has been thought of having balanced set of six moduli in the
Karkala, INDIA. Email: [email protected] RNS process in tern adopt cryptographic process. The set of
six moduli chosen is based on the Schonhage theory but
© The Authors. Published by Blue Eyes Intelligence Engineering and
Sciences Publication (BEIESP). This is an open access article under the CC eliminating the 2n difference among the moduli’s. The
BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/) method of selection of moduli sets and its application are
discussed subsequent sections.

Published By:
Retrieval Number: F4137049620/2020©BEIESP Blue Eyes Intelligence Engineering
DOI: 10.35940/ijitee.F4137.059720
Journal Website: www.ijitee.org
92 & Sciences Publication
Algorithm for clustering the moduli of RNS for the application of optimization of Time Complexity in Standard Cipher
System

Rest of the paper is organized as follows. The details of the (2)

RNS is discussed in the section background. The proposed
method for computing the moduli sets are presented in the And (3)
section III. The section IV contains the application of the From equation (3), number of bits are decided as:
proposed method on the cryptographic standard. (4)
Experimental analysis based on the proposed method are Upon deciding the number of bits for multiplication, the
presented in section V. finally the paper concluded in the last moduli sets are computed as per the equation (5).
section.

II. BACKGROUND
(5)
A. Residue Number System (RNS): These moduli’s chosen are relatively prime, because the
Residue Number System is developed to speed up the exponents of these moduli sets
computations by decomposing the large integers into smaller
components usually called as residues. These smaller are all relatively prime. Upon deciding the moduli’s, any
components are generated by performing modular operation
number ‘U’ less than is decomposed into smaller
on the large integer such that all these residues could be
residues {u1, u2, u3, u4, u5, u6} as per the below equation
operated independently due to its in-built parallel nature.
(6).
Since these residues are very small values, computations on
these residues becomes easier and are directly proportional to
the power required to process. In RNS the moduli’s (6)
chosen are relatively pairwise co-prime that The biggest disadvantage of this method is the large
is for . difference between the moduli’s chosen, since it is driven by
Any weighted number to be processed using RNS is the exponents. This large gap may not suitable in the
cryptographic applications because it may reveal statistical
represented as follows , such that, relationships to the cryptanalysts. Therefore, a novel method
(1) for computing the moduli for RNS method is proposed in this
Such a representation is unique for any integer in the paper that tries to eliminate the large gap between the
moduli’s, which is discussed in the methodology section.
range , where the dynamic range of the moduli is
set , which is equal to the product of III. METHODOLOGY
terms [19]. From the study it has been observed that, residue number
The forward conversion in RNS converts weighted system (RNS) has considerable advantages over speeding up
integers into residue. On these residues the arithmetic the arithmetic computations because of its parallel property
operations such as multiplication, and additions can be [21]-[25]. The properties like in built parallel, carry-free and
performed in parallel without the carry propagation between modularity with respect to arithmetic operations of the RNS
the residues, resulting in high speed parallel operations. These has greater suitability in some applications such as signal
moduli sets has to be converted back to weighted number to processing, coding theory, cryptography [26]. The idea of
use outside the RNS using reverse converter as shown in the speed up the computation using RNS is by the application,
figure 1. which allow the larger integer to represent as combinations of
Similarly, Schonhage has developed a modular arithmetic smaller integer. These representations of set of all smaller
based factorization of large integer specially for multiplying integer by RNS and their component modular multiplication
large integers rapidly, which is discussed in the next section. and addition forms the smaller direct sum of commutative
rings. This property of direct sum of commutative rings has
B. Schonhage Modular approach:
greater advantages over fixed radix or decimal arithmetic
Schonhage has developed an approach to multiply larger operation if used in cipher system.
integers rapidly by modular arithmetic [29]. At first it was Therefore, this idea of decomposition is thought of
hard to believe that the choice of moduli could be
applying in cipher system because it also offers the
advantageous over multiplications and the process of
transmission of encrypted data over multiple channels [27]
conversion of numbers into and out of modular
and also helps in hiding the ciphertext. Hence, this work relies
representations. But Schonhage has proved that modular
multiplications are faster. on proposing a new model to increase the immunity of the
In his theory, he has defined many rules for deciding the cipher system against side channel attack, algebraic attack and
number of bits on which the multiplications are carried out. known plaintext attack.
Upon deciding the number of bits, six moduli sets are The cipher system based on RNS techniques manages
computed, that are relatively pairwise co-prime numbers. In smaller integers that are generated from the decomposition of
order to understand Schonhage theory let us consider a special input integers.
case.
First consider the sequence based on the rules

Published By:
Retrieval Number: F4137049620/2020©BEIESP Blue Eyes Intelligence Engineering
DOI: 10.35940/ijitee.F4137.059720
Journal Website: www.ijitee.org
93 & Sciences Publication
 International Journal of Innovative Technology and Exploring Engineering (IJITEE)
ISSN: 2278-3075 (Online), Volume-9 Issue-7, May 2020

This decomposition of large integers facilitates to process Upon computing the residues carefully to capture the
the smaller components in parallel due to its in-built carry advantages of RNS, its required to define the precise method
free, independent nature, which optimizes the speed of for forward and reverse conversion of RNS system, that is
execution without compromising to the security. Therefore, discussed in the next section.
the idea is to develop a new mathematical RNS model that Forward and Reverse conversion for the proposed method:
would consider as advantages. With this objective the new This section explains the simple multiplicative cipher
RNS mathematical model-based approaches on factorization based on RNS. Let M = be an integer with
of integer are discussed below.
as plain text
Schonhage based computation of prime moduli’s for RNS
This proposed design is based on modular arithmetic such as multiplicative key and as cipher
that it includes the choice of choosing the moduli and text.
conversion of numbers into and out of modular The proposed RNS forward and reverse conversion of is
representations. Even though this is difficult, these operations based on CRT method that is defined for the cipher system as
can be performed quite rapidly. follows.
In this proposed method, choosing of the moduli is based Let X be the integer to be processed in forward conversion
on the number of bits used to represent the integer values and into by equation (13).
the selection of the positive integer which is the key parameter (13)
of all. The mechanism is described by considering the The cipher text for multiplicative cipher is evaluated by
specially defined rules as follows. Let X be a positive integer
using equation (14). In this equation is used as
with number of bits and will be split into n factors multiplicative key
Let, (7) (14)
Such that, (8)
Such that . The weighted
The procedure for determining the number of bits to denote
equivalent of X is computed in the forward conversion by
the range of values is defined as per the equation (9). The
equation (15) as follows:
number of bits is eventually increased almost a factor of two
(15)
with respect to .
(9) Where , and
For the determined -bit value, it has been decided to use
and .
six moduli and are determined as per the equation (10).
Similarly, in the reverse conversion the original number are
computed as per the equation (16).
(16)
Where .
(10) From the above observation, it has been observed that the
These six moduli’s are relatively prime and can be used to proposed method is best suitable for the arithmetic operations
determine the smaller integers as per the equation (11), which involves larger operands. Hence, it has been thought of
assuming k 0 and large integer X. testing the proposed system in the cryptographic standards. In
this paper, the proposed system is tested on the symmetric-key
(11) technique Blowfish.
An Example: The process is best understood if considered
an example. Let us assume k=3, such that, IV. EXPERIMENTAL ANALYSIS OF PROPOSED
SYSTEM
and
The RNS system has greater advantages such as high-speed
Now, the moduli’s are computation, in built parallel nature, immune to power
analysis attack and algebraic attack if applied in arithmetic
operations involving larger integers [26]-[27]. Therefore, the
proposed system is decided to test with respect to the speed of
computations on blowfish algorithm. Because in each round
of blowfish algorithm it contains two 32-bit XOR and one
Feistel function which intern contains two 32-bit addition and
two 32-bit XOR operations. That is a total of (16 rounds ×
(2-XOR+F (2-XOR+2-ADDITION)) +2-XOR) 98 numbers
of 32-bit operations for a single 64-bit block of data to
encrypt. Therefore, it has been decided to apply the proposed
method in the 32-bit addition of Feistel function.

Published By:
Retrieval Number: F4137049620/2020©BEIESP Blue Eyes Intelligence Engineering
DOI: 10.35940/ijitee.F4137.059720
Journal Website: www.ijitee.org
94 & Sciences Publication
Algorithm for clustering the moduli of RNS for the application of optimization of Time Complexity in Standard Cipher
System

That is 32-bit modulo additions of blowfish algorithms are

replaced by the proposed RNS method in which input to the
addition modulo are decomposed using the proposed RNS
and the smaller components are processed in parallel. The
result is analyzed with respect to the time elapsed for the
standard blowfish algorithm v/s the proposed method of
blowfish algorithm. Now let us assume the X=65535 and Y=42153 are the two
The proposed design for the blowfish addition modulo 32-bit values, these are to be added. The addition is such that
operation is show in the Fig. 2. The Fig. 2 shows the output of the residues of X are computed as per the equation (13) as:
two S-boxes are decomposed into smaller 6-bit components
using RNS forward conversion. These components
(corresponding residues) are added in parallel and later
combined based on table driven method to generate 32-bit Similarly, from equation (13) the residues of Y are
equivalent number using RNS backward conversion. computed as:

Now the result of the addition modulo of corresponding

component moduli and are computed as
are computed in parallel based on the
equation (14) as:

Finally, the total sum (C) (the addition modulo 32-bit) is

computed by combining all the component residues ( ) by
the forward RNS weighted conversion as follows using
equation (15).

This is equivalent to addition modulo of 32, that is if added

without proposed model

All six moduli’s are operated in parallel, this indicates the

Fig. 2. Proposed model for blowfish addition modulo time taken for the additive operation is, the additive operation
32. for the maximum moduli that is addition modulo 97 (m6).
It is best understood if considered an example. Therefore, This can be shown experimentally as follows.
an example is discussed to realize the addition modulo using To have a practical insight an experimental result is tested
the proposed model as follows: on an environment that contains Intel(R) CORE(TM)
Let us assume k=4, such that from equation (7) and (8), i5-7200U CPU @ 2.50GHz 2.70 GHz with 4 GB installed
RAM. The result is recorded with respect to the time elapsed
With respect to the above parameters the six moduli’s as for processing both proposed method of blowfish and existing
per the equation (10) with pair vice relatively prime are standard of blowfish.
The result of the test carried out are recorded and analysed
separately for encryption and decryption. For the consistent
output, the test is repeated for fifty times and the average of
the fifty repetitions are recorded and used for the analysis.
The time taken for processing both the method for various file
size is shown table-I.

Published By:
Retrieval Number: F4137049620/2020©BEIESP Blue Eyes Intelligence Engineering
DOI: 10.35940/ijitee.F4137.059720
Journal Website: www.ijitee.org
95 & Sciences Publication
 International Journal of Innovative Technology and Exploring Engineering (IJITEE)
ISSN: 2278-3075 (Online), Volume-9 Issue-7, May 2020

Table-I: Average time between the proposed method processed in its smaller components in parallel enabling to
and standards for Encryption/Decryption Blowfish dissipate actual algebraic relationship between the values and
Encryption Time analysis
Decryption Time also lowered power consumption. Therefore, the proposed
analysis RNS is bests suitable where it’s the security is important
AVG aspects of data exchange.
Time in AVG Time Time Time
seconds elapsed elapsed elapsed
File V. CONCLUSION
elapsed using the using the using the
Size
using the proposed existing proposed In this paper a new approach of RNS to decompose a large
existing method method method
integer into smaller components were proposed. The forward
method
conversion of the proposed RNS is created based on the six
10MB 2.724338 2.417677 0.002506 0.002322
moduli sets
20
5.375882
MB 4.739947 3.653145 3.351455 and the RNS
30
MB
8.200386
6.40815 5.396083 4.11357
for the backward conversion is proposed. In-built nature of
40 the proposed RNS design leads to the higher computation
10.60201 speed and is tested using a standard blowfish algorithm. When
MB 8.228327 7.537973 5.837602
50 proposed RNS system is used, then the total time required for
13.50485 the modular arithmetic operation is the maximum time
MB 9.816842 9.053618 6.657303
60 required to process the largest moduli of the RNS
16.55609
MB 11.630451 11.50914 8.930177 (i.e. ). Hence, the total time of operations
70
20.71033 (modular arithmetic operations) is directly proportional to the
MB 15.379581 14.36431 11.25126
80 largest residue computed in the forward conversion. The
24.36797 experimental analysis shows the optimization of the time
MB 17.713692 15.79634 12.26789
90 complexity by the application of proposed RNS. The
27.85867
MB 21.046451 17.74162 13.62862 proposed RNS system provides immunity to the side channel
100 attack, algebraic attack and power analysis attack because of
31.61525
MB 24.6149229 22.71033 17.85033 parallel processing of the components residues.

From the test and analysis it’s noted that the encryption / REFERENCES
decryption time for standard blowfish algorithm is more
1. S. Molahosseini, K. Navi, C. Dadkhah, O. Kavehei, and S. Timarchi,
compared to the blowfish algorithm with the proposed RNS. “Efficient Reverse Converter Designs for the New 4-Moduli Sets
As file size increases the difference in the time also increases. 2 −1,2 ,2 +1,22 +1−1 and 2 −1,2 +1,2 ,22 +1 Based on New
The same results (table-I) are used to show the difference CRTs,” IEEE Trans. Circuits Syst. I Regul. Pap., vol. 57, no. 4, pp.
823–835, Apr. 2010.
between the encryption time and decryption time for both 2. E. K. Bankas and K. A. Gbolagade, “A residue to binary converter for a
methods (proposed v/s standard blowfish), that is shown in balanced moduli set 22 +1−1,22 ,22 −1", in: Awareness Science and
Fig. 3. Technology and Ubi-Media Computing (iCAST-UMEDIA), 2013
International Joint Conference on, 2013, pp. 211–216.
3. K. A. Gbolagade, R. Chaves, L. Sousa, and S. D. Cotofana,
“Residue-to-binary converters for the moduli set 22 +1, 22 , 2 −1,” in
2009 2nd International Conference on Adaptive Science Technology
(ICAST), 2009, pp. 26–33.
4. Y. Liu and E. Lai, “Moduli set selection and cost estimation for RNS
based FIR filter and filter bank design,” Trans. Des. Aut. Embed. Syst.,
vol. 9, no. 2, pp. 123–139, 2004.
5. S. Piestrak, “Design of residue generators and multioperand modular
adders using carry-save adders,” IEEE Trans. Computers, vol. 43, no. 1,
pp. 68–77, Jan. 1994.
Fig. 3. Difference in time between the proposed method 6. Y. Wang, “Residue-to-binary converters based on new chinese
v/s Standard methods for Encryption/Decryption remainder theorems,” IEEE Trans. Circuits Syst. II, Analog Digital
Blowfish Signal Process,, vol. 47, no. 3, pp. 197–205, Mar. 2000.
7. Y. Wang, X. Song, M. Aboulhamid, and H. Shen, “Adder based residue
The grey line in the figure 3 represents the difference in the to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1),”
encryption time between the standard blowfish algorithm IEEE Trans. Signal Process., vol. 50, no. 7, pp. 1772–1779, Jul. 2002.
whereas the dark line denotes the difference in decryption 8. W. Wang, M. N. S. Swamy, M. O. Ahmad, and Y. Wang, “A high-speed
residue-to-binary converter and a scheme for its VLSI implementation,”
time between the proposed method v/s standard blowfish. The in Circuits and Systems, 1999. ISCAS ’99. Proceedings of the 1999
result shows as the file size increase the time difference IEEE International Symposium on, 1999, vol. 6, pp. 330–333 vol.6.
between both the methods increases, indicating better the time 9. A. Hiasat and A. Sweidan, “Residue number system to binary converter
for the moduli set (2n- 1, 2n- 1, 2n+ 1),” J. Syst. Archit., vol. 49, no. 1–2,
complexity. Therefore, the proposed RNS plays a better role pp. 53–58, 2003.
in optimizing the time complexity of the any processing 10. A. Hariri,K.Navi, and R. Rastegar, “A newhigh dynamic range moduli
system. This is advantageous in the mission critical systems set with efficient reverse converter,” Trans. Comput. Math. Appl., pp.
660–668, Apr. 2008.
where time complexity is utmost important. Another
importance is its in-built parallel processing capability that
leads to increased immunity to side channel attack, algebraic
attack and power analysis attack. Because the values are

Published By:
Retrieval Number: F4137049620/2020©BEIESP Blue Eyes Intelligence Engineering
DOI: 10.35940/ijitee.F4137.059720
Journal Website: www.ijitee.org
96 & Sciences Publication
Algorithm for clustering the moduli of RNS for the application of optimization of Time Complexity in Standard Cipher
System

11. B. Cao, C.-H. Chang, and T. Srikanthan, “An efficient reverse converter Dr. Ganesh Aithal, Professor and Vice-Principal,
for the 4-moduli set based on the new Chinese remainder theorem,” SMVI Technology and Management. Had
IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 50, no. 10, pp. completed his BE in Electrical Power, masters in
1296–1303, Oct. 2003. Digital Electronics (M.Tech) and PhD in Electronics
12. L. Sousa and S. Antão, “MRC-based RNS reverse converters for the and Communication. He has published more than 30
four-moduli sets and,” IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 59, papers in various international journal and
no. 4, pp. 244–248, Apr. 2012. conferences. His areas of interests are Cryptography
13. A. Molahosseini, K. Navi, C. Dadkhah, O. Kavehei, and S. Timarchi, and Network Security, Data Mining and Business
“Efficient reverse converter designs for the new 4-moduli sets and based Analytics. He has guided two PhD students and currently five students are
on new CRTs,” IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 57, no. 4, pursuing under his guidance. He has book chapter under his name. He has
pp. 823–835, 2010. about 32 years of teaching and research experience.
14. A. Skavantzos and T. Stouraitis, “Grouped-moduli residue number
systems for fast signal processing,” in Proc. Int. Symp. Circuit Syst., Dr. Surendra Shetty, Professor and Head, Dept. Of
1999, vol. 3, pp. 478–483. MCA, had completed his B.Sc. in 2001 and Master
15. B. Cao, C.-H. Chang, and T. Srikanthan, “A residue-to-binary converter of Computer Applications during 2004. Dr.
for a new five-moduli set,” IEEE Trans. Circuits Syst. I, Reg. Papers, Surendra Shetty had been awarded his doctoral
vol. 54, no. 5, pp. 1041–1049, May 2007. degree for his research work “Audio Data Mining
16. A. Skavantzos, M. Abdallah, T. Stouraitis, and D. Schinianakis, Using Machine Learning Techniques” in 2013 from
“Design of a balanced 8-modulus RNS,” inProc. IEEE16th Int. Conf. university of Mangalore. He has published more
Electronics, Circuits, Syst., 2009, pp. 61–64. than 25 research papers in different international journals and conferences.
17. A. Skavantzos, “An efficient residue to weighted converter for a new He is currently guiding six research scholars. Dr. Surendra Shetty authored
residue number system,” in Proc. Great Lakes Symp. VLSI, 1998, pp. two book chapters in different publications entitled “Machine Learning
185–191. Approach for Carnatic Music Analysis” and “Applications of Unsupervised
18. A. Hiasat, “VLSI implementation of new arithmetic residue to binary Techniques for Clustering of Audio Data”. He has received research grant of
decoders,” IEEE Trans. Very Large Scale Integer. (VLSI) Syst., vol. 13, 20 lakhs from VGST (GoK) for carrying out research on “Automatic Natural
no. 1, pp. 153–158, Jan. 2005. Language Processing and Speech Disorder Problems in Kannada
19. F. J. Taylor, “Residue arithmetic: A tutorial with examples,” Computer, Language”. He has 15 years of teaching experience. The Research areas of
vol. 17, pp. 50–62, May 1984. interest are Cryptography, Data mining, Pattern Recognition, Speech
20. Li Xiao and Xiang-Gen Xia, “Error Correction in Polynomial Recognition, MIS, Software Engineering and Testing.
Remainder Codes with Non-Pairwise Coprime Moduli and Robust
Chinese Remainder Theorem for Polynomials”, IEEE Transactions on
Communications, DOI: 10.1109/TCOMM.2015.2400997.
21. N. B. Chakraborti, John S. Soundararajan, and A. L. Reddy, “An
Implementation of Mixed-Radix Conversion for Residue Number
Applications”, IEEE Transactions on Computers, Vol. C-35, No. 8,
August 1986.
22. G. A. Jullien et al., "Hardware realization of digital signal processing
elements using the residue number system," Presented at IEEE Int. Conf.
Acoustics, Speech, and Signal Processing, Hartford, CT, May 9-11,
1977.
23. W. K. Jenkins and B. J. Leon, "The use of residue number systems in the
design of FIR digital filters," IEEE Trans. Circuits Syst., vol. CAS-24,
pp. 191-201, Apr. 1977.
24. W. K. Jenkins, "Techniques for residue-to-analog conversion for
residue-encoded digital filters-," IEEE Trans. Circuits Syst., vol.
CAS-25, pp. 555-562, July 1978.
25. A. Z. Baraniecka and G. A. Jullien, "Residue number system
implementation of number theoretic transforms in complex residue
rings," IEEE Trans. Acoustics, Speech, Signal Processing, vol.
ASSP-28, pp. 285-291, June 1981.
26. Ganesh Aithal, K.N. Hari Bhat and U.Sripathi, “Implementation of
Stream Cipher System Based on Representation of Integers In Residue
Number System”, 2010 IEEE 2nd International Advance Computing
Conference, pp. 210-217, 2010.
27. Abdelhamid S. Abdelhamid and Ahmed A. Belel, “Secure Transmission
of Sensitive Data Using Multiple Channels” IEEE international
Conference on Computer System Application 3rd ACS 6th January
2005.
28. NEAL KOBLITZ “A Course in Number theory and Cryptography”
Springer Verlog New York 1987 page 11.
29. Donald E Knuth, “The art of computer programming-semi numerical
algorithms”, published by Dorling Kindersley (India) Pvt. Ltd., licensees
of Pearson Education in south asia, 3rd edition, volume 2.

AUTHORS PROFILE
Mr. Radhakrishna Dodmane, Associate
Professor,Dept. of CSE NMAM Institute of
Technology, Nitte. He has completed his BE in CSE,
masters in CSE and pursuing his PhD in the area
“Cryptography and Network Security” from the
University of VTU karnataka. His areas of interests
are security and data communication. He has about
16 years of teaching experience. Published around nine
papers in the international journals and conferences. Received the best paper
award for one of his paper presented in the international conference
organized in association with springer.

Published By:
Retrieval Number: F4137049620/2020©BEIESP Blue Eyes Intelligence Engineering
DOI: 10.35940/ijitee.F4137.059720
Journal Website: www.ijitee.org
97 & Sciences Publication