# Design Space Exploration for High-Speed Implementation of the MISTY1 Block Cipher

Authors: Raza Hasan; Yasir Khizar; Salman Mahmood; Muhammad Kashif Sheikh
Journal: Mathematical Problems in Engineering
 (2021)

---

## Abstract

This paper proposes 2 × unrolled high-speed architectures of the MISTY1 block cipher for wireless applications including sensor networks and image encryption. Design space exploration is carried out for 8-round MISTY1 utilizing dual-edge trigger (DET) and single-edge trigger (SET) pipelines to analyze the tradeoff w.r.t. speed/area. The design is primarily based on the optimized implementation of lookup tables (LUTs) for MISTY1 and its core transformation functions. The LUTs are designed by logically formulating S9/S7 s-boxes and FI and {FO + 32-bit XOR} functions with the fine placement of pipelines. Highly efficient and high-speed MISTY1 architectures are thus obtained and implemented on the field-programmable gate array (FPGA), Virtex-7, XC7VX690T. The high-speed/very high-speed MISTY1 architectures acquire throughput values of 25.2/43 Gbps covering an area of 1331/1509 CLB slices, respectively. The proposed MISTY1 architecture outperforms all previous MISTY1 implementations indicating high speed with low area achieving high efficiency value. The proposed architecture had higher efficiency values than the existing AES and Camellia architectures. This signifies the optimizations made for proposed high-speed MISTY1 architectures.


---

## Body

## 1. Introduction

With the advances in high-speed wireless applications, the quest to provide secure transfer of data has been of major concern [1, 2]. The efforts are underway to provide a real-time encryption solution for high data transmissions with minimum overhead in terms of power [3–5]. This study primarily focuses on high-speed implementations of a 64 bit MISTY1 block cipher for a wide range of applications, i.e., wireless networks, Ethernet devices, image encryption, and radio network controllers (RNCs) [6].A 64 bit block cipher MISTY1 is an ISO standardized algorithm designed by Mitsubishi Corporation Electric Limited. It is used to handle a 64 bit block of data or less, e.g., 8 byte personal identification numbers (PINs), and is based on a provable 2−56 probability against linear/differential cryptanalysis [7–10]. The differential/integral attacks on MISTY1 require large data as well as computational complexities making it practically infeasible for breaking the MISTY1 block cipher. The hardware architecture of MISTY1 and its major subfunctions FO and FI constitute a repetitive loop structure [11]. Therefore, the MISTY1 algorithm is suitable for the implementations of resource-constrained and high-speed applications.To meet the requirement of the Internet of Things, cryptographic algorithms are frequently optimized for area reduction and high throughput implementation or to achieve a good tradeoff between throughput and speed [12–25]. For low-area design, reutilization/logic optimization methodologies have been widely adopted thereby implementing s-boxes using combinational logic [12–20]. A single-round MISTY1 architecture designed for compact implementation is proposed in [20] consisting of only odd-round functions, i.e., 2 × FL functions, 1 × FO function, and 1 × 32 bit XOR. Later, more compact MISTY1 architectures were proposed comprising only one S9/S7 s-box in the FI function [12]. The compact MISTY1 architectures constitute an area of 3041 and 2331 NAND gates, respectively [12]. Finally, 2 × area-efficient MISTY1 design schemes are proposed in [17] based on the combined substitution unit and threshold throughput requirements. The architectures consist of a very low area of 1853/1546 NAND gates and are the most compact implementations to date. In addition, we analyzed the throughput values of the aforementioned studies and found that the compact MISTY1 architectures attained low throughput values, i.e., ≤500 Mbps, and are therefore unsuitable for high-speed applications [12–14, 17, 20].Contrary to low-area cryptographic hardware architectures, high-speed encryption algorithms utilize LUTs/RAMs or optimized combinational logic for s-boxes using pipelined schemes [20–25]. In the recent era, the focus of the studies has also shifted on the efficient implementations measured in the form of throughput-to-area ratio. Owing to high-speed and efficient implementation requirements, the architecture presented in [20] utilizes FPGA RAM blocks for the implementation of S7/S9 s-boxes. However, the straightforward implementation of LUTs for S9/S7 s-boxes (given in MISTY1 specifications) and longer path delay where 4 × XOR operations are executed in a single clock cycle followed by RAM resulted in a large circuit area and reduced throughput values. The architecture presented in [21] utilizes the double-edge trigger methodology for MISTY1 high-speed pipeline implementation but has a longer path delay. Moreover, no architectural modifications/structural optimizations are made for high-speed MISTY1 implementation. On the contrary, although the MISTY1 architecture proposed in [22] achieves high speed, it costs a large area implementing a large number of pipelines. In this study, an effort has been made for high-speed and efficient MISTY1 implementation. In the last couple of years, multiple studies have been published regarding different block ciphers. In [26], researchers proposed a block cipher based on the chaotic generator and implemented it on Xilinx FPGA to prove its effectiveness. Similarly, in [27], Muthalagu and Jain took an existing block cipher algorithm and enhanced its performance to reduce the encryption time.The unique contributions of the proposed MISTY1n = 8-round pipelined architectures are as follows:Optimized implementation of MISTY1 S9/S7 s-boxes and transformation functions, i.e., FL, FI, FO, and 32-bit XOR, by logic formulation of 4, 5, and 6 bit input LUTs for area reductionDesigning of MISTY1 and its transformation functions to attribute for the distribution of parallel processing in order to obtain a highly efficient pipelined architectureHigh-speed exploration of 8-round MISTY1 architectures by employing SET and DET techniquesThis paper is organized into five sections with the introduction, i.e., Section1, followed by optimizations/designing of LUTs for the implementation of MISTY1 transformation functions described in Section 2. Section 3 proposes 2 × high-speed MISTY1 architectures based on SET and DET pipeline schemes. FPGA implementation results/analysis are described in Section 4. Lastly, a brief conclusion is given in Section 5.


