搜索结果: 1-15 共查到“军事学 RECOVERY”相关记录107条 . 查询时间(0.046 秒)
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...
Plaintext Recovery Attacks against XTS Beyond Collisions
XTS Storage encryption Mode of operation
2019/7/17
XTS is an encryption scheme for storage devices standardized by IEEE and NIST. It is based on Rogaway's XEX tweakable block cipher and is known to be secure up to the collisions between the blocks, th...
Forward Integrity and Crash Recovery for Secure Logs
cryptographic protocols computer systems
2019/5/21
Logging is a key mechanism in the security of computer systems. Beyond supporting important forward security properties, it is critical that logging withstands both failures and intentional tampering ...
Practical Key-recovery Attacks on Round-Reduced Ketje Jr, Xoodoo-AE and Xoodyak
Conditional Cube Attack Keccak Ketje Jr
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
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
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...
Non-profiled Mask Recovery: the impact of Independent Component Analysis
Side Channel Analysis Masking Independent Component Analysis
2018/11/13
As one of the most prevalent SCA countermeasures, masking schemes are designed to defeat a broad range of side channel attacks. An attack vector that is suitable for low-order masking schemes is to tr...
Inoue and Minematsu [Cryptology ePrint Archive: Report 2018/1040] presented efficient forgery attacks against OCB2, and Poettering [Cryptology ePrint Archive: Report 2018/1087] presented a distinguish...
A Refinement of “A Key-recovery Attack on 855-round Trivium" From CRYPTO 2018
Trivium Nullification Technique Polynomial Reduction
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...
Data Recovery on Encrypted Databases With k-Nearest Neighbor Query Leakage
Searchable Encryption Encrypted Databases Leakage-Abuse Attacks
2018/8/2
Recent works by Kellaris et al. (CCS’16) and Lacharite et al. (SP’18) demonstrated attacks of data recovery for encrypted databases that support rich queries such as range queries. In this paper, we d...
Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities
AES Mixture Differential
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
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
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
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
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...