Design of Finite field Multiplier for Efficient Data Encryption



Abstract—

Galois field (GF) number-crunching circuits find various applications in correspondences, signal handling, and security designing. Formal verification procedures of GF circuits are rare and restricted to circuits with realized piece places of the essential information sources and yields. They likewise require information of the final polynomial P(x), which influences final equipment execution. This paper introduces a PC variable based math method that performs verification and figuring out of GF (2^m) multipliers straightforwardly from the entryway level usage. The methodology depends on extricating an exceptional final polynomial in a parallel manner and continues in three stages: 1) decide the bit situation of the yield bits; 2) decide the bit situation of the info bits; and 3) separate the unchangeable polynomial utilized in the structure. We show that this strategy can figure out GF (2^m) multipliers in m strings. Analyses performedonsynthesizedMastrovitoandMontgomerymultipliers with various P(x), including NIST-prescribed polynomials, exhibit high efficiency of the proposed strategy.

IndexTerms—Finitefieldmultipliers,Cryptography,irreducible polynomial,Array multiplier, Booth multiplier, Vedic multiplier

I. INTRODUCTION

alois field (GF) is a number framework with a finite number of components and two fundamental number-crunching activities, expansion and augmentation; different

tasks can be gotten from those two [1-3]. GF number-crunching assumes a significant job in coding hypothesis, cryptography, and their various applications. In this manner, creating formal procedures for equipment usage of GF number juggling circuits, and especially for finite field augmentation, is fundamental. Ordinarily, the unchangeable polynomial with a base number of components gives the best execution [4], yet it isn't generally the situation. Because of the rising number of dangers in equipment security, breaking down limited field circuits gets significant. PC

variable based math systems with polynomial portrayal appear to offer the best answer for breaking down number juggling circuits. A few works address the confirmation and useful deliberation issues, both in Galois field arithmetic and integer arithmetic implementations [6-9]. Representative PC variable based math strategies have additionally been utilized to switch engineer the word-level tasks for GF circuits and whole number arithmetic circuits to improve confirmation execution [11].

[14] Explains detailed scrutiny of adder circuits for power efficient electronic gadgets is presented. In trending VLSI technology QCA adders and multipliers are also in high demand [15], [17]. A reconfigurable energy efficient CMOS adder circuit is discussed in [14]. . Vedic Mathematics got profound space in designing high speed and accurate multipliers [12],[18]. In order to increase the clock efficiency of any VLSI circuits Two-Fold Edge triggering is inbuilt to fasten the processor speed along with high speed multipliers and adders [16], [18], [19].

GF arithmetic plays an important role in coding theory, cryptography, and their numerous applications [20],[21]. Therefore, developing formal techniques for hardware implementations. The components in

Design of Finite field Multiplier for Efficient Data Encryption

R. S Ernest Ravindran¹, K. Mariya Priyadarshini², A. Thanusha sai³, P. Shiny⁴ Sk. Sabeena⁵ Department of Electronics and Communication Engineering, Koneru Lakshmaiah Education

Foundation, Vaddeswaram, AP, India.

G

field GF (2m) can be spoken to utilizing polynomial rings. The field of size m is developed utilizing final polynomial P(x), which incorporates terms of degree with d ∈ [0,m] with coefficients in GF(2). The number-crunching activity in the field is then performed modulo P(x). The decision of the unchangeable polynomial has a significant sway on the equipment execution of the GF circuit and its presentation. . Generally, in data transmission we can use various devices like blue tooth, XBee and remote USB gadgets. [22] Portrays a blueprint of ground-breaking security for data correspondence by arranging standard computation for encryption and decryption. Arbitrary number generators are most unmistakably utilized in the region of correspondence to give security to data frameworks through pseudo irregular groupings. It additionally appropriate for key age in cryptography applications and mark analyzer to create test designs for Built-In-Self Test [23]. Our methodology takes care of this issue by changing the logarithmic articulations of the yield bits into a mathematical articulation of the info bits and is done in parallel for each yield bit. Specifically, it incorporates the accompanying steps1: • Concentrate the arithmetical articulation of each yield bit. • Decide the bit situation of the yields. • Decide the bit situation of the sources of info. • Concentrate the unchangeable polynomial P(x). • Concentrate the specification by logarithmic changing.

II. PREVIOUSWORK 2.1 Vedic Multiplier

The utilization of Vedic arithmetic lies in the way that it diminishes the commonplace counts in regular science to exceptionally basic ones. This is so in light of the fact that the Vedic formulae are professed to be founded on the common standards on which the human personality works. Vedic Science is a technique of number-crunching decides that permit increasingly effective speed usage. This is an extremely intriguing field and exhibits some compelling calculations which can be applied to different parts of designing, for example, figuring.