## 2. Optimized Implementation of MISTY1 Transformation Functions

### 2.1. FI Function

The optimizations made in the design/implementation of the proposed FI function and its constituent S9 and S7 substitution functions are elaborated in Figures1(a)–1(e). Figures 1(a) and 1(b) depict the FI function and the equivalent FI with modified S9/S7 paths, respectively. The modifications in Figure 1(b) indicate simultaneous execution of leftmost 9 bits and rightmost 7 bits where the subscripts ‘L’ and ‘R’ represent the leftmost and rightmost bits, respectively. T stands for the TRUNCATE function, and the plus sign showing the summer function is actually the XOR gate. The XOR gate with KIR is adding on the LSB side to reduce the path delay. The LSB bits are dependent on MSB bits, and the addition of KIR eliminates the dependency of MSB on LSB bits. We have optimized the LUTs of LSB bits by combining S7 and XOR gate. The hardware cost is reduced by the optimization of LUTs for both MSB and LSB sides. In the next step shown as Figure 1(c), the dotted lines of Figure 1(b) are replaced by LUTs {(S9-1 ∼ S9-3), (S9-5 ∼ S9-7), and (S7-1 ∼ S7-3)} concatenated by XOR gates. The upper-left LUTs (S9-1 ∼ S9-3) are described in Table 1 as per the modified logic expressions (i.e., S9 is used in conjunction with the zero-extended XOR operation), whereas lower-left LUTs (S9-5 ∼ S9-7) can be obtained by eliminating (x10, x11, …, x16) bits from the given expressions.Figure 1
LUT-based FI function formation. (a) FI function. (b) Modifications for the LUT-based FI function. (c) LUT-XOR structure. (d) Reordering of XORs for the formation of LUTs. (e) LUT-based FI function.
(a)(b)(c)(d)(e)Table 1
Logic formulation for S9 s-boxes as S9-1, S9-2, and S9-3.
yiS9-ILogic expressionsy9S9-1x9x5⊕x9x4⊕x8x4y8x9x7⊕x6⊕x8x6⊕x7x6y7x9x8⊕x8x6⊕x5⊕x9x5⊕x7x5⊕x6x5y6x9⊕x8x7⊕x7x5⊕x7x1⊕x5x1y5x9x6⊕x7x6⊕x9x4⊕x3⊕x6x4⊕x4x3⊕x7x3y4x9x6⊕x8x5⊕x8x3⊕x6x5⊕x5x3y3x9x8⊕x8x5⊕x9x1⊕x6⊕x5x1⊕x1y2x9x8⊕x8⊕x9x5⊕x9x2⊕x5x2y1x9⊕x9x8⊕x9x4⊕x9x2⊕x9x1y9S9-2x8x3⊕x7x3⊕x7x2⊕1y8x9x3⊕x7x3⊕x9x1⊕1y7x9x3⊕x5x4⊕x4x3⊕x1y6x8x4⊕x8x2⊕x6x4⊕x5x4⊕x4y5x5x3⊕x3x2⊕x2x1y4x6x2⊕x4x2⊕x3x2⊕x2y3x7x4⊕x7x2⊕x5x4⊕x4x2y2x8x7⊕x7x6⊕x8x3⊕x8x1⊕x6x3y1x8x7⊕x7x4⊕x4x3y9S9-3x6x2⊕x6x1⊕x5x1y8x6x5⊕x5x4⊕x2⊕x6x1⊕x4x1y7x8x2⊕x6x2⊕x16y6x4x3⊕x3x2⊕x15y5x8⊕x7x1⊕x14y4x9x1⊕x7⊕x2x1⊕x13y3x3x1⊕x2x1⊕x12⊕1y2x4⊕x3x2⊕x11⊕1y1x6x3⊕x6x1⊕x5⊕x3x1⊕x10⊕1The LUTs for (S7-1 ∼ S7-3) are employed as 4 bit and 5 bit input LUTs as described in [21]. In the steps shown in Figures 1(d) and 1(e), the XOR gates of Figure 1(c) are reordered to configure S9-4, S9-8, S7-4, and S7-5 LUTs. The proposed FI function has the primary advantage of reduced LUTs and can be executed in a maximum of 4 clock cycles. Table 2 summarizes the area reduction of 66.7% and 41.3% with the proposed FI function compared to [20, 22], respectively.Table 2
Area reduction of the proposed FI function implemented on Xilinx Virtex-7.
MethodFtnsLUTsArea (slices)% reduction2-13-14-15-1With respect to [10]With respect to [12]Prop.S9-1——362766.741.3S9-2——63S9-3——63S9-4——9—S9-5——45S9-6——9—S9-7—162S9-8——9—S7-1——16S7-2——61S7-3——61S7-4———7S7-57———FI716534[10]FI—81[12]FI——46


