Filters








10 Hits in 4.4 sec

Related Key Differential Attacks on 27 Rounds of XTEA and Full-Round GOST [chapter]

Youngdai Ko, Seokhie Hong, Wonil Lee, Sangjin Lee, Ju-Sung Kang
2004 Lecture Notes in Computer Science  
s idea combined with our related key differential characteristic can be applied to attack 31 rounds of GOST . Lastly, we propose a related key differential attack on full-round GOST.  ...  In this paper, we present a related key truncated differential attack on 27 rounds of XTEA which is the best known attack so far.  ...  Acknowledgements The authors are thankful to Deukjo Hong for discussing XTEA and very much appreciate Helena Handschuh's and the anonymous referees' aid in improving the presentation of this work.  ... 
doi:10.1007/978-3-540-25937-4_19 fatcat:vm6gwo43jzcp3fmpwfwfw3wyxi

Lightweight Cryptography for IoT: A State-of-the-Art [article]

Vishal A. Thakor, M.A. Razzaque, Muhammad R. A. Khandaker
2020 arXiv   pre-print
right balance of cost, performance and security characteristics.  ...  The explosive growth of industrial control processes and the industrial IoT, imposes unprecedented vulnerability to cyber threats in critical infrastructure through the interconnected systems.  ...  versions [126] , differential fault attacks [97] , Key recovery [98] , Impossible differential attack on 26-round [132] , a related-key attack on full round [133] , biclique cryptanalysis on full round  ... 
arXiv:2006.13813v1 fatcat:tydoekhuvrhjtek64z77zw34ti

Multiple New Formulas for Cipher Performance Computing

Youssef Harmouch, Rachid Elkouch, Hussain Ben-Azza
2018 International Journal of Network Security  
This cryptanalysis can make it hard to compare ciphers because each one is vulnerable to a different kind of attack that is often very different from others.  ...  Cryptography is a science that focuses on changing the readable information to unrecognizable and useless data to any unauthorized person.  ...  factors and the number of uses in one round.  ... 
dblp:journals/ijnsec/HarmouchEB18 fatcat:iygs7uy2yndlto2n2gng2g3dqe

256 Bit Standardized Crypto for 650 GE – GOST Revisited [chapter]

Axel Poschmann, San Ling, Huaxiong Wang
2010 Lecture Notes in Computer Science  
Contrary to the cryptographic properties, there has not been much interest in the implementation properties of GOST, though its Feistel structure and the operations of its round function are well-suited  ...  Our post-synthesis figures for an ASIC implementation of GOST with a key-length of 256 bits require only 800 GE, which makes this implementation well suitable for low-cost passive RFID-tags.  ...  -S.: Related Key Differential Attacks on 27 Rounds of XTEA and Full-Round GOST. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 299-316. Springer, Heidelberg (2004) 14.  ... 
doi:10.1007/978-3-642-15031-9_15 fatcat:llnnn3ik3zefrf2gwziyvzwhei

LBC-IoT: Lightweight Block Cipher for IoT Constraint Devices

Rabie A. Ramadan, Bassam W. Aboshosha, Kusum Yadav, Ibrahim M. Alseadoon, Munawar J. Kashout, Mohamed Elhoseny
2021 Computers Materials & Continua  
Besides, it is immune to different types of attacks such as linear, differential, and side-channel as well as exible in terms of implementation.  ...  The proposed block length is 32-bit supporting key lengths of 80-bit, and it is mainly based on the Feistel structure.  ...  However, a related-key rectangle and a related-key differential attack have been mounted on 26 and 28 rounds of HIGHT.  ... 
doi:10.32604/cmc.2021.015519 fatcat:i5fq2pf3ybbo5ict2imqwrdxhu

Securing Low-cost RFID Systems: A Research Survey

Qi Chai
2014 International Journal of RFID Security and Cryptography  
Cryptanalytic Results Although in the past 20 year, GOST has been intensively studied and several related-key attacks and signalkey attacks targeting round-reduced version of GOST have been published,  ...  the first single key attack on the full GOST was published recently by Isobe in [51] , which leverages the property that, providing R24 = L24 (which happens with probability 2 −32 ), the last 16 rounds  ...  scenario and the recovery of 10 key bits of 120 rounds under a related-key scenario.  ... 
doi:10.20533/ijrfidsc.2046.3715.2014.0015 fatcat:skq7whrbwffhjf22v6ub672al4

All Subkeys Recovery Attack on Block Ciphers: Extending Meet-in-the-Middle Approach [chapter]

Takanori Isobe, Kyoji Shibutani
2013 Lecture Notes in Computer Science  
In other words, most of the recent MITM attacks work only on block ciphers consisting of a bit permutation based key schedule such as KTANTAN, GOST, IDEA, XTEA, LED and Piccolo.  ...  them with respect to the number of attacked rounds in literature.  ...  Acknowledgments The authors would like to thank to the anonymous referees for their fruitful comments and suggestions.  ... 
doi:10.1007/978-3-642-35999-6_14 fatcat:7wsv7lx4pvdndd5nbziis63fji

BRISK: Dynamic Encryption Based Cipher for Long Term Security

Ashutosh Dhar Dwivedi
2021 Sensors  
The cipher design is straightforward due to simple round operations, and these operations can be efficiently run in hardware and suitable for software.  ...  rounds, cipher components, etc.  ...  This technique was very popular when the full round of Data Encryption Standard (DES) was broken by differential cryptanalysis [40] .  ... 
doi:10.3390/s21175744 pmid:34502635 fatcat:suobfqpiibh2hew7rwvdwe7amy

Lightweight Cryptography Algorithms for Resource-Constrained IoT Devices: A Review, Comparison and Research Opportunities

Vishal A. Thakor, Mohammad Abdur Razzaque, Muhammad R. A. Khandaker
2021 IEEE Access  
To provide a holistic view of the area, in this paper, we have compared the existing algorithms in terms of implementation cost, hardware and software performances and attack resistance properties.  ...  Security is considered as the number one challenge in IoT deployments, as most of the IoT devices are physically accessible in the real world and many of them are limited in resources (such as energy,  ...  The optimized sub-key generation technique of EPCBC enhances its immunity against related-key differential attacks.  ... 
doi:10.1109/access.2021.3052867 fatcat:lidatyjdtrh4jirpxnnvgwsupi

Understanding the Related-Key Security of Feistel Ciphers from a Provable Perspective [article]

Chun Guo
2019 arXiv   pre-print
We investigate conditions on the key-schedules that are sufficient for security against XOR-induced related-key attacks up to 2^n/2 adversarial queries.  ...  This allows us to derive concrete implications on these two (more common) models, and helps understanding their differences---and further understanding the related-key security of Feistel ciphers.  ...  ACKNOWLEDGEMENTS I'd like to thank all the five anonymous reviewers of IEEE TIT and CRYPTO 2018 for carefully reading, identifying bugs and typos, supplying invaluable comments that significantly refine  ... 
arXiv:1810.07428v3 fatcat:ti2baqqagnak7n2xvijjohyaoy