|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | RECTANGLE: a bit-slice lightweight block cipher suitable for multiple platforms显示文摘In this paper, we propose a new lightweight block cipher named RECTANGLE. The main idea of the design of RECTANGLE is to allow lightweight and fast implementations using bit-slice techniques. RECTANGLE uses an SP-network. The substitution layer consists of 16 4 × 4 S-boxes in parallel. The permutation layer is composed of 3 rotations. As shown in this paper, RECTANGLE offers great performance in both hardware and software environment, which provides enough flexibility for different application scenario. The following are3 main advantages of RECTANGLE. First, RECTANGLE is extremely hardware-friendly. For the 80-bit key version, a one-cycle-per-round parallel implementation only needs 1600 gates for a throughput of 246 Kbits/s at100 k Hz clock and an energy efficiency of 3.0 p J/bit. Second, RECTANGLE achieves a very competitive software speed among the existing lightweight block ciphers due to its bit-slice style. Using 128-bit SSE instructions,a bit-slice implementation of RECTANGLE reaches an average encryption speed of about 3.9 cycles/byte for messages around 3000 bytes. Last but not least, we propose new design criteria for the RECTANGLE S-box.Due to our careful selection of the S-box and the asymmetric design of the permutation layer, RECTANGLE achieves a very good security-performance tradeoff. Our extensive and deep security analysis shows that the highest number of rounds that we can attack, is 18(out of 25). | ZHANG WenTao BAO ZhenZhen LIN DongDai Vincent RIJMEN YANG Bo Han Ingrid VERBAUWHEDE | 2015 | Science China Chemistry2015，58，12： | 22 |
| 2 | Linear hulls with correlation zero and linear cryptanalysis of block ciphers显示文摘 | Andrey Bogdanov Vincent Rijmen | 2014 | Designs Codes and Cryptography2014，，3： | 2 |
| 3 | Linear hulls with correlation zero and linear cryptanalysis of block ciphers显示文摘 | Andrey Bogdanov Vincent Rijmen | 2014 | Designs, Codes and Cryptography2014，，3： | 1 |
| 4 | Impossible meet-in-the-middle fault analysis on the LED lightweight cipher in VANETs显示文摘With the expansion of wireless technology, vehicular ad-hoc networks(VANETs) are emerging as a promising approach for realizing smart cities and addressing many serious traffic problems, such as road safety, convenience, and efficiency. To avoid any possible rancorous attacks, employing lightweight ciphers is most effective for implementing encryption/decryption, message authentication, and digital signatures for the security of the VANETs. Light encryption device(LED) is a lightweight block cipher with two basic keysize variants: LED-64 and LED-128. Since its inception, many fault analysis techniques have focused on provoking faults in the last four rounds to derive the 64-bit and 128-bit secret keys. It is vital to investigate whether injecting faults into a prior round enables breakage of the LED. This study presents a novel impossible meet-in-the-middle fault analysis on a prior round. A detailed analysis of the expected number of faults is used to uniquely determine the secret key. It is based on the propagation of truncated differentials and is surprisingly reminiscent of the computation of the complexity of a rectangle attack. It shows that the impossible meet-in-the-middle fault analysis could successfully break the LED by fault injections. | Wei LI Vincent RIJMEN Zhi TAO Qingju WANG Hua CHEN Yunwen LIU Chaoyun LI Ya LIU | 2018 | Science China(Information Sciences)2018，61，3： | 1 |
| 5 | The Block Cipher Square显示文摘 | Joan Daemen Lars Knudsen Vincent Rijmen | | 0，，： | 1 |
| 6 | AES proposal:Rijndael显示文摘 | Joan Daemen Vincent Rijmen | 1999 | The Rijn-dael Block Cipher1999，39，： | 1 |
| 7 | Using normal bases for compact hardware implementations of the AES S-box 显示文摘 | Svetla Nikova Vincent Rijmen Martin Schlaffer | 2008 | Lecture Notes in Computer Science2008，5229，： | 1 |
| 8 | AES Proposal:Rijndael显示文摘 | Joan Daemen Vincent Rijmen | 1999 | Document Version1999，，6： | 1 |
| 9 | The Design of Rijindael : AES - the Advanced Eneryption Standard 显示文摘 | Joan Daemen Vincent Rijmen | 2003 | Springer Verlag2003，，： | 1 |
| 10 | The Block Cipher Square 显示文摘 | Lars Knudsen Vincent Rijmen | 1997 | Fast Software Encryption1997，1267，： | 1 |
| 11 | Linear hulls with correlation zero and linear cryptanalysis of block ciphers显示文摘 | Andrey Bogdanov Vincent Rijmen | 2014 | Designs Codes and Cryptography2014，，3： | 1 |
| 12 | WARX: efficient white-box block cipher based on ARX primitives and random MDS matrix显示文摘White-box cryptography aims to provide secure cryptographic primitives and implementations for the white-box attack model, which assumes that an adversary has full access to the implementation of the cryptographic algorithms. Real-world applications require highly efficient and secure white-box schemes,whereas the existing proposals cannot meet this demand. In this paper, we design a new white-box block cipher based on addition/rotation/XOR(ARX) primitives and random maximal distance separable(MDS)matrix, white-box ARX(WARX), aiming for efficient implementations in both black-and white-box models.The implementation of WARX in the black-box model is nine times faster than SPNbox-16 from ASIACRYPT’16, and the implementation in the white-box model is more efficient than SPNbox-16 and WEM from CT-RSA’17. Moreover, the security of WARX in both black-and white-box models is analyzed, which ensures its practical applicability. The design of WARX shows that ARX primitives and random linear layer can improve the efficiency of a white-box block cipher. This article may inspire more provably secure and efficient white-box block ciphers and help to narrow the gap between provably secure white-box schemes from academia and highly applicable schemes in great demand from industry. | Jun LIU Vincent RIJMEN Yupu HU Jie CHEN Baocang WANG | 2022 | Science China(Information Sciences)2022，65，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员