### 2.2. FO Function and 32-Bit XOR

MISTY1 FO transformation function is appended with the 32 bit XOR operation in odd and even rounds (except for the last round) as depicted in Figure2(a). Therefore, the proposed LUT-based architecture of the FO function comprises {FO + 32 bit XOR}. Figure 2(b) depicts a modified FO function indicating parallel operations for left/right 16 bits. The dotted lines are also mentioned in Figure 2(b), dividing the FO function into 4 sections with each section having side-by-side logic operations. The proposed FO function is deliberated in Figure 2(c) comprising 4 LUT blocks for left and right 16 bits, respectively.Figure 2
LUT-based architecture for the FO function. (a) FO function + 32 bit XOR. (b) Modified FO function. (c) LUT-based FO function.
(a)(b)(c)The LUTs of the first and third section include the XOR operations, whereas the second and fourth sections comprise FI functions and XOR operations. However, the left-hand side of the second section symbolized by FI1 is composed of (FI + XOR), whereas the right-hand side of the second section includes only the FI function. Similarly, the left-hand side of the fourth section shown as FI3 comprises (FI + (2 × XORs)) as compared to the right-hand side XOR operation. Thus, the FI function described in Section 2.1 is modified as per the design requirements of FI1 and FI3 as shown in Figures 3 and 4, respectively.Figure 3
FI1 function. (a) FI1 function. (b) LUT-XOR structure of the FI1 function. (c) LUT-based FI1 function.Figure 4
FI3 function. (a) FI3 function. (b) LUT-XOR structure of the FI3 function. (c) LUT-based FI3 function.It is evident from Figures3(a)–3(c) and 4(a)–4(c) that changes required to incorporate XORs into the FI function will mainly require the alterations in the last part of the aforementioned FI function. Therefore, new LUTs are added in the lower right part shown as S7-6 and S7-7 for FI1 and FI3, respectively. In addition, S9-8 of Figure 1(e) is replaced by newly formed LUTs S9-9 and S9-10 in the lower left section of FI1 and FI3 functions, respectively.A uniformly distributed LUT-based FO function and inclusion of 32 bit XOR reduce the (initial) latency as well as the pipeline requirements of proposed MISTY1 architectures. The reduction in pipelines and latency thought is not evident from the figures, yet the proposed implementation significantly reduces the area. Table3 summarizes the area of (FO + 32 bit XOR) showing 53.3% and 44.4% reduction compared to [20, 22]. The proposed FO function is based on the clock cycle operation required to execute FI1/FI2/FI3 functions and will be explained in detail in Section 3.Table 3
Area reduction of the proposed FO function.
MethodFTNLUTsArea% reduction w.r.t.2-13-14-15-16-1[10][12]Prop.S9-1 ∼ S9-7—14319—11453.341.2S7-1 ∼ S7-57—1315—S9-8——9——S9-9———9—S9-10———27S7-67————S7-7—7———KOi116————KOi216————KOi316————KOi4 and I5L—16———FI2 XOR16————FI11415643—FI2716534—FI37856367{FO + XOR}92261771137[19]FO—244[21]FO—194—


