检索结果-南通市图书馆

LOL: a highly flexible framework for designing stream ciphers

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第9期67卷 62-75页

作者： Dengguo FENG Lin JIAO Yonglin HAO Qunxiong ZHENG Wenling WU wenfeng qi Lei ZHANG Liting ZHANG Siwei SUN Tian TIAN State Key Laboratory of Cryptology PLA Strategic Support Force Information Engineering University Institute of Software Chinese Academy of Sciences Westone Cryptologic Research Center School of Cryptology University of Chinese Academy of Sciences

In this paper, we propose LOL, a general framework for designing blockwise stream ciphers. The proposed framework achieves ultrafast software implementations for ubiquitous virtual networks in 5G/6G environments and high-security levels for post-quantum cryptography. The LOL framework is structurally strong; furthermore, this framework and all its components enjoy high flexibility with various extensions. On the basis of the LOL framework, we propose new stream-cipher designs called LOL-MINI and LOL-DOUBLE with the support of the AES-NI and single instruction multiple data instructions. The former applies the basic LOL single mode, while the latter uses the extended parallel-dual mode. LOL-MINI and LOL-DOUBLE support 256-bit key length. Our thorough evaluations revealed that these cipher designs have 256-bit security margins against all existing cryptanalysis methods, including differential, linear, and integral. The software performances of LOL-MINI and LOL-DOUBLE can reach 89 and 135 Gbps. In addition to pure encryptions,the LOL-MINI and LOL-DOUBLE stream ciphers can be applied in a stream-cipher-then-MAC strategy to make AEAD schemes.

关键词： stream cipher 5G/6G mobile system fast software implementation

A New Method for Searching Cubes and Its Application to 815-Round Trivium

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2023年第5期36卷 2234-2254页

作者： LIU Chen TIAN Tian qi wenfeng PLA Strategic Support Force Information Engineering University Zhengzhou 450001China

The cube attack proposed by Dinur and Shamir is one of the most important key-recovery attacks against *** division property based cube attacks have been extensively studied and significantly *** particular,the MILP modeling technique for the three-subset division property without unknown subset proposed by Hao,et *** EUROCRYPT 2020 and the new technique with nested monomial predictions proposed by Hu,et *** ASIACRYPT 2021 are best techniques to recover exact superpolies in division property based cube ***,at this state of the art,whether a superpoly can be recovered in division property based cube attacks is mainly decided by the scale of the superpoly,that is,the number of *** the choice for proper cubes corresponding to low-complexity superpolies is more critical *** effective cube construction methods were proposed for experimental cube attacks,but not applicable to division property based cube *** this paper,the authors propose a heuristic cube criterion and a cube sieve algorithm,which can be combined with the three-subset division property to recover a number of *** to815-round Trivium,the authors recovered 417 superpolies from 441 cubes obtained by our algorithm of sizes between 41 and *** success rate is 94.56%.There are 165 non-constant superpolies with degree less than *** order to demonstrate the significance of the new algorithm,the authors tested the best superpoly recovery technique at EUROCRYPT 2020 using random cubes of similar sizes on 815-round *** experimental result shows that no cube could be completely recovered within a given period of time because the superpolies for random cubes are too complex.

关键词： Cube attacks division property key-recovery attacks trivium

Differential Fault Attack on the Stream Cipher LIZARD

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2021年第3期30卷 534-541页

作者： MA Zhen TIAN Tian qi wenfeng National Digital Switching System Engineering Technological Research Center

In this paper, we try to give a security evaluation of LIZARD stream cipher in regard to fault attacks, which, to the best of our knowledge, is the first fault analysis on LIZARD. We design a differential engine of LIZARD to track the differential trail of the keystreams. It is shown that the distributions of the keystream differences are heavily biased. Utilizing this characteristic, we propose an improved method to identify the fault location for LIZARD whose success probability approaches 1. Then we use the fault-free keystream and faulty keystreams to generate system of equations in internal state variables and solve it by SAT solver. The result shows that with 100 keystream bits, only 6 different faults are needed to recover the internal state. Finally,the comparison between LIZARD and Grain v1 shows that LIZARD is more resistable than Grain v1 in regard to fault attacks.

关键词： Cryptography Data security Other topics in statistics Other topics in statistics Cryptanalysis stream cipher fault attack SAT solver LIZARD

MILP-Based Linear Attacks on Round-Reduced GIFT

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2022年第1期31卷 89-98页

作者： CUI Yaxin XU Hong qi wenfeng Information Engineering University

GIFT is a lightweight block cipher with an substitution-per mutation-net work（SP N） structure proposed in CHES *** has two different versions whose block sizes are 64 and 128 *** RSA 2019,Zhu et *** some differential characteristics of GIFT with mixed integer linear programming（MILP） method and presented corresponding differential *** this paper,we further find some linear characteristics with MILP *** GIFT-64,we find two 11-round linear characteristics with correlation 2;,and use one of them to present a 16-round linear attack on GIFT-64 by adding4 rounds before and one round after the linear *** GIFT-128,we find a 16-round linear characteristic with correlation 2;.As far as we know,it is the longest linear characteristic found for *** the 16-round linear characteristic,we present a 20-round linear attack on GIFT-128 by adding 2 rounds before and2 rounds after the linear characteristic.

