Filters








30 Hits in 1.3 sec

Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers [chapter]

Nicky Mouha, Bart Mennink, Anthony Van Herrewege, Dai Watanabe, Bart Preneel, Ingrid Verbauwhede
2014 Lecture Notes in Computer Science  
Chaskey is a permutation-based MAC algorithm that uses the Addition-Rotation-XOR (ARX) design methodology.  ...  We propose Chaskey: a very efficient Message Authentication Code (MAC) algorithm for 32-bit microcontrollers.  ...  Rotational Cryptanalysis.  ... 
doi:10.1007/978-3-319-13051-4_19 fatcat:qk5qnf7utrcordfq7t54ddki6m

Security Analysis of Lightweight IoT Cipher: Chaskey

Ashutosh Dhar Dwivedi
2020 Cryptography  
This paper presents the differential cryptanalysis of ARX based cipher Chaskey using tree search based heuristic approach.  ...  The algorithm can also be applied in different research areas in cryptanalysis where such huge state space is a problem.  ...  Chaskey is based on CBC-MAC and described as permutation-based design.  ... 
doi:10.3390/cryptography4030022 fatcat:don3dwfpybgedd3illfdkkuh34

Automatic Search of Linear Trails in ARX with Applications to SPECK and Chaskey [chapter]

Yunwen Liu, Qingju Wang, Vincent Rijmen
2016 Lecture Notes in Computer Science  
We apply the method to find optimal linear trails for roundreduced versions of the block cipher SPECK and the MAC algorithm Chaskey.  ...  Our work provides designers with more accurate evaluation against linear cryptanalysis on ARX designs, especially for primitives with large block sizes and many rounds.  ...  algorithm Chaskey [16] .  ... 
doi:10.1007/978-3-319-39555-5_26 fatcat:ly5zxnbxpze6jnwzled4524y7y

Rotational Differential-Linear Attack on Chaskey

Yuan Qin, Gaoli Wang, Guoyan Zhang, Yong Yu
2022 Security and Communication Networks  
Rotational/Rotational-XOR differential-linear attack is a kind of powerful attack on ARX primitives.  ...  In this paper, we analyse the message authentication code algorithmChaskey—by using rotational differential-linear attack and using partitioning technique for key recovery.  ...  MAC algorithm can be constructed from other cryptography primitives. Chaksey [1] is a MAC algorithm, the permutation of which is based on ARX primitives.  ... 
doi:10.1155/2022/4186874 fatcat:bfu2wcaesfgypkm2hc2g7h2vtq

Improved Differential-Linear Cryptanalysis of 7-Round Chaskey with Partitioning [chapter]

Gaëtan Leurent
2016 Lecture Notes in Computer Science  
In this work we study the security of Chaskey, a recent lightweight MAC designed by Mouha et al., currently being considered for standardization by ISO/IEC and ITU-T.  ...  We present the first cryptanalysis of Chaskey in the single user setting, with a differential-linear attack against 6 and 7 rounds, hinting that the full version of Chaskey with 8 rounds has a rather small  ...  Skein, BLAKE), and for MAC algorithms (e.g. SipHash, Chaskey). The only non-linear operation in ARX ciphers is the modular addition.  ... 
doi:10.1007/978-3-662-49890-3_14 fatcat:zrpcsxkguvae7d55brlugs6bma

Quantum Period Finding against Symmetric Primitives in Practice [article]

Xavier Bonnetain, Samuel Jaques
2020 arXiv   pre-print
We present the first complete implementation of the offline Simon's algorithm, and estimate its cost to attack the MAC Chaskey, the block cipher PRINCE and the NIST lightweight candidate AEAD scheme Elephant  ...  cryptanalysis.  ...  Chaskey The Chaskey permutation has an ARX structure: it uses only XOR, bit rotation, and modular addition.  ... 
arXiv:2011.07022v1 fatcat:vqdrmksia5fqhjgtwh3muy2uje

Quantum Period Finding against Symmetric Primitives in Practice

Xavier Bonnetain, Samuel Jaques
2021 Transactions on Cryptographic Hardware and Embedded Systems  
We present the first complete descriptions of quantum circuits for the offline Simon's algorithm, and estimate their cost to attack the MAC Chaskey, the block cipher PRINCE and the NIST lightweight finalist  ...  for boolean linear algebra as well as complete reversible implementations of PRINCE, Chaskey, spongent and Keccak which are of independent interest for quantum cryptanalysis.  ...  Chaskey The Chaskey permutation has an ARX structure: it uses only XOR, bit rotation, and modular addition.  ... 
doi:10.46586/tches.v2022.i1.1-27 fatcat:yvkivcg2ubccppx4yvwmff3eke

Automatic Search for the Linear (Hull) Characteristics of ARX Ciphers: Applied to SPECK, SPARX, Chaskey, and CHAM-64