### 2.3. Proposed FL Function and Area Estimation of MISTY1 Architectures

A reference FL function is shown in Figure5(a) followed by Figure 5(b) showing FL-1 and FL-2 representing 4/3 bit input LUTs for left and right 16 bits, respectively. Thus, area for n = 8-round MISTY1 architecture can be computed by summation of LUTs required for 10 × FL functions, 8 × (FO + 32 bit XOR) functions, and extended key generation function, i.e., 8 × FI2 functions. Table 4 summarizes the area for proposed MISTY1 architectures.Figure 5
FL function. (a) FL function. (b) LUT-based FL function.Table 4
LUT area for MISTY1 architectures.
FunctionLUTsRemarks2-13-14-15-16-1FO7362081416904568 × FOFL—160160——10 × FLKey gen1128440352—8 × FITotal8483762016125656n = 8-round MISTY1


## 2.1. FI Function

The optimizations made in the design/implementation of the proposed FI function and its constituent S9 and S7 substitution functions are elaborated in Figures1(a)–1(e). Figures 1(a) and 1(b) depict the FI function and the equivalent FI with modified S9/S7 paths, respectively. The modifications in Figure 1(b) indicate simultaneous execution of leftmost 9 bits and rightmost 7 bits where the subscripts ‘L’ and ‘R’ represent the leftmost and rightmost bits, respectively. T stands for the TRUNCATE function, and the plus sign showing the summer function is actually the XOR gate. The XOR gate with KIR is adding on the LSB side to reduce the path delay. The LSB bits are dependent on MSB bits, and the addition of KIR eliminates the dependency of MSB on LSB bits. We have optimized the LUTs of LSB bits by combining S7 and XOR gate. The hardware cost is reduced by the optimization of LUTs for both MSB and LSB sides. In the next step shown as Figure 1(c), the dotted lines of Figure 1(b) are replaced by LUTs {(S9-1 ∼ S9-3), (S9-5 ∼ S9-7), and (S7-1 ∼ S7-3)} concatenated by XOR gates. The upper-left LUTs (S9-1 ∼ S9-3) are described in Table 1 as per the modified logic expressions (i.e., S9 is used in conjunction with the zero-extended XOR operation), whereas lower-left LUTs (S9-5 ∼ S9-7) can be obtained by eliminating (x10, x11, …, x16) bits from the given expressions.Figure 1
LUT-based FI function formation. (a) FI function. (b) Modifications for the LUT-based FI function. (c) LUT-XOR structure. (d) Reordering of XORs for the formation of LUTs. (e) LUT-based FI function.
(a)(b)(c)(d)(e)Table 1
Logic formulation for S9 s-boxes as S9-1, S9-2, and S9-3.
yiS9-ILogic expressionsy9S9-1x9x5⊕x9x4⊕x8x4y8x9x7⊕x6⊕x8x6⊕x7x6y7x9x8⊕x8x6⊕x5⊕x9x5⊕x7x5⊕x6x5y6x9⊕x8x7⊕x7x5⊕x7x1⊕x5x1y5x9x6⊕x7x6⊕x9x4⊕x3⊕x6x4⊕x4x3⊕x7x3y4x9x6⊕x8x5⊕x8x3⊕x6x5⊕x5x3y3x9x8⊕x8x5⊕x9x1⊕x6⊕x5x1⊕x1y2x9x8⊕x8⊕x9x5⊕x9x2⊕x5x2y1x9⊕x9x8⊕x9x4⊕x9x2⊕x9x1y9S9-2x8x3⊕x7x3⊕x7x2⊕1y8x9x3⊕x7x3⊕x9x1⊕1y7x9x3⊕x5x4⊕x4x3⊕x1y6x8x4⊕x8x2⊕x6x4⊕x5x4⊕x4y5x5x3⊕x3x2⊕x2x1y4x6x2⊕x4x2⊕x3x2⊕x2y3x7x4⊕x7x2⊕x5x4⊕x4x2y2x8x7⊕x7x6⊕x8x3⊕x8x1⊕x6x3y1x8x7⊕x7x4⊕x4x3y9S9-3x6x2⊕x6x1⊕x5x1y8x6x5⊕x5x4⊕x2⊕x6x1⊕x4x1y7x8x2⊕x6x2⊕x16y6x4x3⊕x3x2⊕x15y5x8⊕x7x1⊕x14y4x9x1⊕x7⊕x2x1⊕x13y3x3x1⊕x2x1⊕x12⊕1y2x4⊕x3x2⊕x11⊕1y1x6x3⊕x6x1⊕x5⊕x3x1⊕x10⊕1The LUTs for (S7-1 ∼ S7-3) are employed as 4 bit and 5 bit input LUTs as described in [21]. In the steps shown in Figures 1(d) and 1(e), the XOR gates of Figure 1(c) are reordered to configure S9-4, S9-8, S7-4, and S7-5 LUTs. The proposed FI function has the primary advantage of reduced LUTs and can be executed in a maximum of 4 clock cycles. Table 2 summarizes the area reduction of 66.7% and 41.3% with the proposed FI function compared to [20, 22], respectively.Table 2
Area reduction of the proposed FI function implemented on Xilinx Virtex-7.
MethodFtnsLUTsArea (slices)% reduction2-13-14-15-1With respect to [10]With respect to [12]Prop.S9-1——362766.741.3S9-2——63S9-3——63S9-4——9—S9-5——45S9-6——9—S9-7—162S9-8——9—S7-1——16S7-2——61S7-3——61S7-4———7S7-57———FI716534[10]FI—81[12]FI——46


