Abstract
Providing security for transmitted data through the e-commerce environment requires using a fast and high secure encryption algorithm. Balancing between the speed and the security degree is a problem that many of the encryption algorithms suffer from. Increasing the security degree requires increasing the level of complexity which results in increasing encryption time. On the other hand, increasing the algorithm speed may reduce the complexity degree which affects the security level. This paper aims to design an encryption algorithm that balances time and complexity (speed and security). This is done by suggesting a security environment that depends on creating and providing an agent software to be settled into each customer device that manages the purchase and security process without customer interference. The suggested encryption algorithm is applied within this environment. Several modifications are performed on the AES encryption algorithm. The AES was chosen due to its performance (security and speed), which makes it suitable for encrypting transmitted data over the Internet. These modifications involve adding preprocessing steps (padding and zigzag), eliminating Sub Byte step, and reducing the number of rounds. The experimental results showed that the suggested algorithm provides more security and speed in the encryption and decryption process. The randomness degree has increased by 29.5%. The efficiency is increased because the encryption and decryption times are reduced, as is the CPU usage. The throughput for the suggested algorithm is increased by 10% for the encryption process and is increased by 9.3% for the decryption process.
Highlights
Is paper suggests a modified advanced encryption standard (AES) encryption algorithm that aims to solve the problem of balancing between the speed and complexity; this is done by employing several operations as a preprocessing step before starting encryption, removing Sub Byte operation, and reducing the number of rounds
(2) To reduce encryption time by reducing the total number of AES rounds and eliminating some of the operations (Sub Bytes) for each round to consist of only three operations, except the last round consists of two operations
Another study by [44] proposed and implemented an enhanced modification for the advanced encryption standard (AES) algorithm using an additional key generated using a linear feedback shift register (LFSR), which provides an efficient technique for pseudorandom number generation, as well as a reduction in the number of rounds. e algorithm complexity depends on key generation using LFSR
Summary
In today’s resource-constrained situations, the emphasis is shifting toward lightweight cryptographic algorithms. The AES has not modified itself, but the technique of generating the encryption key is changed depending on the flower pollination algorithm, which consumes additional time and increases only the S-Box complexity, not the entire algorithm. Another study by [44] proposed and implemented an enhanced modification for the advanced encryption standard (AES) algorithm using an additional key generated using a linear feedback shift register (LFSR), which provides an efficient technique for pseudorandom number generation, as well as a reduction in the number of rounds. Is study [45] proposes a secured modified advanced encryption standard algorithm that reduces the number of rounds in the advanced encryption standard (AES) to 14 to reduce encryption and decryption process time while enhancing data security. E e-commerce website generates a secure environment for data transmission depending on an agent structure that is responsible for two tasks: purchase management and encryption management. Before starting the encryption process, there are two steps, which are called preliminary steps. ese steps involve the padding process and zigzag
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