Vedic science depends on 16 Sutras managing different parts of arithmetic like number juggling, variable based math, geometry etc. These sutras are intended for quicker mental count .These Sutras alongside their concise implications are enrolled underneath in order. These techniques and thoughts can be legitimately applied to trigonometry, plain and round geometry, conics, analytics (both differential and fundamental) and applied arithmetic of different sorts.

Fig: 1 Architecture of 4*4 Vedic Multiplier.[13]

2.2 Array Multiplier

Array multiplier is an effective design of a combinational multiplier. The two's supplement increase is changed over to an equal parallel cluster expansion issue in which every incomplete item bit is the AND of a multiplier bit and a multiplicand bit, and the indications of all the fractional item bits are positive[2].In exhibit multiplier, consider two paired numbers An and B, of m and n bits. There are mn summands that are delivered in parallel by a lot of mn AND doors. n x n multiplier requires (n-2) full adders, n half-adders and n2 AND doors. Likewise, in cluster multiplier most pessimistic scenario deferral would be (2n+1) td.Array Multiplier gives more power utilization just as ideal number of segments required, yet delay for this multiplier is bigger. It additionally requires bigger number of doors due to which zone is likewise expanded; because of this exhibit multiplier is less conservative Along these lines, it is a quick multiplier yet equipment unpredictability is high.Array multiplier is outstanding because of its standard structure[27-30]. Multiplier circuit depends on repeated expansion also, moving methodology. Every partial product is produced by the augmentation of the multiplicand with one multiplier digit. The partial product are moved concurring to their bit groupings and after that additional.

The summation can be performed with typical carry propogationadder.

Fig: 2 Architecture of 4*4 Array Multiplier.

2.3 BOOTH MULTIPLICATION

Booth Multiplication looks at contiguous sets of bits of the 'N'- bit multiplier Y in marked two's supplement portrayal, including an understood piece underneath the least critical piece, y−1 = 0. For each piece yi, for I running from 0 to N − 1, the bits yi and yi−1 are considered. Where these two bits are equivalent, the item gatherer P is left unaltered. Where yi = 0 and yi−1 = 1, the multiplicand times 2i is added to P; and where yi = 1 and yi−1 = 0, the multiplicand times 2i is subtracted from P. The last estimation of P is the marked item[23-26].

The portrayals of the multiplicand and item are not indicated; ordinarily, these are both likewise in two's supplement portrayal, similar to the multiplier, yet any number framework that supports expansion and subtraction will fill in also. As expressed here, the request for the means isn't resolved. Regularly, it continues from LSB to MSB, beginning at I = 0; the increase by 2i is then commonly supplanted by steady moving of the P gatherer to one side between steps; low bits can be moved out, and ensuing

augmentations and subtractions should then be possible just on the most noteworthy N bits of P.[2] There are numerous varieties and advancements on these details.is frequently portrayed as changing over series of 1s in the multiplier to a high-request +1 and a low-request −1 at the parts of the bargains. At the point when a string goes through the MSB, there is no high-request +1, and the net impact is understanding as a negative of the suitable worth.

Example:

Find 3 × (−4), with m = 3 and r = −4, and x = 4 and y = 4:

m = 0011, - m = 1101, r = 1100 A = 0011 0000 0

S = 1101 0000 0 P = 0000 1100 0

Find the loops for four times:

P = 0000 1100 0. The last two bits are 00.

P = 0000 0110 0. Arithmetic right shift.

P = 0000 0110 0. The last two bits are 00.

P = 0000 0011 0. Arithmetic right shift.

P = 0000 0011 0. The last two bits are 10.

P = 1101 0011 0. P = P + S.

P = 1110 1001 1. Arithmetic right shift.

P = 1110 1001 1. The last two bits are 11.

P = 1111 0100 1. Arithmetic right shift.

The item is 1111 0100, which is −12.

Fig: 3 Architecture of 4*4 Booth Multiplier.

III PROPOSED FINITE FIELD MULTIPLIER

Hence, as Given a GF(2^m) duplication, the in-field productsets(s0, s1,..., sm−1)appearinexactlyoneelement of GF(2^m) each, and the out-of-field item sets (sm, sm+1, ..., s2m−1) show up in any event two components (yields) of GF(2^m), because of decrease mod P(x). Evidence: An unchangeable polynomial in GF(2^m) has the standard structure P(x) = x^m + P0(x), where the tail polynomial P0(x) contains at any rate two monomials x^d with degree d < m. For instance, there are two such monomials for a trinomial, four for pentanomial, and so on. Since P(x) = 0 we have x^m = P0(x) in GF(2^m). Henceforth the variable x^m, related with the first out-of-field fractional item set s^m will show up in any event two yields, dictated by P0(x).

