# Utilizing Trusted Lightweight Ciphers To Support Electronic-Commerce Transaction Cryptography
## 3 Background of E-Commerce and Used Techniques
### Overview of Security Techniques
Distinguishing AES reduces the number of rounds of encryption, reduces data encryption, reduces power consumption and improves the level of security. Table 2 provides a comparison between existing block ciphers with the AES algorithm. One of the most used symmetric key encryption algorithms is AES, which encrypts and decrypts sensitive data using the same key. Due to its lower cost and simpler execution in both software and hardware, AES is considered the most secure cryptographic method. The encryption and decryption phases of the non-Feistel cipher AES use the same rounds of operations. It has been demonstrated that AES executions on hardware are both quicker and more secure than those on other cryptographic executions [17]. The use of the AES algorithm as a basis decreases the number of encryption rounds and works to increase the complexity and resistance to attacks of various paradigms, leading to more security of data and a safer algorithm [34]. * **Chinese Remainder Theorem Technique** A theorem in number theory involving simultaneous linear congruences is called the \begin{table}
\begin{tabular}{c c c c c} \hline \hline
**Block Cipher Algorithm Block Size** & **Key Size** & **Number of Rounds Algorithm Design Pattern** \\ \hline HIGHT & 64 & 128 & 32 & GFN \\ Pickolo & 64 & 80/128 & 25/31 & GFN \\ PRESENT & 64 & 80/128 & 31 & SPN \\ DES & 64 & 56 & 16 & Feistel \\ AES & 128 & 128/192/256 & 10/12/14 & SPN \\ Clefia & 128 & 128/192/256 & 18/22/26 & GFN \\ TEA & 64 & 128 & 64 & Feistel \\ XTEA & 64 & 128 & 64 & Feistel \\ NTSA & 64 & 128 & 64 & Feistel \\ \hline \hline \end{tabular}
\end{table} 
Table 2: Comparison between block cipher algorithms. Figure 5: AES algorithm structure. Chinese remainder theorem (CRT). In general, if there are congruences of a certain form, it states:  
\[S\equiv ai_{1}(mod\ ppi_{1}),S\equiv ai_{2}(mod\ ppi_{2})\ldots S\equiv ai_{n}(mod \ ppi_{n})\]  
where \(S\) is a solution, \(ai_{1},ai_{2}\ldots ai_{n}\) are arbitrary integers (\(ai\)) and \(ppi_{1},ppi_{2},\ldots ppi_{n}\) are pairwise positive integers (\(ppi\)). If it has a solution, then the solution is unique in relation to the product \(ppi_{1}*ppi_{2}*\ldots*ppi_{n}\). The equation will satisfy any other solution (\(OS\)) if \(S\) is a solution to the problem \(S\equiv OS\) (\(mod\ ppi_{1}*ppi_{2}*\ldots*ppi_{n}\)). A system of congruences can be solved using the theorem when the moduli have no common factors except 1. This technology was discovered in the world in the third century common era (CE) by the Chinese mathematician [PERSON]. One of the most crucial theorems in mathematics, CRT is an algorithm for decreasing standard arithmetic by a significant amount for the same arithmetic for each coefficient aspect. In a landscape where new types of applications are open to the perfect combination of beauty and usability, the perfect combination of beauty and usability continues to emerge in new contexts [35]. The CRT algorithm is used in many areas of contemporary research and high-tech industries, including communication, coding, computer, and cryptography [36]. Most recently, the CRT technique and corresponding forms of representation of numbers and methods for reconstructing integers have been studied by residue code, which is intensively used, especially with regard to its application in high-performance calculating. The main focus is on computationally reducing calculations and complexity of the main integrative features of the residue code [37].