Mingjiang Huang, Liming Wang
2020 Security and Communication Networks  
With the combination of the optimization strategies and the branch-and-bound search algorithm, we can improve the search efficiency for linear characteristics on ARX ciphers.  ...  Linear cryptanalysis is an important evaluation method for cryptographic primitives against key recovery attack.  ...  Chaskey is a MAC algorithm introduced by Mouha et al. at SAC′14 [5] , and an enhanced variant was proposed in 2015 [27] , which increases the number of permutation rounds from 8 to 12. e round function  ... 
doi:10.1155/2020/4898612 fatcat:aefw3q7gpjayjaibexlj2r2jym

Generic Parity Based Concurrent Error Detection for Lightweight ARX Ciphers

Sergei Bauer, Stefan Rass, Peter Schartner
2020 IEEE Access  
We propose an algorithm to generate a group parity based concurrent error detection for generic ciphers based on addition, rotation and XOR (ARX).  ...  We evaluate our solution in terms of gate count and throughput on IC synthesis level.  ...  Most recently, the specified the Chaskey cipher as Message Authentication Code (MAC) for the ISO 29192 lightweight security standard [25] .  ... 
doi:10.1109/access.2020.3010555 fatcat:y7prf4gyondhdlkohrpcywfbam

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

2019 VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE  
BRIGHT using round constant thwarts attacks like rotational cryptanalysis, self-similarity, invariant attack, related-key attacks, and weak key attacks.  ...  Lightweight security algorithms are tailored for resource-constrained environment.  ...  CHASKEY ciphers is a permutation-based Message Authentication Code (MAC) LBC.  ... 
doi:10.35940/ijitee.i7778.078919 fatcat:4w7yxfomwnaazl63fsb6i3hvcy

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  
The performance of BRIGHT family of lightweight ciphers is evaluated on different parameters.  ...  Lightweight security algorithms are tailored for resource-constrained environment.  ...  We invite researchers for the cryptanalysis of the newly proposed family of BRIGHT cipher.  ... 
doi:10.22266/ijies2019.0831.08 fatcat:54wsflvmyzh2ngdycvftanmlxi

Rotational Cryptanalysis in the Presence of Constants

Tomer Ashur, Yunwen Liu
2016 IACR Transactions on Symmetric Cryptology  
In this paper we investigate how rotational cryptanalysis is affected when constants are injected into the state.  ...  Rotational cryptanalysis is a statistical method for attacking ARX constructions. It was previously shown that ARX-C, i.e., ARX with the injection of constants can be used to implement any function.  ...  algorithm Chaskey [MMVH + 14] .  ... 
doi:10.46586/tosc.v2016.i1.57-70 fatcat:4cl2fdwqsrhs5cbh2xyearvjrm

Efficient Differential Trail Searching Algorithm for ARX Block Ciphers
ARX 구조를 가지는 블록 암호에 대한 효율적인 차분 경로 자동 탐색 알고리즘

Seojin Kim, HyungChul Kang, Deukjo Hong, Jaechul Sung, Seokhie Hong
2016 Journal of the Korea Institute of Information Security and Cryptology  
We use two techniques to optimize the automatic search algorithm of differential trails suggested by Biryukov et al. and obtain 2~3 times faster results than the previous one when implemented in block  ...  "Chaskey: an efficient MAC algorithm for 32-bit microcontrollers," International Workshop on Selected Areas in Cryptography.  ...  Introduction Differential Cryptanalysis is one of the most powerful methods for the analysis of block ciphers.  ... 
doi:10.13089/jkiisc.2016.26.6.1421 fatcat:n2audfnsdjbphchghc6hf3plfe

Rotational Cryptanalysis in the Presence of Constants

Tomer Ashur, Yunwen Liu
2016 IACR Transactions on Symmetric Cryptology  
In this paper we investigate how rotational cryptanalysis is affected when constants are injected into the state.  ...  Rotational cryptanalysis is a statistical method for attacking ARX constructions. It was previously shown that ARX-C, i.e., ARX with the injection of constants can be used to implement any function.  ...  algorithm Chaskey [MMVH + 14] .  ... 
doi:10.13154/tosc.v2016.i1.57-70 dblp:journals/tosc/AshurL16 fatcat:nqsjqjad2jcstmwiglrtbkeifq

MILP-Based Automatic Differential Searches for LEA and HIGHT [article]

Elnaz Bagherzadeh, Zahra Ahmadian
2018 IACR Cryptology ePrint Archive  
We show that the MILP model of the differential property of modular addition with one constant input can be represented with a much less number of linear inequalities compared to the general case.  ...  Some other schemes includes the hash function for short messages SipHash [5] ; MAC algorithms Chaskey [6] , stream ciphers ChaCha [7] and HC-128 [8] and the lightweight block ciphers LEA [9] , FEAL  ...  In this paper we focus on the third technique which has been explicitly applied for automatic search algorithms for cryptanalysis of symmetric ciphers either SPN or ARX structures [19] [20] [21] [22]  ... 
dblp:journals/iacr/BagherzadehA18 fatcat:wixecmw45jhola7pen2ph2pv3a
« Previous Showing results 1 — 15 out of 30 results