Different factors, x^k, related without-of-field halfway item set s^k, for k> m, can be communicated as x^k = x^k-mx^m = x^k-mP0(x) and will contain at any rate two components. the quantity of yields where the out-of- field set s^k will show up is equivalent to the quantity of monomials in the above item x^k-mP0(x), furnished that each monomial x^j with j > m is recursively diminished mod P0(x), i.e., by utilizing connection x^m = P0(x). We represent this reality with a case of increase in GF(2⁴) utilizing final polynomial P1(x) = x⁴ + x³ + 1 appeared in the left half of Fig(4). The in-field sets, related with yields z0,z1,z2,z3, are s0,s1,s2,s3.

Since P1(x) = x⁴ + x³ + 1 = 0, we get x⁴ = x³ + 1. This implies set s4 shows up in two yield segments, z3 and z0. At that point x⁵= x·x⁴ = x(x³ + 1) = x⁴ + x = x³ + x + 1, which implies that s5 shows up in three yields: z3,z1,z0. At last, x⁶ = x·x⁵ = x(x³ +x+1) = x⁴ +x² +x = x³ +x² +x+1. That is, s6 will show up in four yields: z3,z2,z1,z0.

a3 a2 a1 a0

b3 b2 b1 b0

a3b0 a2b0 a1b0 a0b0 a3b1 a2b1 a1b1 a0b1 a3b2 a2b2 a1b2 a0b2 a3b3 a2b3 a1b3 a0b3

S6 S5 S4 S3 S2 S1 S0

P1(x)=x⁴+ x³ + 1 P2(x)=x⁴ + x + 1 S3 S2 S1 S0 S3 S2 S1 S0

S4 0 0 S4 0 0 S4 S4

S5 0 S5 S5 0 S5 S5 0 S6 S6 S6 S6 S6 S6 0 0 Z3 Z2 Z1 Z0 Z3 Z2 Z1 Z0 Fig(4) Two GF(24) multiplications constructed using

P1(x)=x4+ x3 + 1 and P2(x)=x4 + x + 1.

Output Polynomial Expression Z3 (a0b0)+a1b3+a2b2+a3b1

Z2 (a0b1+a1b0)+a1b3+a2b2+a2b3+a3b1+a3b2 Z1 (a0b2+a1b1+a2b0)+a2b3+a3b2+a3b3 Z0 (a0b3+a1b2+a2b1+a3b0)+a3b3

Fig(5) Extracted algebraic expressions

IV RESULTS

The above mentioned Galois Finite Field Multiplier is implemented on Vedic, Booth and Array multiplier and the concept irreducible polynomials is extracted by verilog HDL. Xilinx Vivado software is used to run behavioral simulation and to generate synthesis reports. Figure 6 and 7 shows output simulated waveforms and technology schematic of 4-bit Galois multiplier using Vedic Math’s. Figure 8 and 9 displays the behavioral waveforms and technology schematic of using array multiplier. Figure 10 and 11 shows waveforms and schematic generated using the concept of modified booth multiplication to generate encrypted bits.

Fig: 6 waveform of generated encrypted data using Vedic multiplication

Fig: 7 RTL schematic showing number of logic cells and interconnecting nets utilized in designing Finite field multiplier using Vedic Multiplier

Fig: 8 waveforms of generated encrypted data using Array multiplication

Fig: 9 RTL schematic showing number of logic cells and interconnecting nets utilized in designing Finite field multiplier using Array Multiplier

Fig:10 waveforms of generated encrypted data using booth multiplication

Fig: 11 RTL schematic showing number of logic cells and interconnecting nets utilized in designing Finite field multiplier using Booth Multiplier

Table: 1 Comparison Table of various GF-Multipliers PARAMETERS ARRAY BOOTH VEDIC On chip power utilized 8.117W 6.888W 8.571W

Dynamic Power Dissipation

7.277W 6.325W 7.597W Static Power Dissipation 0.840W 0.563W 0.974W

Slice LUT 20 34 23

Slice 5 10 7

LUT as logic 20 34 23

Bounded IOB 20 20 20

Total End Points 12 12 12

V CONCLUSION

The aim of this project is the development of high performance encryption system. The proposed multiplier architecture achieves a significant improvement in performance. The encoded multiplier having only shift registers and adder circuits thus reduces the complexity, cost, power consumption and delay.