## 2.2. FO Function and 32-Bit XOR

MISTY1 FO transformation function is appended with the 32 bit XOR operation in odd and even rounds (except for the last round) as depicted in Figure2(a). Therefore, the proposed LUT-based architecture of the FO function comprises {FO + 32 bit XOR}. Figure 2(b) depicts a modified FO function indicating parallel operations for left/right 16 bits. The dotted lines are also mentioned in Figure 2(b), dividing the FO function into 4 sections with each section having side-by-side logic operations. The proposed FO function is deliberated in Figure 2(c) comprising 4 LUT blocks for left and right 16 bits, respectively.Figure 2
LUT-based architecture for the FO function. (a) FO function + 32 bit XOR. (b) Modified FO function. (c) LUT-based FO function.
(a)(b)(c)The LUTs of the first and third section include the XOR operations, whereas the second and fourth sections comprise FI functions and XOR operations. However, the left-hand side of the second section symbolized by FI1 is composed of (FI + XOR), whereas the right-hand side of the second section includes only the FI function. Similarly, the left-hand side of the fourth section shown as FI3 comprises (FI + (2 × XORs)) as compared to the right-hand side XOR operation. Thus, the FI function described in Section 2.1 is modified as per the design requirements of FI1 and FI3 as shown in Figures 3 and 4, respectively.Figure 3
FI1 function. (a) FI1 function. (b) LUT-XOR structure of the FI1 function. (c) LUT-based FI1 function.Figure 4
FI3 function. (a) FI3 function. (b) LUT-XOR structure of the FI3 function. (c) LUT-based FI3 function.It is evident from Figures3(a)–3(c) and 4(a)–4(c) that changes required to incorporate XORs into the FI function will mainly require the alterations in the last part of the aforementioned FI function. Therefore, new LUTs are added in the lower right part shown as S7-6 and S7-7 for FI1 and FI3, respectively. In addition, S9-8 of Figure 1(e) is replaced by newly formed LUTs S9-9 and S9-10 in the lower left section of FI1 and FI3 functions, respectively.A uniformly distributed LUT-based FO function and inclusion of 32 bit XOR reduce the (initial) latency as well as the pipeline requirements of proposed MISTY1 architectures. The reduction in pipelines and latency thought is not evident from the figures, yet the proposed implementation significantly reduces the area. Table3 summarizes the area of (FO + 32 bit XOR) showing 53.3% and 44.4% reduction compared to [20, 22]. The proposed FO function is based on the clock cycle operation required to execute FI1/FI2/FI3 functions and will be explained in detail in Section 3.Table 3
Area reduction of the proposed FO function.
MethodFTNLUTsArea% reduction w.r.t.2-13-14-15-16-1[10][12]Prop.S9-1 ∼ S9-7—14319—11453.341.2S7-1 ∼ S7-57—1315—S9-8——9——S9-9———9—S9-10———27S7-67————S7-7—7———KOi116————KOi216————KOi316————KOi4 and I5L—16———FI2 XOR16————FI11415643—FI2716534—FI37856367{FO + XOR}92261771137[19]FO—244[21]FO—194—


