Wenling Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wenling Wu has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
Yafei Zheng
TCA Laboratory, SKLCS, Institute of Software Chinese Academy of Sciences Beijing 100190 People's Republic of China
4 shared publicationsJian Zhang
Chinese Academy of Sciences
3 shared publications- Bin Zhang
Chinese Academy of Sciences
2 shared publications - Huiling Zhang
SKLCS, Institute of Software, Chinese Academy of Sciences
2 shared publications Lei Zhang
Chinese Academy of Sciences
2 shared publications- Li Lin
Chinese Academy of Sciences
2 shared publications
Latest Publications
- 7 February 2021
- Published by Springer Nature
- p. 199-212
A New Non-random Property of 4.5-Round PRINCE
- Open Access
- 1 March 2019
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 13 (2) , 125-132
On the extension and security of key schedule of GOST
A type of simple key schedule especially suitable for lightweight block ciphers is defined as straightforward key schedule in this study. As a typical example, GOST‐type key schedule, which is an extension of the key schedules of Russian Standard GOST and its newly modified version GOST2, is introduced and classified. GOST2 is designed based on the GOST encryption structure with different but the same type of key schedule to overcome the weakness of GOST against self‐similarity properties‐based attacks. However, it has been shown in Fast Software Encryption 2017, the simple change in the key schedule is insufficient to offer 256‐bit security. By constructing an evaluation framework combining self‐similarity properties and meet‐in‐the‐middle attack, properties of GOST‐type key schedules are evaluated, and candidate key schedules are provided in this work. These candidate key schedules are able to provide much better security for GOST and GOST2 ciphers than their original key schedules, and the pre‐existing self‐similarity properties‐based attacks of full round GOST and GOST2 can be avoided. The designers of GOST and GOST2 should have been more cautious choosing the parameters of key schedules. The evaluation framework proposed can be used for reference in the design of other Feistel ciphers with straightforward key schedules.
- 1 March 2019
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 13 (2) , 125-132
Open AccessOn the extension and security of key schedule of GOST
A type of simple key schedule especially suitable for lightweight block ciphers is defined as straightforward key schedule in this study. As a typical example, GOST‐type key schedule, which is an extension of the key schedules of Russian Standard GOST and its newly modified version GOST2, is introduced and classified. GOST2 is designed based on the GOST encryption structure with different but the same type of key schedule to overcome the weakness of GOST against self‐similarity properties‐based attacks. However, it has been shown in Fast Software Encryption 2017, the simple change in the key schedule is insufficient to offer 256‐bit security. By constructing an evaluation framework combining self‐similarity properties and meet‐in‐the‐middle attack, properties of GOST‐type key schedules are evaluated, and candidate key schedules are provided in this work. These candidate key schedules are able to provide much better security for GOST and GOST2 ciphers than their original key schedules, and the pre‐existing self‐similarity properties‐based attacks of full round GOST and GOST2 can be avoided. The designers of GOST and GOST2 should have been more cautious choosing the parameters of key schedules. The evaluation framework proposed can be used for reference in the design of other Feistel ciphers with straightforward key schedules.
- 27 March 2017
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (4) , 721-741
Improved meet-in-the-middle attacks on reduced-round Kalyna-128/256 and Kalyna-256/512
- 27 March 2017
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (4) , 721-741
Improved meet-in-the-middle attacks on reduced-round Kalyna-128/256 and Kalyna-256/512
- 5 November 2016
- Published by Springer Nature
- p. 122-136
Collision Attacks on CAESAR Second-Round Candidate: ELmD
- 5 November 2016
- Published by Springer Nature
- p. 122-136
Collision Attacks on CAESAR Second-Round Candidate: ELmD
- 5 November 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 65-78
Security of SM4 Against (Related-Key) Differential Cryptanalysis
- 5 November 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 65-78
Security of SM4 Against (Related-Key) Differential Cryptanalysis
- 20 July 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 247-267
Automatic Search for Key-Bridging Technique: Applications to LBlock and TWINE
- 20 July 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 247-267
Automatic Search for Key-Bridging Technique: Applications to LBlock and TWINE
- 10 March 2016
- Published by Springer Nature
- p. 297-313
Two Lattice-Based Differential Fault Attacks Against ECDSA with wNAF Algorithm
- 10 March 2016
- Published by Springer Nature
- p. 297-313
Two Lattice-Based Differential Fault Attacks Against ECDSA with wNAF Algorithm
- 10 March 2016
- Published by Springer Nature
- p. 102-118
Integral Attack Against Bit-Oriented Block Ciphers
- 10 March 2016
- Published by Springer Nature
- p. 102-118
Integral Attack Against Bit-Oriented Block Ciphers
- 7 March 2016
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 31 (2) , 317-325
Utilizing Probabilistic Linear Equations in Cube Attacks
- 7 March 2016
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 31 (2) , 317-325
Utilizing Probabilistic Linear Equations in Cube Attacks