The Point Addition using various multipliers was taken for comparison and the implementation using encoder multiplier was found to be the on chip power is less for the booth multiplier that is 6.888W when compared to the array (8.117W) and the vedic (8.571W) multipliers. The usage of slice LUT for array multiplier is 20 and 34 for booth and 23 slices LUT’S for vedic multiplier. Total end points are equal for the three multipliers.

REFERENCES

[1] N.Ravi,Dr.T.JayaChandraPrasad,Dr.T.SubbaRao,Y.Subbaiah (2011), ―A Novel Low Power, Low Area Array Multiplier Design for DSP Applications‖ ,Proceedings of 2011 International Conference on Signal Processing, Communication, Computing and Networking Technologies (ICSCCN 2011).

[2] Soniya, Suresh Kumar " A Review of Different Type of Multipliers and MultiplierAccumulator Unit", International Journal of Emerging Trends & Technology in Computer Science (IJETTCS) Volume 2, Issue 4, July – August 2013.

[3] C. Paar and J. Pelzl, Understanding cryptography: a textbook for students and practitioners. Springer Science & Business Media, 2009

[4] M. Jeevitha, R. Muthaiah, P. Swaminathanin, "Review Article: Efficient Multiplier Architecture In VLSI Design", Journal of Theoretical and Applied Information Technology, vol. 38, no. 2, 2012.

[5] AddankiPurna Ramesh, A. V. N. Tilak, A. M. Prasad, "Efficient Implementation of 16-bit Multiplie- Accumulator Using Radix-2 Modified Booth Algorithm and SPST Adder Using Verilog", International Journal of VLSI design & Communication Systems (VLSICS), vol. 3, no. 3, June 2012.

[6] Halbutogullari, A., Koç, Ç.:Mastrovito Multiplier for General Irreducible Polynomials.IEEE Transactions on Computers 49(5), 503–518 (2000).

[7] Garcia-Martinez, M.A., et al.: FPGA implementation of an efficient multiplier over finite fields GF(2m). In: Proceedings of International Conference on Reconfigurable Computing and FPGAs (ReConFig’05) (September 2005).

[8] P. Kitsos, G. Theodoridis y O. Koufopavlou. "An efficient reconfigurable multiplier for Galois field GF(2)". Microelectronics Journal.Vol. 34, Pags.975-980, 2003.

[9] G.C. Ahlquist, B. Nelson y M. Rice. "Optimal Finite Field Multipliers for FPGA's". In P. Lysaght, J.

Irvine, R. Hartenstein (Eds.): Field Programmable Logic and Applications. 9 International Workshop, FPL'99, volume LNCS 1673, pp. 51-60, Glasgow, UK, August/September 1999.

[10] J.López and R. Dahab. "Fast Multiplication on Elliptic Curves over GF(2) without Precomputation".

In C.K. Koc and C. Paar (Eds.): Cryptography Hardware and Embedded Systems, CHES 1999, LNCS, Springer-Verlag, pp. 316-327, 1999.

[11] E. Savas, A.F. Tenca and C.K. Koc. "A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2)". In C.K. Koc and C. Paar (Eds.): Cryptography Hardware and Embedded Systems, CHES 2000, LNCS, Springer-Verlag, pp. 277-292, 2000.

[12] S. S. Kidambi, F. El-Guibaly, and A. Antoniou, ―Area-efficient multipliers for digital signal processing applications,‖ IEEE Trans.CircuitsSyst II, Exp.Briefs, vol. 43, no. 2, pp. 90–95, Feb.1996 [13] D. Naveen Sai, Damarla Paradhasaradhi, R.S. Ernest Ravindran “Comparative Analysis of Efficient

Hierarchy Multiplier using Vedic Mathematics” Comparative Analysis of Efficient Hierarchy Multiplier using Vedic Mathematics ISSN: 2278-3075, Volume-8 Issue-7, May, 2019.

[14] K Mariya Priyadarshini, R. S. Ernest Ravindran, P. Ratna Bhaskar “A Detailed Scrutiny and Reasoning on VLSI Binary Adder Circuits and Architectures” International Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075, Volume-8 Issue-7, May, 2019.

[15] R.S. Ernest Ravindran, Mariya Priyadarshini, Kavuri Mahesh, Vanga Krishna Vamsi , Chaitanya Eswar , Bishan Yasaswi “A Novel 24T Conventional adder vs Low Power Reconstructable Transistor Level Conventional Adder” International Journal of Engineering and Advanced Technology (IJEAT) ISSN: 2249-8958, Volume-8 Issue-5, June 2019.

[16] D. Naveen Sai, G. Surya Kranth, Damarla Paradhasaradhi, R. S. Ernest Ravindran(&), M.