## 2.3. Proposed FL Function and Area Estimation of MISTY1 Architectures

A reference FL function is shown in Figure5(a) followed by Figure 5(b) showing FL-1 and FL-2 representing 4/3 bit input LUTs for left and right 16 bits, respectively. Thus, area for n = 8-round MISTY1 architecture can be computed by summation of LUTs required for 10 × FL functions, 8 × (FO + 32 bit XOR) functions, and extended key generation function, i.e., 8 × FI2 functions. Table 4 summarizes the area for proposed MISTY1 architectures.Figure 5
FL function. (a) FL function. (b) LUT-based FL function.Table 4
LUT area for MISTY1 architectures.
FunctionLUTsRemarks2-13-14-15-16-1FO7362081416904568 × FOFL—160160——10 × FLKey gen1128440352—8 × FITotal8483762016125656n = 8-round MISTY1


## 3. Design Space Exploration for High-Speed MISTY1 Architectures

### 3.1. Architecture 1: DET Pipeline Architecture for High-Speed MISTY1

A high-speed MISTY1 pipelined architecture is shown in Figure6, whereas the respective FO and FI functions (only the FI2 function is shown for reference) are depicted in Figures 7(a) and 7(b). High-speed MISTY1 comprises 8-round architecture with 5-stage and 10-stage pipelines in odd and even rounds, respectively. The number of pipelines in odd and even rounds of MISTY1 is based on the number of clock cycles required to execute FO/FI functions. A double-edge-triggered pipeline is employed with each LUT triggering on alternate clock cycles. This reduces the pipeline requirements of the MISYT1 architecture; however, it has a path delay of 2 × LUTs as mentioned in [11]. The proposed MISTY1 architecture can process 41 × plaintexts and outputs the required ciphertext of 64 bits per clock cycle. Thus, high-speed MISTY1 is obtained with DET pipelines and highly optimized FO/FI function implementations.(1)TPath DelayT2=TC2QLUT+TPLUT+TSetupLUT.Figure 6
DET pipeline architecture for high-speed MISTY1.Figure 7
(a) FI2 function with double-edge triggering accessing 2 × successive LUTs in 1 × clock cycle. (b) FO function with double-edge triggering.
(a)(b)


