|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 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 | Survey on cyberspace security显示文摘Along with the rapid development and wide application of information technology, human society has entered the information era. In this era, people live and work in cyberspace. Cyberspace is the collection of all information systems; it is the information environment for human survival. Therefore, it is necessary to ensure the security of cyberspace. This paper gives a comprehensive introduction to research and development in this field, with a description of existing problems and some currently active research topics in the areas of cyberspace itself, cyberspace security, cryptography, network security, information system security and information content security. | ZHANG HuanGuo HAN WenBao LAI XueJia LIN DongDai MA JianFeng LI JianHua | 2015 | Science China(Information Sciences)2015，58，11： | 15 |
| 3 | Bayesian mechanism for rational secret sharing scheme显示文摘We consider the cooperation of rational parties in secret sharing. We present a new methodology for rational secret sharing both in two-party and multi-party settings based on Bayesian game. Our approach can resolve the impossible solutions to a rational secret sharing model. First, we analyze the 2-out-of-2 rational secret sharing using Bayesian game, which makes us able to consider different classes of the protocol player(for'good' and 'bad' players) and model attributes such as any other parties' preferences and beliefs that may affect the outcome of the game. Thus, the new model makes us able to reason rational secret sharing from the perspective of Bayesian rationality, a notion that may be in some scenarios more appropriate than that defined as per pure rational. According to these analyses, we propose a Bayesian rational protocol of 2-out-of-2 secret sharing. Also, our techniques can be extended to the case of t-out-of-n Bayesian rational secret sharing easily.Our protocol is adopted only by the parties in their decision-making according to beliefs and Bayes rule, without requiring simultaneous channels and can be run over asynchronous networks. | TIAN YouLiang PENG ChangGen LIN DongDai MA JianFeng JIANG Qi JI WenJiang | 2015 | Science China(Information Sciences)2015，58，5： | 9 |
| 4 | Linearization of Multi-Valued Nonlinear Feedback Shift Registers显示文摘Nonlinear feedback shift registers(NFSRs) have been used in many stream ciphers for cryptographic security. The linearization of NFSRs is to describe their state transitions using some matrices. Such matrices are called their state transition matrices. Compared to extensive work on binary NFSRs, much less work has been done on multi-valued NFSRs. This paper uses a semi-tensor product approach to investigate the linearization of multi-valued NFSRs, by viewing them as logical networks. A new state transition matrix is found for a multi-valued NFSR, which can be simply computed from the truth table of its feedback function. The new state transition matrix is easier to compute and is more explicit than the existing results. Some properties of the state transition matrix are provided as well, which are helpful to theoretically analyze multi-valued NFSRs. | WANG Haiyan ZHONG Jianghua LIN Dongdai | 2017 | Journal of Systems Science & Complexity2017，30，2： | 2 |
| 5 | Stability of nonlinear feedback shift registers显示文摘Convolutional codes have been widely used in many applications such as digital video, radio, and mobile communication. Nonlinear feedback shift registers(NFSRs) are the main building blocks in convolutional decoders. A decoding error may result in a succession of further decoding errors. However, a stable NFSR can limit such an error-propagation. This paper studies the stability of NFSRs using a Boolean network approach. A Boolean network is an autonomous system that evolves as an automaton through Boolean functions. An NFSR can be viewed as a Boolean network. Based on its Boolean network representation, some sufficient and necessary conditions are provided for globally(locally) stable NFSRs. To determine the global stability of an NFSR with its stage greater than 1, the Boolean network approach requires lower time complexity of computations than the exhaustive search and the Lyapunov's direct method. | Jianghua ZHONG Dongdai LIN | 2016 | Science China(Information Sciences)2016，59，1： | 2 |
| 6 | On Implementing the Symbolic Preprocessing Function over Boolean Polynomial Rings in Gr?bner Basis Algorithms Using Linear Algebra显示文摘Some techniques using linear algebra was introduced by Faugère in F4 to speed up the reduction process during Gr?bner basis computations.These techniques can also be used in fast implementations of F5 and some other signature-based Gr?bner basis algorithms.When these techniques are applied,a very important step is constructing matrices from critical pairs and existing polynomials by the Symbolic Preprocessing function(given in F4).Since multiplications of monomials and polynomials are involved in the Symbolic Preprocessing function,this step can be very costly when the number of involved polynomials/monomials is huge.In this paper,multiplications of monomials and polynomials for a Boolean polynomial ring are investigated and a specific method of implementing the Symbolic Preprocessing function over Boolean polynomial rings is reported.Many examples have been tested by using this method,and the experimental data shows that the new method is very efficient. | SUN Yao HUANG Zhenyu LIN Dongdai WANG Dingkang | 2016 | Journal of Systems Science & Complexity2016，29，3： | 2 |
| 7 | Improving the Lower Bound on Linear Complexity of the Sequences Generated by Ndnlinear Filtering显示文摘 | ZHANG Yin LIN Dongdai LIU Meicheng | 2012 | Chinese Journal of Electronics2012，21，3： | 1 |
| 8 | A Method for Locating Digital Evidences with Outlier Detection Using Support Vector Machine 显示文摘 | Liu Zaiqiang Lin Dongdai Guo Fengdeng | 2010 | International Journal of Network Security2010，6，3： | 1 |
| 9 | Hierarchical group signature with verifier-local revocation revisited显示文摘Dear editor,Group signature(GS)[1]is a milestone in privacy-oriented cryptography,which provides authentication for messages and keeps signers anonymous.Trolin and Wikstr¨om[2]properly generalized GS into the notion of hierarchical group signature(HGS)and showed its typical usage in building anonymous credit card systems. | Lin HOU Dongdai LIN Renzhang LIU | 2022 | Science China(Information Sciences)2022，65，8： | 1 |
| 10 | Speeding Up the GVW Algorithm via a Substituting Method显示文摘The GVW algorithm is an effcient signature-based algorithm for computing Gr?bner bases.In this paper, the authors consider the implementation of the GVW algorithm by using linear algebra,and speed up GVW via a substituting method. As it is well known that, most of the computing time of a Gr?bner basis is spent on reductions of polynomials. Thus, linear algebraic techniques, such as matrix operations, have been used extensively to speed up the implementations. Particularly, one-direction(also called signature-safe) reduction is used in signature-based algorithms, because polynomials(or rows in matrices) with larger signatures can only be reduced by polynomials(rows) with smaller signatures. The authors propose a new method to construct sparser matrices for signature-based algorithms via a substituting method. Speci?cally, instead of only storing the original polynomials in GVW, the authors also record many equivalent but sparser polynomials at the same time. In matrix construction, denser polynomials are substituted by sparser equivalent ones. As the matrices get sparser, they can be eliminated more effciently. Two speci?cal algorithms, Block-GVW and LMGVW, are presented, and their combination is the Sub-GVW algorithm. The correctness of the new proposed method is proved, and the experimental results demonstrate the effciency of this new method. | LI Ting SUN Yao HUANG Zhenyu WANG Dingkang LIN Dongdai | 2019 | Journal of Systems Science & Complexity2019，32，1： | 1 |
| 11 | Constructing parallel long-message signcryption scheme from trapdoor permutation显示文摘A highly practical parallel signcryption scheme named PLSC from trapdoor per- mutations (TDPs for short) was built to perform long messages directly. The new scheme follows the idea “scramble all, and encrypt small”, using some scrambling operation on message m along with the user’s identities, and then passing, in par- allel, small parts of the scrambling result through corresponding TDPs. This design enables the scheme to flexibly perform long messages of arbitrary length while avoid repeatedly invoking TDP operations such as the CBC mode, or verbosely black-box composing symmetric encryption and signcryption, resulting in notice- able practical savings in both message bandwidth and efficiency. Concretely, the signcryption scheme requires exactly one computation of the “receiver’s TDP” (for “encryption”) and one inverse computation of the “sender’s TDP” (for “authentica- tion”), which is of great practical significance in directly performing long messages, since the major bottleneck for many public encryption schemes is the excessive computational overhead of performing TDP operations. Cutting out the verbosely repeated padding, the newly proposed scheme is more efficient than a black-box hybrid scheme. Most importantly, the proposed scheme has been proven to be tightly semantically secure under adaptive chosen ciphertext attacks (IND-CCA2) and to provide integrity of ciphertext (INT-CTXT) as well as non-repudiation in the random oracle model. All of these security guarantees are provided in the full multi-user, insider-security setting. Moreover, though the scheme is designed to perform long messages, it may also be appropriate for settings where it is imprac- tical to perform large block of messages (i.e. extremely low memory environments such as smart cards). | HU ZhenYu LIN DongDai WU WenLing FENG DengGuo | 2007 | Science in China(Series F)2007，50，1： | 1 |
| 12 | Decomposition of nonlinear feedback shift registers based on Boolean networks显示文摘Dear editor,The Boolean network (BN) was introduced by Kauffman [1] to model a genetic network. In such a network, the nodes (genes, proteins, or other molecules) assume only two values, 1 (ON) and 0(OFF), and the interactions between nodes are determined by Boolean functions. Owing to the complexity of nonlinear logical relations, a convenient tool has been lacking until an algebraic framework was developed by Cheng et al.[2]via a semi-tensor product:further,extensive studies on BNs have been performed in the past decade from the pcrspective of system and control,e.g.,the nionography[2]. | Jianghua ZHONG Dongdai LIN | 2019 | Science China(Information Sciences)2019，62，3： | 1 |
| 13 | Making a Higher Hit Ratio Cryptanalytic Time-Memory Trade-Off Attack on Passwords显示文摘 | ZOU JingI LIN Dongdai HAO Chunhui LI Zhenqi WANG Wenhao LU Yao | 2013 | Chinese Journal of Electronics2013，22，4： | 1 |
| 14 | On the Security of Encrypt-and-MAC Paradigm显示文摘 | HU Zhenyu LIN Dongdai WU Wenling FENG Dengguo | 2007 | Chinese Journal of Electronics2007，16，1： | 1 |
| 15 | Six Subfamilies of Implementation-Friendly Barreto-Naehrig Curves显示文摘In this paper, we depict in detail six subfamilies of implementation-friendly Barreto-Naehrig(BN)elliptic curves by choosing six special congruency classes of the curve-finding search parameter. These curves have small curve constants, support efficient tower extension options of finite field required in fast pairing implementation and have obvious generators for the bilinear cycle group G1. The detailed description will supply the implementor with more choices of suitable BN curves. | CHEN Shan ZHANG Xusheng WANG Kunpeng LIN Dongdai | 2014 | Chinese Journal of Electronics2014，23，1： | 1 |
| 16 | Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme显示文摘In this paper, we first review the existing proofs of the Boneh-Franklin identity-based encryption scheme (BF-IBE for short), and show how to admit a new proof by slightly modifying the specifications of the hash functions of the original BF-IBE. Compared with prior proofs, our new proof provides a tighter security reduction and minimizes the use of random oracles, thus indicates BF-IBE has better provable security with our new choices of hash functions. The techniques developed in our proof can also be applied to improving security analysis of some other IBE schemes. As an independent technical contribution, we also give a rigorous proof of the Fujisaki-Okamoto (FO) transformation in the case of CPA-to-CCA, which demonstrates the efficiency of the FO-transformation (CPA-to-CCA), in terms of the tightness of security reduction, has long been underestimated. This result can remarkably benefit the security proofs of encryption schemes using the FO-transformation for CPA-to-CCA enhancement. | CHEN Yu CHEN LiQun LIN DongDai | 2013 | Science China Mathematics2013，56，7： | 1 |
| 17 | Improved conditional differential attacks on lightweight hash family QUARK显示文摘Nonlinear feedback shift register(NFSR)is one of the most important cryptographic primitives in lightweight cryptography.At ASIACRYPT 2010,Knellwolf et al.proposed conditional differential attack to perform a cryptanalysis on NFSR-based cryptosystems.The main idea of conditional differential attack is to restrain the propagation of the difference and obtain a detectable bias of the difference of the output bit.QUARK is a lightweight hash function family which is designed by Aumasson et al.at CHES 2010.Then the extended version of QUARK was published in Journal of Cryptology 2013.In this paper,we propose an improved conditional differential attack on QUARK.One improvement is that we propose a method to select the input difference.We could obtain a set of good input differences by this method.Another improvement is that we propose an automatic condition imposing algorithm to deal with the complicated conditions efficiently and easily.It is shown that with the improved conditional differential attack on QUARK,we can detect the bias of output difference at a higher round of QUARK.Compared to the current literature,we find a distinguisher of U-QUARK/D-QUARK/S-QUARK/C-QUARK up to 157/171/292/460 rounds with increasing 2/5/33/8 rounds respectively.We have performed the attacks on each instance of QUARK on a 3.30 GHz Intel Core i5 CPU,and all these attacks take practical complexities which have been fully verified by our experiments.As far as we know,all of these results have been the best thus far. | Xiaojuan Lu Bohan Li Meicheng Liu Dongdai Lin | 2022 | Cybersecurity2022，5，3： | 0 |
| 18 | Analyzing Boolean Functions via Solving Parametric Polynomial Systems显示文摘In this paper,a new method to analyze Boolean functions is proposed.By this method,one can analyze the balancedness,the nonlinearity,and the input-output correlation of vectorial Boolean functions.The basic idea of this method is to compute the refined covers of some parametric Boolean polynomial systems which are equivalent to these problems.By a refined cover,the parameter space is divided into several disjoint components,and on each component,the parametric Boolean polynomial system has a fixed number of solutions.An efficient algorithm based on the characteristic set method to compute refined covers of parametric Boolean polynomial systems is presented.The experimental results about some instances generated from cryptanalysis show that this new method is efficient and can solve some instances which can not be solved in reasonable time by other methods. | HUANG Zhenyu SUN Yao LIN Dongdai | 2021 | Journal of Systems Science & Complexity2021，34，2： | 0 |
| 19 | A Note on Rotation Symmetric S-boxes显示文摘This paper is twofold. The first is devoted to study a class of quadratic rotation symmetric S-boxes(RSSBs) which was presented by Gao G, et al., Constructions of quadratic and cubic rotation symmetric bent functions, IEEE Transactions on Information Theory, vol. 58, no. 7, pp. 4908 –4913, 2012, by decomposing a class of cubic rotation symmetric bent functions. The authors obtain its nonlinearity and differential uniformity of such class of S-boxes. In particular, the compositional inversion of the class of rotation symmetric S-boxes is also presented. Then the authors introduce a steepest-descent-like search algorithm for the generation of RSSBs. The algorithm finds 5,6,7,8-bit RSSBs with very good cryptographic properties which can be applied in designing cryptographical algorithms. | GAO Guangpu LIN Dongdai LIU Wenfen | 2019 | Journal of Systems Science & Complexity2019，32，5： | 0 |
| 20 | Algebraic-Differential Attacks on a Family of Arithmetization-Oriented Symmetric Ciphers显示文摘Motivated by applications in advanced cryptographic protocols,research on arithmetizationoriented symmetric primitives has been rising in the field of symmetric cryptography in recent years.In this paper,the authors focus on on the collision attacks for a family of arithmetization-oriented symmetric ciphers GMiMCHash.The authors firstly enhance the algebraically controlled differential attacks proposed by introducing more variables.Then,combining algebraic attacks and differential attacks,the authors propose algebraic-differential attacks on GMi MCHash.This attack method is shown to be effective by experiments on toy versions of GMi MCHash.The authors further introduce some tricks to reduce the complexities of algebraic-differential attacks and improve the success probability of finding collisions. | LI Zhengnan WU Baofeng LIN Dongdai | 2023 | Journal of Systems Science & Complexity2023，36，6： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员