I-PRESENT&amp;lt;sup&amp;gt;TM&amp;lt;/sup&amp;gt;: An Involutive Lightweight Block Cipher

Z’aba, Muhammad Reza; Jamil, Norziana; Rusli, Mohd Ezanee; Jamaludin, M. Z.; Yasir, Ahmad Azlan Mohd

doi:10.4236/jis.2014.53011

Cited by 6 publications

(7 citation statements)

References 19 publications

(27 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The DC attack has initially been presented on the AES-128 decreased to five rounds by Biham and Keller [23,24]. That was later developed by Cheon et al [25] to discover six rounds utilizing 291.5 preferred plaintext pairs and time complexity of 2122.…”

Section: Theoretical Confirmation Of DC Attack On Aesmentioning

confidence: 99%

“…That was later developed by Cheon et al [25] to discover six rounds utilizing 291.5 preferred plaintext pairs and time complexity of 2122. For AES-192 and AES-256, Raphael and Phan [26] achieved to attack both AES-192 and AES-256 reduced to seven rounds [24]. The DC attack needed 292 (AES-192) and 292.5 (AES-256) chosen-plaintext pairs with time complexities of 2186 (AES-192) and 2250.5 (AES256) respectively [24].…”

Section: Theoretical Confirmation Of DC Attack On Aesmentioning

confidence: 99%

“…For AES-192 and AES-256, Raphael and Phan [26] achieved to attack both AES-192 and AES-256 reduced to seven rounds [24]. The DC attack needed 292 (AES-192) and 292.5 (AES-256) chosen-plaintext pairs with time complexities of 2186 (AES-192) and 2250.5 (AES256) respectively [24]. Currently, the best DC attack filters AES-128 up to six rounds [24].…”

Section: Theoretical Confirmation Of DC Attack On Aesmentioning

confidence: 99%

“…The DC attack needed 292 (AES-192) and 292.5 (AES-256) chosen-plaintext pairs with time complexities of 2186 (AES-192) and 2250.5 (AES256) respectively [24]. Currently, the best DC attack filters AES-128 up to six rounds [24]. For both AES192 and AES-256, the best DC attack so far succeeds in breaking through seven rounds [24].…”

Section: Theoretical Confirmation Of DC Attack On Aesmentioning

confidence: 99%

See 3 more Smart Citations

Preventing Differential Cryptanalysis Attacks Using a KDM Function and the 32-Bit Output S-Boxes on AES Algorithm Found on the Internet of Things Devices

Muthavhine

Sumbwanyambe

2022

Cryptography

View full text Add to dashboard Cite

Many Internet of Things (IoT) devices use an Advanced Encryption Standard (AES) algorithm to secure data stored and transmitted during the communication process. The AES algorithm often suffers DC (DC) attacks. Little has been done to prevent DC attacks, particularly on an AES algorithm. This study focuses on preventing Differential Cryptanalysis attacks. DC attacks are practiced on an AES algorithm that is found on IoT devices. The novel approach of using a Khumbelo Difference Muthavine (KDM) function and changing the 8 × 8 S-Boxes to be the 8 × 32 S-Boxes successfully prevents DC attacks on an AES algorithm. A KDM function is a newly mathematically developed function, coined and used purposely in this study. A KDM function was never produced, defined, or utilized before by any researcher except for in this study. A KDM function makes a new 32-Bit S-Box suitable for the new Modified AES algorithm and confuses the attacker since it comprises many mathematical modulo operators. Additionally, these mathematical modulo operators are irreversible. The study managed to prevent the DC attack of a minimum of 70% on AES and a maximum of 100% on a Simplified DES. The attack on the new Modified AES Algorithm is 0% since no S-Box is used as a building block.

show abstract

Section: Theoretical Confirmation Of DC Attack On Aesmentioning

confidence: 99%

Section: Theoretical Confirmation Of DC Attack On Aesmentioning

confidence: 99%

Section: Theoretical Confirmation Of DC Attack On Aesmentioning

confidence: 99%

Section: Theoretical Confirmation Of DC Attack On Aesmentioning

confidence: 99%

See 2 more Smart Citations

Preventing Differential Cryptanalysis Attacks Using a KDM Function and the 32-Bit Output S-Boxes on AES Algorithm Found on the Internet of Things Devices

Muthavhine

Sumbwanyambe

2022

Cryptography

View full text Add to dashboard Cite

show abstract

“…The generated key schedule will be of the length of 80 to 128 bits. The developed protocol is modelled using VHDL based platform and the results obtained from the study shows that better security is achieved with the developed ultralight weight cipher with the block size of 64 bit and size of authentic key is of 80 bit [38], [39]. D. SIMON The family of SIMON block ciphers was mainly designed to provide security for a constrained device in which the design simplicity is a crucial factor [45].…”

Section: Fig 4 Trade-off Between the Performance Cost And Securitymentioning

confidence: 99%

Securing Communication in IoT Ecosystem Using Cryptographic Algorithms

Singh¹,

Jain²

2019

IJEAT

View full text Add to dashboard Cite

Internet of Things (IoTs) is defined as an evergrowing network, which comprises of numerous physical objects with a specific IP address along with wireless internet communication, which enables the process of information sharing between two objects. Due to the frequent transfer and exchange of high confidential data between two devices through internet, there arise some susceptible attacks in IoT such as denial of service, eavesdropping attack and so on. A high-level authentication protocol and cryptographic techniques are required to resolve the issue of vulnerable attack and data loss. The current study presents a review of various IoT models and applications. Furthermore, the concerns related to security with respect to data sharing and numerous attacks have been featured in this paper. In order to avoid and minimize these attacks, numerous security measures and cryptographic algorithms have been developed by different authors. The study on several existing protocols has been carried out in this research along with the study on authentication algorithm developed by the authors. The result section contrasts a brief idea about the key requirements for the data security and authentication for the future aspects along with necessity of memory and power utilization. Additionally, some examination has been carried out briefing the future directions in which additionally work would be possible on the development of lightweight cryptography protocols.

show abstract

New Integral distinguishers for I - Present™, TANGRAM and CHAM

Qiu

et al. 2022

2022 7th IEEE International Conference on Data Science in Cyberspace (DSC)

View full text Add to dashboard Cite

I-PRESENT<sup>TM</sup>: An Involutive Lightweight Block Cipher

Cited by 6 publications

References 19 publications

Preventing Differential Cryptanalysis Attacks Using a KDM Function and the 32-Bit Output S-Boxes on AES Algorithm Found on the Internet of Things Devices

Preventing Differential Cryptanalysis Attacks Using a KDM Function and the 32-Bit Output S-Boxes on AES Algorithm Found on the Internet of Things Devices

Securing Communication in IoT Ecosystem Using Cryptographic Algorithms

New Integral distinguishers for I - Present™, TANGRAM and CHAM

Contact Info

Product

Resources

About