Filters








408 Hits in 3.0 sec

Direct Construction of Optimal Rotational-XOR Diffusion Primitives

Zhiyuan Guo, Renzhang Liu, Si Gao, Wenling Wu, Dongdai Lin
2017 IACR Transactions on Symmetric Cryptology  
In this paper, we study the cyclic structure of rotational-XOR diffusion layer, a commonly used diffusion primitive over (  ...  As a core component of SPN block cipher and hash function, diffusion layer is mainly introduced by matrices built from maximum distance separable (MDS) codes.  ...  If M I n,b , n > 4, is a rotational-XOR MDS diffusion layer, |I| ≥ n + 2. 5 Direct Construction of Rotational-XOR MDS Diffusion Layers In this section, we deduce a direct construction of MDS M I 4,b  ... 
doi:10.46586/tosc.v2017.i4.169-187 fatcat:qwqrvskiqfgwlhcdnf3aj2qto4

Direct Construction of Optimal Rotational-XOR Diffusion Primitives

Zhiyuan Guo, Renzhang Liu, Si Gao, Wenling Wu, Dongdai Lin
2017 IACR Transactions on Symmetric Cryptology  
In this paper, we study the cyclic structure of rotational-XOR diffusion layer, a commonly used diffusion primitive over (𝔽b2)n, which consists of only rotation and XOR operations.  ...  To the best of our knowledge, it is the first time that rotational-XOR MDS diffusion layers have been constructed without any auxiliary search.  ...  If M I n,b , n > 4, is a rotational-XOR MDS diffusion layer, |I| ≥ n + 2. 5 Direct Construction of Rotational-XOR MDS Diffusion Layers In this section, we deduce a direct construction of MDS M I 4,b  ... 
doi:10.13154/tosc.v2017.i4.169-187 dblp:journals/tosc/GuoLGWL17 fatcat:yptvjuhubja2ne4yp3htpri4da

FOAM: Searching for Hardware-Optimal SPN Structures and Components with a Fair Comparison [chapter]

Khoongming Khoo, Thomas Peyrin, Axel Y. Poschmann, Huihui Yap
2014 Lecture Notes in Computer Science  
We explore several design strategies, from the geometry of the internal state to the size of the S-box, the field size of the diffusion layer or even the irreducible polynomial defining the finite field  ...  We finally test all possible strategies to provide designers an exhaustive approach in building hardware-friendly cryptographic primitives (according to area or FOAM metrics), also introducing a model  ...  In the direction of fairer comparisons of hardware implementations of cryptographic primitives, Bogdanov et al.  ... 
doi:10.1007/978-3-662-44709-3_24 fatcat:5k5tegzevndqnfbf5niwykbs64

Automatic Search for the Best Trails in ARX: Application to Block Cipher Speck [chapter]

Alex Biryukov, Vesselin Velichkov, Yann Le Corre
2016 Lecture Notes in Computer Science  
Finally, we propose two new ARX primitives with provable bounds against single-trail differential and linear cryptanalysis -a long standing open problem in the area of ARX design.  ...  It is based on a branch-and-bound search strategy, does not use any heuristics and returns optimal results.  ...  Acknowledgments We thank our colleagues from the Laboratory of Algorithmics, Cryptology and Security (LACS) at the University of Luxembourg for the stimulating discus-  ... 
doi:10.1007/978-3-662-52993-5_15 fatcat:y7vyfvhfuvdapmduu6sx3su42u

Design Considerations of Lightweight Block Ciphers for Low-Cost Embedded Devices

2019 International journal of recent technology and engineering  
The internal structure of the proposed design has three layers in which operations are so arranged that it utilizes small code size and has fast diffusion.  ...  Besides, design of newly proposed cipher is such that it thwarts the effect of most of the attacks.  ...  ARX (modular Addition-Rotation-bitwise XOR) designs have even more efficient software implementations.  ... 
doi:10.35940/ijrte.a2140.078219 fatcat:esefvq4t4bez5gfiejqdgfv6he

Optimizing Implementations of Lightweight Building Blocks

Jérémy Jean, Thomas Peyrin, Siang Meng Sim, Jade Tourteaux
2017 IACR Transactions on Symmetric Cryptology  
This phase most notably appears during the ASIC implementation of cryptographic primitives.  ...  For linear permutations, we exhibit several new MDS diffusion matrices lighter than the state-of-the-art, and we also decrease the implementation cost of several already known MDS matrices.  ...  In both cases, we start by improving the implementation cost of the multiplication of the field elements, and we then either construct new lightweight MDS diffusion matrices, or we derive an optimized  ... 
doi:10.46586/tosc.v2017.i4.130-168 fatcat:t7hywlbkfrazpkcrcn634rspiy

Optimizing Implementations of Lightweight Building Blocks

Jérémy Jean, Thomas Peyrin, Siang Meng Sim, Jade Tourteaux
2017 IACR Transactions on Symmetric Cryptology  
This phase most notably appears during the ASIC implementation of cryptographic primitives.  ...  For linear permutations, we exhibit several new MDS diffusion matrices lighter than the state-of-the-art, and we also decrease the implementation cost of several already known MDS matrices.  ...  In both cases, we start by improving the implementation cost of the multiplication of the field elements, and we then either construct new lightweight MDS diffusion matrices, or we derive an optimized  ... 
doi:10.13154/tosc.v2017.i4.130-168 dblp:journals/tosc/JeanPST17 fatcat:gwpxqbtsdzflnkuq4wvd23b3ru

Lightweight MDS Involution Matrices [chapter]

Siang Meng Sim, Khoongming Khoo, Frédérique Oggier, Thomas Peyrin
2015 Lecture Notes in Computer Science  
Compared to the best known matrices, some of our new candidates save up to 50% on the amount of XOR gates required for an hardware implementation.  ...  We also explain why the choice of the irreducible polynomial might have a significant impact on the lightweightness, and in contrary to the classical belief, we show that the Hamming weight has no direct  ...  Using direct construction, there is no clear implication for the choice of the elements αi and βj that will generate lightweight entries cij.  ... 
doi:10.1007/978-3-662-48116-5_23 fatcat:sm3rhkizyrg2hd7qppicvnflcy

Gimli : A Cross-Platform Permutation [chapter]

Daniel J. Bernstein, Stefan Kölbl, Stefan Lucks, Pedro Maat Costa Massolino, Florian Mendel, Kashif Nawaz, Tobias Schneider, Peter Schwabe, François-Xavier Standaert, Yosuke Todo, Benoît Viguier
2017 Lecture Notes in Computer Science  
This paper presents Gimli, a 384-bit permutation designed to achieve high security with high performance across a broad range of platforms, including 64bit Intel/AMD server CPUs, 64-bit and 32bit ARM smartphone  ...  This paper presents Gimli, a 384-bit permutation designed to achieve high security with high performance across a broad range of platforms, including 64-bit Intel/AMD server CPUs, 64-bit and 32bit ARM  ...  The shifted parts of the Tfunction already provide diffusion in both directions, but this diffusion is not quite as fast, since the shifts throw away some bits.  ... 
doi:10.1007/978-3-319-66787-4_15 fatcat:iezmwrpkgfarle7thx4chabixu

Design of Lightweight Linear Diffusion Layers from Near-MDS Matrices

Chaoyun Li, Qingju Wang
2017 IACR Transactions on Symmetric Cryptology  
We present new designs of lightweight linear diffusion layers by constructing lightweight near-MDS matrices. Firstly generic n×n near-MDS circulant matrices are found for 5 ≤ n ≤9.  ...  The proposed matrices, together with previous construction of order less than five, lead to solutions of n×n near-MDS matrices with the lowest XOR count over finite fields F2m for 2 ≤ n ≤ 8 and 4 ≤ m ≤  ...  Acknowledgements The authors would like to thank Bart Preneel and the anonymous reviewers of FSE for their comments and suggestions.  ... 
doi:10.46586/tosc.v2017.i1.129-155 fatcat:vttzixkrvrdxhbmqzonfjjovhu

Design of Lightweight Linear Diffusion Layers from Near-MDS Matrices

Chaoyun Li, Qingju Wang
2017 IACR Transactions on Symmetric Cryptology  
We present new designs of lightweight linear diffusion layers by constructing lightweight near-MDS matrices. Firstly generic n×n near-MDS circulant matrices are found for 5 ≤ n ≤9.  ...  The proposed matrices, together with previous construction of order less than five, lead to solutions of n×n near-MDS matrices with the lowest XOR count over finite fields F2m for 2 ≤ n ≤ 8 and 4 ≤ m ≤  ...  Acknowledgements The authors would like to thank Bart Preneel and the anonymous reviewers of FSE for their comments and suggestions.  ... 
doi:10.13154/tosc.v2017.i1.129-155 dblp:journals/tosc/LiW17 fatcat:gdg5ior3t5dqrnslbmrgtkmzc4

Constructing Lightweight Optimal Diffusion Primitives with Feistel Structure [chapter]

Zhiyuan Guo, Wenling Wu, Si Gao
2016 Lecture Notes in Computer Science  
Without loss of hardware efficiency, a list of softwarefriendly optimal binary matrices can be constructed by Feistel structure with cyclic shift as round functions.  ...  As one of the core components in any SPN block cipher and hash function, diffusion layers are mainly introduced by matrices with maximal branch number.  ...  For example, in the case of 8-bit S-box, the software efficiency of our 16 × 16 optimal diffusion layer on 32-bit processor is weaken since the rotation on a 64-bit word becomes complicated.  ... 
doi:10.1007/978-3-319-31301-6_21 fatcat:ch2dwxfcyndyfduiyejnusck2q

Secure key-alternating Feistel ciphers without key schedule

Yaobin Shen, Hailun Yan, Lei Wang, Xuejia Lai
2020 Science China Information Sciences  
Considering the key schedule from the view of provable security is another direction.  ...  In this study, we optimize the construction by GW and propose a new four-round KAF with an ultra-light (non-existent) key schedule.  ...  Considering the key schedule from the view of provable security is another direction. Chen et al.  ... 
doi:10.1007/s11432-019-9938-0 fatcat:lniab3a5q5fexg3q2563rsi7mq

Energy-Efficient Cryptographic Engineering Paradigm [chapter]

Marine Minier, Raphael C. -W. Phan
2012 Lecture Notes in Computer Science  
We describe an example structure that exemplifies this paradigm and at the end of the paper we ask further research questions for this direction.  ...  We propose the amortization of computations paradigm in the design of cryptographic schemes; this paradigm can be used in line with existing approaches.  ...  /XOR (ARX) constructions rather than multiplications. • amortization of primitives: this approach is essentially in terms of recycling primitives that have already been designed or implemented [13] .  ... 
doi:10.1007/978-3-642-27585-2_7 fatcat:fc4sxrgzpbbiffd7zlxagbiqsi

A 16-Bit Reconfigurable Encryption Processor for p-Cipher

Mohamed El-Hadedy, Hristina Mihajloska, Danilo Gligoroski, Amit Kulkarni, Dirk Stroobandt, Kevin Skadron
2016 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)  
This paper presents an improved hardware implementation of a 16-bit ARX (Add, Rotate, and Xor) engine for one of the CAESAR second-round competition candidates, π-Cipher, implemented on an FPGA. π-Cipher  ...  The functionality of the proposed ARX engine was verified on the Xilinx Virtex-7.  ...  A popular way to construct simple operations and fast cryptographic primitives is the so-called ARX design, where the construction only uses Additions (A B), A Rotations (A ≪ r), and Xors (A ⊕ B).  ... 
doi:10.1109/ipdpsw.2016.27 dblp:conf/ipps/El-HadedyMGKSS16 fatcat:rlhbswfsafen7me34cry5z5cze
« Previous Showing results 1 — 15 out of 408 results