### 3.2. Architecture 2: MISTY1 SET Pipeline Architecture for Very High-Speed MISTY1

Very high-speed MISTY1 and its respective FO and FI functions (FI1 and FI3 functions are presented here for reference) employing single-edge-triggered pipelines are depicted in Figures 8 and 9.Figure 8
SET pipeline architecture for very high-speed MISTY1.Figure 9
(a) FI1 function, (b) FI3 function, and (c) FO function with single-edge-triggered pipeline implementation for very high-speed MISTY1.
(a)(b)(c)It is evident that the FI1 function requires 4 clock cycles, whereas the corresponding FO function is executed in 9 clock cycles. The pipeline registers are inserted in the FO function as well as MISTY1 architecture to synchronize LSB and MSB bits. The path delay of the SET-based pipelined architecture is 1 × LUT, and therefore, the architecture achieves very high speed. By increasing the pipeline stages, the latency, i.e., the initial ciphertext generation, increases and is found as 77 clock cycles. The proposed architecture is highly suitable for high-speed applications of the order of 40 Gbps.


## 3.1. Architecture 1: DET Pipeline Architecture for High-Speed MISTY1

A high-speed MISTY1 pipelined architecture is shown in Figure6, whereas the respective FO and FI functions (only the FI2 function is shown for reference) are depicted in Figures 7(a) and 7(b). High-speed MISTY1 comprises 8-round architecture with 5-stage and 10-stage pipelines in odd and even rounds, respectively. The number of pipelines in odd and even rounds of MISTY1 is based on the number of clock cycles required to execute FO/FI functions. A double-edge-triggered pipeline is employed with each LUT triggering on alternate clock cycles. This reduces the pipeline requirements of the MISYT1 architecture; however, it has a path delay of 2 × LUTs as mentioned in [11]. The proposed MISTY1 architecture can process 41 × plaintexts and outputs the required ciphertext of 64 bits per clock cycle. Thus, high-speed MISTY1 is obtained with DET pipelines and highly optimized FO/FI function implementations.(1)TPath DelayT2=TC2QLUT+TPLUT+TSetupLUT.Figure 6
DET pipeline architecture for high-speed MISTY1.Figure 7
(a) FI2 function with double-edge triggering accessing 2 × successive LUTs in 1 × clock cycle. (b) FO function with double-edge triggering.
(a)(b)


## 3.2. Architecture 2: MISTY1 SET Pipeline Architecture for Very High-Speed MISTY1

Very high-speed MISTY1 and its respective FO and FI functions (FI1 and FI3 functions are presented here for reference) employing single-edge-triggered pipelines are depicted in Figures 8 and 9.Figure 8
SET pipeline architecture for very high-speed MISTY1.Figure 9
(a) FI1 function, (b) FI3 function, and (c) FO function with single-edge-triggered pipeline implementation for very high-speed MISTY1.
(a)(b)(c)It is evident that the FI1 function requires 4 clock cycles, whereas the corresponding FO function is executed in 9 clock cycles. The pipeline registers are inserted in the FO function as well as MISTY1 architecture to synchronize LSB and MSB bits. The path delay of the SET-based pipelined architecture is 1 × LUT, and therefore, the architecture achieves very high speed. By increasing the pipeline stages, the latency, i.e., the initial ciphertext generation, increases and is found as 77 clock cycles. The proposed architecture is highly suitable for high-speed applications of the order of 40 Gbps.