关键词： GIFT-64 MILP-based linear attacks CHES 2017 linear programming public key cryptography mixed integer linear programming method RSA 2019 20-round linear attack lightweight block cipher substitution-permutation-network structure GIFT-128 16-round linear attack integer programming

Non-Existence of One-Byte Active Impossible Differentials for 5-Round AES in the Master-Key Setting

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2023年第3期36卷 1336-1350页

作者： YAN Xueping TAN Lin qi wenfeng PLA Strategic Support Force Information Engineering University Zhengzhou 450000China

Impossible differential cryptanalysis is an important approach to evaluate the security of block ciphers. In EUROCRYPT 2016, Sun, et al. proved that there exists no impossible differential longer than four rounds for the AES structure where S-boxes are arbitrary. In DCC 2019, Wang,et al. proved that any differential is possible for 5-round AES, assuming that the round keys are independent and uniformly random. In ASIACRYPT 2020, Hu, et al. used automatic search to show that there exists no one-byte active impossible differential for 5-round AES-128 considering the relations of 3-round keys. By algebraic methods, this paper theoretically proves that there exists no one-byte active impossible differential for 5-round AES even considering the relations of all round keys. Firstly,the authors prove the independence of ten bytes in the consecutive four round keys under the key schedule of AES-128. Then 5-round AES is decomposed to three subfunctions and the propagations of the considered differences in these subfunctions are discussed. Finally, the authors prove that the considered differential trails can be connected by the ten bytes of round keys. Furthermore, for any given one-byte active differential, there are at least 2^(51) master keys such that the differential is possible for 5-round AES-128.

关键词： AES impossible differential key schedule master-key setting

Finding slid pairs in trivium with MiniSat

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2013年第9期56卷 249-256页

作者： ZENG Wen qi wenfeng Department of Applied Mathematics Zhengzhou Information Science and Technology Institute

A pair of distinct (key, IV) is said to be slidable if they can produce two identical keystreams up to a shift. In this paper, we investigate slid pairs in Trivium. We convert the resulting nonlinear sliding equations into a SAT instance and use MiniSat, a SAT solver, to solve it. We not only find more slid pairs than previous result on slid pair in Trivium but also provide a new method which can treat higher clock-shifts and is much less time-consuming.

关键词： eSTREAM MiniSat stream cipher SAT slid pairs trivium

On Characteristic Functions of De Bruijn Sequences

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2016年第2期25卷 304-311页

作者： TANG Zhenwei qi wenfeng TIAN Tian Department of Applied Mathematics Zhengzhou Information Science and Technology Institute

In 1982, H. Fredricksen presented the upper and lower bounds of the number of ones in the truth table of characteristic functions of de Bruijn sequences. In this paper, the distribution of ones in the truth table of characteristic functions of de Bruijn sequences is further studied. We provide the upper and lower bounds of the number of ones in the partial truth table of characteristic functions of de Bruijn sequences. Furthermore, the two bounds are tight.

关键词： Nonlinear feedback shift registers De Bruijn sequences Weight of the truth table

DISTRIBUTION OF ONE-ERROR LINEAR COMPLEXITY OF BINARY SEQUENCES FOR ARBITRARY PRIME PERIOD

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2012年第6期25卷 1223-1233页

作者： Lin TAN wenfeng qi Hong XU Department of Applied Mathematics Zhengzhou Information Science and Technology Institute

Complexity measures for sequences, such as the linear complexity and the k-error linear complexity, play an important role in stream ciphers. This contribution studies the distribution of 1-error linear complexity of binary sequences with arbitrary prime period. For any odd prime N, the authors present all possible values of 1-error linear complexity of N-periodic binary sequences, and derive the exact formulas to count the number of N-periodic binary sequences with any given 1-error linear complexity.

关键词： k-error linear complexity linear complexity periodic sequences stream ciphers.

A Note on Determine the Greatest Common Subfamily of Two NFSRs by Grbner Basis

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2015年第5期28卷 1231-1242页

作者： WANG Zhongxiao qi wenfeng TIAN Tian Luoyang University of Foreign Language State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute

For nonlinear feedback shift registers(NFSRs), their greatest common subfamily may be not unique. Given two NFSRs, the authors only consider the case that their greatest common subfamily exists and is unique. If the greatest common subfamily is exactly the set of all sequences which can be generated by both of them, the authors can determine it by Grbner basis theory. Otherwise, the authors can determine it under some conditions and partly solve the problem.

关键词： Greatest common subfamily Grbner basis nonlinear feedback shift register stream cipher