Filters








1,346 Hits in 6.5 sec

Tweaks and Keys for Block Ciphers: The TWEAKEY Framework [chapter]

Jérémy Jean, Ivica Nikolić, Thomas Peyrin
2014 Lecture Notes in Computer Science  
We propose the TWEAKEY framework with goal to unify the design of tweakable block ciphers and of block ciphers resistant to relatedkey attacks.  ...  Our framework is simple, extends the key-alternating construction, and allows to build a primitive with arbitrary tweak and key sizes, given the public round permutation (for instance, the AES round).  ...  For example, for most ciphers, more rounds can be attacked in the open-key model than in the related-key model.  ... 
doi:10.1007/978-3-662-45608-8_15 fatcat:dsktm3q4pbb45fprh6jheicsm4

Bright - Proposed Family of Lightweight Block Ciphers for IoT-Enabled Smart Environment

2019 VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE  
This paper proposes a software-oriented new family of lightweight block ciphers, BRIGHT. Proposed family of ciphers support a range of block and key sizes for constraint environment.  ...  For this, we have used the concept of key whitening that helps to resist against attacks like MITM and brute-force.  ...  Key scheduling part uses the round function to generate round keys k i . Let 'K' be a key for BRIGHT 4n block cipher.  ... 
doi:10.35940/ijitee.i7778.078919 fatcat:4w7yxfomwnaazl63fsb6i3hvcy

A Review on Performance Evaluation Criteria and Tools for Lightweight Block Ciphers

Deepti Sehrawat, Maharshi Dayanand University, Rohtak, Haryana (India)
2019 International Journal of Advanced Trends in Computer Science and Engineering  
There are several parameters for both hardware and software implementations that are set to assess the ciphers.  ...  This paper presents criteria posed by these standards that can be considered by a cipher designer so as to include cipher in this standard.  ...  XFC Framework It is important to analyze the ciphers against attacks. Fault attacks like differential fault attack target to recover the secret key.  ... 
doi:10.30534/ijatcse/2019/47832019 fatcat:h53wq7vj6bfdxhuekl7t7cz2yi

Zero-Correlation Attacks on Tweakable Block Ciphers with Linear Tweakey Expansion

Ralph Ankele, Christoph Dobraunig, Jian Guo, Eran Lambooij, Leander Gregor, Yosuke Todo
2019 Zenodo  
In this paper, we consider --- to the best of our knowledge --- for the first time the effect of the tweak on zero-correlation linear cryptanalysis for ciphers that have a linear tweak schedule.  ...  As a result, we can present --- to the best of our knowledge --- the best attack (with respect to number of rounds) on a round-reduced variant of QARMA.  ...  Therefore, such attacks have been well discussed in the context of both related-key attacks on block ciphers and related-tweakey attacks on tweakable block ciphers.  ... 
doi:10.5281/zenodo.2593578 fatcat:rka7qhw4l5b75bnhdfugcixnzi

Related-Key Linear Cryptanalysis

Poorvi L. Vora, Darakhshan J. Mir
2006 2006 IEEE International Symposium on Information Theory  
A coding theory framework for related-key linear cryptanalytic attacks on block ciphers is presented.  ...  It treats linear cryptanalysis as communication over a low capacity channel, and a related key attack (RKA) as a concatenated code.  ...  Vora would like to thank the Imaging Systems Laboratory, Hewlett-Packard Laboratories, for partial support of the research.  ... 
doi:10.1109/isit.2006.261548 dblp:conf/isit/VoraM06 fatcat:xq3k2r4bbzc4bkyngz6fk3h424

Zero-Correlation Attacks on Tweakable Block Ciphers with Linear Tweakey Expansion

