Entity

Time filter

Source Type


Wu K.-H.,Ordnance Engineering College | Zhao X.-J.,Ordnance Engineering College | Wang T.,Ordnance Engineering College | Guo S.-Z.,The Institute of North Electronic Equipment | Liu H.-Y.,Ordnance Engineering College
Tongxin Xuebao/Journal on Communications | Year: 2012

A new fault analysis method on PRESENT-algebraic fault attack was proposed. This attack combined conventional algebraic cryptanalysis with fault attack, firstly built equivalent Boolean algebraic equations of cipher encryption by algebraic cryptanalysis method; secondly got information of fault cryptograph by fault attack technique, and transformed differential of fault and cryptograph into additional algebraic equations; finally utilized Crypto Mini SAT solver to solve the equations and recover key. Experiments demonstrate that after injecting 4-bit fault to the 29 th round of PRESENT-80, the fault location and fault value are unknown, only 2 injectings can recover 64-bit last whitening key in 50 seconds that reduce master key of PRESENT-80 searching space to 2 16, then recover the master key after 1 minute brute-force-search on average; compared with previous fault attack on PRESENT, the amount of this attack sample is the smallest; meanwhile, the analysis method proposed can be applied into the algebraic fault attack of other block ciphers. Source


Ji K.-K.,Ordnance Engineering College | Wang T.,Ordnance Engineering College | Guo S.-Z.,The Institute of North Electronic Equipment | Zhao X.-J.,Ordnance Engineering College | Liu H.-Y.,Ordnance Engineering College
Tongxin Xuebao/Journal on Communications | Year: 2013

The security of LED against the algebraic side-channel attack (ASCA) was evaluated, which is a lightweight block cipher proposed in CHES 2011. Firstly, the attack model of ASCA was analyzed, and then the design and algebraic representations of LED were described. Secondly, the power leakages of LED on ATMEGA324P microcontroller were measured by a digital oscilloscope; some leakage points with obvious power patterns were chosen as the targeted points and used to deduce the Hamming weight via computing the Pearson correlation factor; satisfiability-based, Pseudo-Boolean optimization-based, linear programming-based methods were used to representing Hamming weights with algebraic equations. Finally, the CryptoMinisat and the SCIP solver were applied to solve for the key and many attacks are conducted under different scenarios. Experiment results demonstrate that LED is vulnerable to ASCA, full 64 bit master key can be derived via analyzing the HW leakages of the first round in LED. Source


Zhao X.-J.,Ordnance Engineering College | Wang T.,Ordnance Engineering College | Guo S.-Z.,The Institute of North Electronic Equipment
Jisuanji Xuebao/Chinese Journal of Computers | Year: 2011

The S-box lookup is an important operation in block cipher design, and is also an effective part to prevent traditional linear and differential attacks, however, when the physical implementation of the algorithm is considered, it becomes the weakest part of cryptosystems. This paper studies fault attacks on block ciphers with S-box, and presents an improved differential fault analysis method on Camellia. Firstly, it summarizes the differential fault analysis on block cipher with S-box into computing the S-box input and output differential problem, and presents a basic differential fault analysis model and then evolves it into two models for SPN and Feistel structure block ciphers. Secondly, it proposes an improved differential fault analysis method on Camellia, makes the attack complexity analysis, and then verifies it through software simulation. Experiments demonstrate: due to its reversible permutation function and Feistel structure, Camellia is vulnerable to deep differential fault analysis, 16 and 24 faulty ciphertexts are enough to retrieve Camellia-128 and Camellia-192/256 key effectively. Finally, the contradictions between traditional cryptography and implementation attacks are analyzed, the state of the art and future directions of the fault attacks on Block ciphers are discussed. Source


Zhao X.-J.,Ordnance Engineering College | Guo S.-Z.,The Institute of North Electronic Equipment | Wang T.,Ordnance Engineering College | Liu H.-Y.,Ordnance Engineering College
Tongxin Xuebao/Journal on Communications | Year: 2011

An improved Cache trace attack on AES and CLEFIA was proposed by considering Cache miss trace information and S-box misalignment. Current trace driven attacks all assume that the S-box is perfectly aligned in Cache, and it's impossible to recover the whole first round key of AES and CLEFIA under limited key searching space. However, the research demonstrates that the S-box is misaligned in Cache at most cases, by utilizing the Cache miss trace information of the cipher encryption, 200 samples first round analysis and 50 samples last round analysis can reduce 128 bit AES master key searching space to 216 and 1 respectively, 80 samples first round analysis can reduce 128 bit CLEFIA first round key searching space to 216, 220 samples first three rounds analysis can reduce 128 bit CLEFIA master key searching space to 216, all of the attacks above can be finished within 1 second. Source


Li H.,PLA University of Science and Technology | Hu G.,PLA University of Science and Technology | Yang Y.,The Institute of North Electronic Equipment | Lai H.,PLA University of Science and Technology
Jiefangjun Ligong Daxue Xuebao/Journal of PLA University of Science and Technology (Natural Science Edition) | Year: 2013

Botnets pose a steady and growing threat to network security and have become one of the most significant threats to the Internet. Using highly efficient and flexible one-to-many control mechanisms, botnets provide a infrastructure of reserves, management and use of cyber attack capabilities. To meet the instant detection requirements of P2P botnets on high-speed networks, a bot priority sampling based online detection technique was presented. In order to efficiently use as many as possible the limited computing resources and sample packets of suspicious P2P bots, a bot priority classification algorithm and a priority-based sampling algorithm were proposed. Flow information recovering and flow cluster analyzing approaches were used to identify the suspicious P2P bots based on the sampled packets. The experimental evaluation results show that the proposed technique can increase the sampling rates packets from P2P botnets traffic subpopulations and has a good sampling efficiency and P2P bots detection hit rate. Source

Discover hidden collaborations