Results 221 to 230 of about 54,307 (258)

A Key-Recovery Attack on 855-round Trivium

Lecture Notes in Computer Science, 2018
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 secret keys, we propose a novel nullification technique of the Boolean polynomial to reduce the output Boolean polynomial of 855-round Trivium.
Xiaoyun Wang, Xiaoyang Dong, Willi Meier   +2 more
exaly   +3 more sources

Key Recovery Attack on a Knapsack Public Key Cryptosystem

2012 Fourth International Conference on Intelligent Networking and Collaborative Systems, 2012
A new knapsack public key cryptosystem is crypt analyzed. The cryptanalytic attack uses the Euclidean algorithm to obtain the greatest common divisor of some integers, and thus recovers the modulus. Then the attack reconstructs the multiplier by solving a linear congruence. Therefore, all the secret keys can be retrieved in polynomial time.
Chunfei Ju, Hui Yuan
openaire   +1 more source

Quantum key-recovery attack on Feistel structures

Science China Information Sciences, 2018
Post-quantum cryptography has drawn considerable attention from cryptologists on a global scale. At Asiacrypt 2017, Leander and May combined Grovers and Simons quantum algorithms to break the FX-based block ciphers, which were introduced by Kilian and Rogaway to strengthen DES.
Xiaoyang Dong 0001, Xiaoyun Wang 0001
openaire   +2 more sources

Key Recovery Attack for ZHFE

2017
At PQCRYPTO 2014, Porras, Baena and Ding introduced ZHFE, an interesting new technique for multivariate post-quantum encryption. The scheme is a generalization of HFE in which a single low degree polynomial in the central map is replaced by a pair of high degree polynomials with a low degree cubic polynomial contained in the ideal they generate.
Daniel Cabarcas, Daniel Smith-Tone, Javier A. Verbel   +2 more
openaire   +1 more source

Partial Key Recovery Attack Against RMAC

Journal of Cryptology, 2005
In this paper new “partial” key recovery attacks against the RMAC block cipher based Message Authentication Code scheme are described. That is we describe attacks that, in some cases, recover one of the two RMAC keys much more efficiently than previously described attacks. Although all attacks, but one, are of no major threat in practice, in some cases
Lars R. Knudsen, Chris J. Mitchell
openaire   +6 more sources

FFT Key Recovery for Integral Attack

2014
An integral attack is one of the most powerful attacks against block ciphers. We propose a new technique for the integral attack called the Fast Fourier Transform FFT key recovery. When the integral distinguisher uses N chosen plaintexts and the guessed key is k bits, a straightforward key recovery requires the time complexity of ON 2 k .
Yosuke Todo, Kazumaro Aoki
openaire   +1 more source

A complete key recovery timing attack on a GPU

2016 IEEE International Symposium on High Performance Computer Architecture (HPCA), 2016
Graphics Processing Units (GPUs) have become mainstream parallel computing devices. They are deployed on diverse platforms, and an increasing number of applications have been moved to GPUs to exploit their massive parallel computational resources.
Zhen Hang Jiang, Yunsi Fei, David R. Kaeli   +2 more
openaire   +1 more source

Improved Linear Key Recovery Attacks on PRESENT

IEEE Transactions on Information Theory
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wenhui Wu, Muzhou Li, Meiqin Wang
openaire   +2 more sources

A Key Recovery Reaction Attack on QC-MDPC

IEEE Transactions on Information Theory, 2019
Algorithms for secure encryption in a post-quantum world are currently receiving a lot of attention in the research community. One of the most promising such algorithms is the code-based scheme called QC-MDPC, which has excellent performance and a small public key size.
Qian Guo 0001, Thomas Johansson 0001, Paul Stankovski Wagner   +2 more
openaire   +1 more source