Ralph Ankele, Christoph Dobraunig, Jian Guo, Eran Lambooij, Gregor Leander, Yosuke Todo
2019 IACR Transactions on Symmetric Cryptology  
In this paper, we consider – to the best of our knowledge – for the first time the effect of the tweak on zero-correlation linear cryptanalysis for ciphers that have a linear tweak schedule.  ...  As a result, we can present – to the best of our knowledge – the best attack (with respect to number of rounds) on a round-reduced variant of Qarma.  ...  Acknowledgments The research leading to the presented results started during the Flexible Symmetric Cryptography workshop at the Lorentz Center in Leiden, the Netherlands.  ... 
doi:10.13154/tosc.v2019.i1.192-235 dblp:journals/tosc/AnkeleDGLLT19 fatcat:ixcmix2zjrhojnn7aj6vid432u

Zero-Correlation Attacks on Tweakable Block Ciphers with Linear Tweakey Expansion

Ralph Ankele, Christoph Dobraunig, Jian Guo, Eran Lambooij, Gregor Leander, Yosuke Todo
2019 IACR Transactions on Symmetric Cryptology  
In this paper, we consider – to the best of our knowledge – for the first time the effect of the tweak on zero-correlation linear cryptanalysis for ciphers that have a linear tweak schedule.  ...  As a result, we can present – to the best of our knowledge – the best attack (with respect to number of rounds) on a round-reduced variant of Qarma.  ...  Acknowledgments The research leading to the presented results started during the Flexible Symmetric Cryptography workshop at the Lorentz Center in Leiden, the Netherlands.  ... 
doi:10.46586/tosc.v2019.i1.192-235 fatcat:ivshx5lfhjfbdlezsmg743phvy

Automatic Security Evaluation and (Related-key) Differential Characteristic Search: Application to SIMON, PRESENT, LBlock, DES(L) and Other Bit-Oriented Block Ciphers [chapter]