## 4. Hardware Implementation Results and Comparison

The proposed MISTY1 high-speed architectures are implemented on FPGA Xilinx Virtex-7, XC7VX690T. The performance comparison/analysis is carried out with existing high-speed Camellia, AES, and MISTY1 architectures. Table5 depicts the performance parameters, i.e., throughput, area, and efficiency, of the proposed and existing design schemes.Table 5
FPGA implementation and comparison.
Ref.AlgorithmArea (slices)Speed (Gbps)Freq (MHz)Eff. (Mbps/slices)[24]AES35,3282605087.36[25]AES433975.9259317.50[23]Camellia280528.4221.610.12[20]∗MISTY118650.56790.3[20]∗MISTY147327.2961.52[20]∗∗MISTY1292021.93427.5[20]∗MISTY1403912.61683.12[20]∗∗MISTY1292021.93427.5[21]∗MISTY1126516.3254.512.9[22]∗MISTY1632210.181591.61[22]∗∗MISTY1250638.9607.515.5[22]∗MISTY1632219.43033.07[22]∗∗MISTY1250638.9607.515.5OursMISTY1150943673.828.5MISTY1133125.2393.718.9∗Results published in papers cited. ∗∗Results obtained by authors with the implementation on the same FPGA.The proposed MISTY1 architectures outperform all previous MISTY1 implementations indicating high speed with low area achieving high efficiency value. The throughput values obtained are 43/25.2 Gbps with a high efficiency of 28.5/18.9 Mbps/slices for very high-speed/high-speed MISTY1 architectures, respectively. For a fair comparison, the referred MISTY1 architectures [20, 22] are implemented using the same FPGA device, i.e., Xilinx Virtex-7. The architectures thus represent highly efficient and high-speed MISTY1 implementations to date. Besides, the proposed architectures have higher efficiency values compared to the existing AES and Camellia architectures (as per our study). This signifies the optimizations made for proposed high-speed MISTY1 architectures.


## 5. Conclusion

In this paper, we proposed MISTY1 8-round pipelined architectures characterizing high-speed and efficient implementations. The structural optimizations and logic modifications in MISTY1 transformation functions readily reduced the LUTs and pipeline requirements. The proposed high-speed MISTY1 architectures using the SET and DET pipeline explore the speed/area tradeoffs for FPGA implementations. The design/optimization schemes can be extended for the high-speed implementation of the KASUMI algorithm. The high-speed designs have applications in wireless sensor networks, image encryption, and network controllers.


### 5.1. Future Work

This paper deals only with a high-speed MISTY1 block cipher. In the future, we shall make an energy-efficient MISTY1 block cipher using capacitance scaling, clock gating, clock enable, thermal scaling, voltage scaling, and other energy-efficient techniques. In the future, we shall check the thermal stability of MISTY1. The implementation of the MISTY1 block cipher is on 28 nm technology-based Virtex-7 FPGA in this paper. There is an open scope to reimplement this MISTY1 block cipher design on both 20 nm technology-based Ultrascale Virtex FPGA and 16 nm technology-based Ultrascale Plus Virtex FPGA.


## 5.1. Future Work

This paper deals only with a high-speed MISTY1 block cipher. In the future, we shall make an energy-efficient MISTY1 block cipher using capacitance scaling, clock gating, clock enable, thermal scaling, voltage scaling, and other energy-efficient techniques. In the future, we shall check the thermal stability of MISTY1. The implementation of the MISTY1 block cipher is on 28 nm technology-based Virtex-7 FPGA in this paper. There is an open scope to reimplement this MISTY1 block cipher design on both 20 nm technology-based Ultrascale Virtex FPGA and 16 nm technology-based Ultrascale Plus Virtex FPGA.



---

*Source: 2599500-2021-06-16.xml*