搜索结果: 1-15 共查到“军事学 key-recovery”相关记录74条 . 查询时间(0.116 秒)
Key recovery attacks on the Legendre PRFs within the birthday bound
PRF Legendre tradeoff
font style='font-size:12px;'>
2019/7/26
We show that Legendre PRF, recently suggested as an MPC-friendly primitive in a prime field ZpZp, admits key recovery attacks of complexity O(p√)O(p) rather than previously assumed O(p)O(p). We also d...
Practical Key-recovery Attacks on Round-Reduced Ketje Jr, Xoodoo-AE and Xoodyak
Conditional Cube Attack Keccak Ketje Jr
font style='font-size:12px;'>
2019/5/9
Conditional cube attack was proposed by Huang et al. at EUROCRYPT 2017 to attack Keccak keyed mode. Inspired by dynamic cube attack, they reduce the degree by appending key bit conditions on the initi...
Revisit Division Property Based Cube Attacks: Key-Recovery or Distinguishing Attacks?
Division property cube attacks MILP Trivium
font style='font-size:12px;'>
2019/4/16
Cube attacks are an important type of key recovery attacks against stream ciphers. In particular, it is shown to be powerful against Trivium-like ciphers. Traditional cube attacks are experimental att...
Deep Neural Network Attribution Methods for Leakage Analysis and Symmetric Key Recovery
Side-Channel Attacks Deep Learning Machine Learning
font style='font-size:12px;'>
2019/2/26
Deep Neural Networks (DNNs) have recently received significant attention in the side-channel community due to their state-of-the-art performance in security testing of embedded systems. However, resea...
A Refinement of “A Key-recovery Attack on 855-round Trivium" From CRYPTO 2018
Trivium Nullification Technique Polynomial Reduction
font style='font-size:12px;'>
2018/11/5
At CRYPTO 2018, we proposed a method to reduce the Boolean polynomial of 855-round Trivium. By multiplying a polynomial reduction factor, the output Boolean polynomial is simplified. Based on this met...
Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities
AES Mixture Differential
font style='font-size:12px;'>
2018/6/5
Determining the security of AES is a central problem in cryptanalysis, but progress in this area had been slow and only a handful of cryptanalytic techniques led to significant advancements. At Eurocr...
Correlation Cube Attacks: From Weak-Key Distinguisher to Key Recovery
cryptanalysis cube attack stream cipher
font style='font-size:12px;'>
2018/3/7
In this paper, we describe a new variant of cube attacks called correlation cube attack. The new attack recovers the secret key of a cryptosystem by exploiting conditional correlation properties betwe...
A Key-recovery Attack on 855-round Trivium
Trivium Nullification Technique Polynomial Reduction
font style='font-size:12px;'>
2018/3/5
In this paper, we propose a key-recovery attack on Trivium reduced to 855 rounds. As the output is a complex Boolean polynomial over secret key and IV bits and it is hard to find the solution of the s...
Number "Not" Used Once - Key Recovery Fault Attacks on LWE Based Lattice Cryptographic Schemes
Lattice based cryptography Digital Signatures post quantum cryptography
font style='font-size:12px;'>
2018/3/5
This paper proposes a simple single bit flip fault attack applicable to several LWE (Learning With Errors Problem) based lattice based schemes like KYBER, NEWHOPE, DILITHIUM and FRODO which were submi...
On Side-Channel Vulnerabilities of Bit Permutations: Key Recovery and Reverse Engineering
side-channel analysis differential plaintext attack SCADPA
font style='font-size:12px;'>
2018/3/5
Lightweight block ciphers rely on simple operations to allow compact implementation. Thanks to its efficiency, bit permutation has emerged as an optimal choice for state-wise diffusion. It can be impl...
Quantum Key-recovery Attack on Feistel Structures
Quantum-CPA Key-recovery Attack Feistel Structure
font style='font-size:12px;'>
2017/12/19
Post-quantum cryptography has attracted much attention from worldwide cryptologists. At Asiacrypt 2017, Leander and May combines Grover and Simon algorithms to quantumly break FX-based block ciphers. ...
New Key Recovery Attacks on Minimal Two-Round Even-Mansour Ciphers
block cipher Even-Mansour ciphers meet-in-the-middle attack
font style='font-size:12px;'>
2017/9/14
Chen et al. proved that two variants of the two-round n-bit Even-Mansour ciphers are secure up to 22n/3 queries against distinguish- ing attacks. These constructions can be regarded as minimal two-rou...
Quantum Key-Recovery on full AEZ
block ciphers quantum cryptography authenticated encryption
font style='font-size:12px;'>
2017/8/10
AEZ is an authenticated encryption algorithm, submitted to the CAESAR competition. It has been selected for the third round of the competition. While some classical analysis on the algorithm have been...
Universal Forgery and Key Recovery Attacks: Application to FKS, FKD and Keyak
FKS FKD
font style='font-size:12px;'>
2017/7/24
In the quantum model, by utilizing the Simon's algorithm, we propose an efficient universal forgery attack to FKS, FKD and Keyak with complexity of O(c)O(c). Moreover, we also propose an efficient key...
Key Recovery: Inert and Public
PKI Blockchain Extraordinary Access
font style='font-size:12px;'>
2017/3/15
We propose a public key infrastructure framework, inspired by modern distributed cryptocurrencies, that allows for tunable key escrow, where the availability of key escrow is only provided under stric...