Siwei Sun, Lei Hu, Peng Wang, Kexin Qiao, Xiaoshuang Ma, Ling Song
2014 Lecture Notes in Computer Science  
Using these inequalities combined with Mixedinteger Linear Programming (MILP) technique, we propose an automatic method for evaluating the security of bit-oriented block ciphers against the (related-key  ...  We obtain a 7-round related-key characteristic for PRESENT-128 with probability 2 −11 and 0 active Sbox in its key schedule algorithm, based on which an improved related-key boomerang distinguisher for  ...  In [32] , Ivica Nikolic presented a tweak for the key schedule of AES and the new cipher called xAES is resistant against the related-key differential attacks found in AES.  ... 
doi:10.1007/978-3-662-45611-8_9 fatcat:cpqyacb5evf5fojnbowdaly4im

Generalized Nonlinear Invariant Attack and a New Design Criterion for Round Constants

Yongzhuang Wei, Tao Ye, Wenling Wu, Enes Pasalic
2018 IACR Transactions on Symmetric Cryptology  
Furthermore, we investigate the resistance of block ciphers against generalized nonlinear invariant attacks with respect to the choice of round constants in an extended framework.  ...  The efficiency of this extended framework is practically confirmed by mounting a distinguishing attack on a variant of full-round iSCREAM cipher under a class of 280 weak keys.  ...  The authors would also like to thank Elmar Tischhauser and the anonymous reviewers for their valuable suggestions and comments.  ... 
doi:10.46586/tosc.v2018.i4.62-79 fatcat:ruo22j27vfeuldqtle2bycc4ey

Generalized Nonlinear Invariant Attack and a New Design Criterion for Round Constants

Yongzhuang Wei, Tao Ye, Wenling Wu, Enes Pasalic
2018 IACR Transactions on Symmetric Cryptology  
Furthermore, we investigate the resistance of block ciphers against generalized nonlinear invariant attacks with respect to the choice of round constants in an extended framework.  ...  The efficiency of this extended framework is practically confirmed by mounting a distinguishing attack on a variant of full-round iSCREAM cipher under a class of 280 weak keys.  ...  The authors would also like to thank Elmar Tischhauser and the anonymous reviewers for their valuable suggestions and comments.  ... 
doi:10.13154/tosc.v2018.i4.62-79 dblp:journals/tosc/WeiYWP18 fatcat:db4k5432czcljo3hs5e76ie6cy

Provable security of block ciphers against linear cryptanalysis: a mission impossible?

Gilles Piret, François-Xavier Standaert
2008 Designs, Codes and Cryptography  
In this paper, we are concerned with the security of block ciphers against linear cryptanalysis and discuss the distance between the so-called practical security approach and the actual theoretical security  ...  For this purpose, we present a number of illustrative experiments performed against small (i.e. computationally tractable) ciphers.  ...  Acknowledgements The authors would like to thank Michaël Quisquater, for giving us the idea of this work, and for several long and helpful discussions.  ... 
doi:10.1007/s10623-008-9234-2 fatcat:5624n7fprrbxhe7nzjtycga3ie

Performance Evaluation of Newly Proposed Lightweight Cipher, BRIGHT

Deepti Sehrawat, Maharshi Dayanand University, Nasib Gill, Maharshi Dayanand University
2019 International Journal of Intelligent Engineering and Systems  
Proposed BRIGHT family of ciphers is comparably better than existing lightweight ciphers and support a range of block and key sizes for constraint environment.  ...  It enables users to match their security needs with application requirements by supporting a range of cryptographic solutions. The BRIGHT family of ciphers is a software-oriented design.  ...  This work helps the researchers in the area of IoT security. We invite researchers for the cryptanalysis of the newly proposed family of BRIGHT cipher.  ... 
doi:10.22266/ijies2019.0831.08 fatcat:54wsflvmyzh2ngdycvftanmlxi

RECTANGLE: a bit-slice lightweight block cipher suitable for multiple platforms

WenTao Zhang, ZhenZhen Bao, DongDai Lin, Vincent Rijmen, BoHan Yang, Ingrid Verbauwhede
2015 Science China Information Sciences  
Furthermore, a bit-slice implementation is safe against implementation attacks such as cache and timing attacks compared with a table-based implementation [27] .  ...  However, the main design goal of all the mentioned bit-sliced ciphers is not "lightweight", and there is plenty of room for improvement when it comes to a dedicated lightweight block cipher with bit-slice  ...  Key schedule attacks Among key schedule attacks, the most effective ones are slide attack [39] and related-key cryptanalysis [40] .  ... 
doi:10.1007/s11432-015-5459-7 fatcat:rni2w7bsufflhepqekyrsc557q

CHAM: A Family of Lightweight Block Ciphers for Resource-Constrained Devices [chapter]

Bonwook Koo, Dongyoung Roh, Hyeonjin Kim, Younghoon Jung, Dong-Geon Lee, Daesung Kwon
2018 Lecture Notes in Computer Science  
As a result, we propose a new family of block ciphers, CHAM. CHAM has the following features: -CHAM uses an extremely simple key schedule possibly being implemented without updating key states.  ...  However, some of these ciphers are prone to or fully broken by related-key attacks [41, 24, 36, 23, 26, 58].  ...  Specifications and Design Principles CHAM is a family of block ciphers with a 4-branch generalized Feistel structure.  ... 
doi:10.1007/978-3-319-78556-1_1 fatcat:fcilmpcigjd27bujxww2kicu24

Fast lightweight block cipher design with involution substitution permutation network (SPN) structure

Omar A. Dawood
2020 Indonesian Journal of Electrical Engineering and Computer Science  
The introduced algorithm encrypts the data with a block size of 128-bit 192-bit or 256-bit, which iterative with 10, 12 and 14-rounds respectively similar to the AES cipher.  ...  <p>In the present paper, a new cryptographic lightweight algorithm has been developed for the Internet of Things (IoT) applications.  ...  The key-scheduling algorithm involve a significant Function (F) for generating the ciphering sub-keys for each round.  ... 
doi:10.11591/ijeecs.v20.i1.pp361-369 fatcat:bbvjmcxfdbhp5d2d3tkadcjtxm
« Previous Showing results 1 — 15 out of 1,346 results