Lakshmana Kumar, and K. Mariya Priyadarshini, “Five Input Multilayer Full Adder by QCA Designer” Communications in Computer and Information Science Volume 1046, 2019, Pages 164- 1743.

[17] K Mariya Priyadarshini, Dr.R.S Ernest Ravindran R.Vinay Kumar, R.Harish, S.S.Sai bhattar, T.

Pavan sri kalyan, “Design and implementation of Dual edge Triggered shift registers for IOT applications”, IJSTR, Volume 10, Issue 10, August 2019.

[18] R. S. Ernest Ravindran, K Mariya Priyadarshini, Dangeti Peda Manikya Pavana Teja, Popuri Nikhil Chakravarthy, Peruboyina Dharma Teja “Design of RAM using Quantum Cellular Automata (QCA) designer”, International Journal of Scientific and Technology Research Volume 8, Issue 8, August 2019, Pages 1385-1390.

[19]Sadiya Shireen S., Murali Krishna B., Naga Lakshmi Prasanna K., Poorna Chander Reddy A., "FPGA based RSA authenticated data hiding in image through steganography", International Journal of Innovative Technology and Exploring Engineering, ISSN: 22783075, Vol No:8, Issue No:4, 2019, pp:550 - 554.

[20] K Mariya Priyadarshini, R. S. Ernest Ravindran “A Novel Two Fold Edge Activated Memory Cell with Low Power Dissipation and High Speed”, International Journal of Recent Technology and Engineering (IJRTE) ISSN: 2277-3878, Volume-8, Issue-1, May 2019.

[21] Murali Krishna B., Siva Kumar M., Rajesh J., Inthiyaz S., Mounica J., Bhavani M., Adidela C.N., FPGA implementation by using XBee transceiver ,2016, Indian Journal of Science and Technology, Vol: 9, Issue: 17, ISSN 9746846.

[22]Murali Krishna B., Madhumati G.L., Khan H., "FPGA based pseudo random sequence generator using XOR/XNOR for communication cryptography and VLSI testing applications", International Journal of Innovative Technology and Exploring Engineering, ISSN:22783075, Vol No:8, Issue No:

4, 2019, pp: 485 - 494.

[23] Neelima U., Noorbasha F., Data encryption and decryption using reed-muller techniques ,2016, International Journal of Engineering and Technology, Vol: 8, Issue: 1, pp: 83 - 91, ISSN 23198613.

[24] Murali Krishna B, Madhumati G.L., Khan H., "FPGA based pseudo random sequence generator using XOR/XNOR for communication cryptography and VLSI testing applications", International Journal of Innovative Technology and Exploring Engineering, ISSN: 22783075, Vol No:8, Issue No:4, 2019, pp: 485 - 494.

[25]Siva D., Sunithamani S., Bojja P., An automated damage assessment index to quantify damage for disaster management using satellite images,2017 Journal of Advanced Research in Dynamical and Control Systems, Vol:9, issue:1, pp: 407-420, ISSN: 1943023X.

[26]Murali Krishna B., Madhumati G.L., Khan H., Stochastic key generation mechanism in cryptography applications through partial reconfiguration,2017 Journal of Advanced Research in Dynamical and Control Systems, Vol:9, issue: Special Issue 12, pp: 1566-1586, ISSN: 1943023X.

[27]Noorbasha F., Manasa M., Gouthami R.T., Sruthi S., Priya D.H., Prashanth N., Rahman M.Z.U., FPGA implementation of

cryptographic systems for symmetric encryption,2017 Journal of Theoretical and Applied Information Technology, Vol:95, issue:9, pp: 2038-2045, ISSN: 19928645.

[28]Murali Krishna B., Madhumati G.L., Khan H., Dynamically evolvable hardware-software co-design based crypto system through partial reconfiguration,2017 Journal of Theoretical and Applied Information Technology, Vol:95, issue:10, pp: 2159-2169, ISSN: 19928645.

[29]Kumar M.S., Murali Krishna B., Tejeswi N.S., Tulasi S.K., Srinivasulu N., Kishore K.H. .," FPGA implementation of tunable arbitrary sequencer for key generation mechanism “, 2018, International Journal of Engineering and Technology(UAE) ,Vol: 7 ,Issue: 3.27 Special Issue 27 ,pp: 617 to:: 620 ,DOI: 10.2147/NBHIV.S68956_old ,ISSN: 2227524X.

[30] Paradhasaradhi D., Satya Priya K., Sabarish K., Harish P., Narasimharao G.V., Study and analysis of CMOS carry look ahead adder with leakage power reduction approaches ,2016, Indian Journal of Science and Technology, Vol: 9, Issue: 17, ISSN 9746846.