Results 31 to 40 of about 718 (207)
An Improvement of Serpent Algorithm [PDF]
Engineering and Technology Journal, 2005 An improvement to Serpent algorithm will be proposed . Serpent algorithm is a Feistel network , iterating a simple encryption function 32 times . The block size is 256 bits , and the key can be any length up to 256 bytes .
Saleh Al - Karaawy, Ashwaq Hashim
doaj +1 more source
End-to-End Encryption in Resource-Constrained IoT Device
IEEE Access, 2023 Internet of Things (IoT) technologies will interconnect with a wide range of network devices, regardless of their local network and resource capacities.
Ala Saleh D. Alluhaidan, P. Prabu
doaj +1 more source
3-round Feistel is Not Superpseudorandom Over Any Group [PDF]
, 2021 Luby and Rackoff used a Feistel cipher over bit strings to construct a pseudorandom permutation from pseudorandom functions in 1988 and in 2002, Patel, Ramzan, and Sundaram generalized the construction to arbitrary abelian groups.
Hector B. Hougaard
core
KFC- The Krazy Feistel Cipher [PDF]
, 2008 . We introduce KFC, a block cipher based on a three round Feistel scheme. Each of the three round functions has an SPN-like structure for which we can either compute or bound the advantage of the best d-limited adaptive distinguisher, for any value of d.
Thomas Baignères, Matthieu Finiasz
core +2 more sources
Integral Cryptanalysis of WARP based on Monomial Prediction
IACR Transactions on Symmetric Cryptology, 2022 WARP is a 128-bit block cipher published by Banik et al. at SAC 2020 as a lightweight alternative to AES. It is based on a generalized Feistel network and achieves the smallest area footprint among 128-bit block ciphers in many settings.
Hosein Hadipour, Maria Eichlseder
doaj +1 more source
New Wine Old Bottles : Feistel Structure Revised [PDF]
, 2022 This paper mainly investigates the iterative structures whose decryption is similar to the encryption. Firstly, we unify many well-known structures which share similar procedures between the decryption and the encryption, and give a sufficient and ...
Dong, Xinfeng +6 more
core +1 more source
Chosen-Key Distinguishers on 12-Round Feistel-SP and 11-Round Collision Attacks on Its Hashing Modes
IACR Transactions on Symmetric Cryptology, 2016 Since Knudsen and Rijmen proposed the known-key attacks in ASIACRYPT 2007, the open-key model becomes more and more popular. As the other component of the open-key model, chosen-key model was applied to the full attacks on AES-256 by Biryukov et al.
Xiaoyang Dong, Xiaoyun Wang
doaj +1 more source
IEEE Access, 2021 One of the main security requirements for symmetric-key block ciphers is resistance against differential cryptanalysis. This is commonly assessed by counting the number of active substitution boxes (S-boxes) using search algorithms or mathematical ...
Mohamed Fadl Idris +3 more
doaj +1 more source
SLIM: A Lightweight Block Cipher for Internet of Health Things
IEEE Access, 2020 Nowadays, there is a strong demand for increasing the protection of resource-constrained devices such as Radio frequency identification (RFID) systems. Current cryptographic algorithms are sufficient for high-resource desktop computers.
Bassam Aboushosha +4 more
doaj +1 more source
A Modification of TEA Block Cipher Algorithm for Data Security (MTEA) [PDF]
Engineering and Technology Journal, 2011 This paper attempts to develop a simple, stronger and safer cryptographic algorithm which would not only be a secure one, but also reduces total time taken for encryption and decryption.
Gaidaa Saeed Mahdi
doaj +1 more source