Results 231 to 240 of about 1,748,823 (282)
Some of the next articles are maybe not open access.

Improved algebraic attacks on lightweight block ciphers

Journal of Cryptographic Engineering, 2020
Duc-Phong Le   +2 more
exaly   +2 more sources

Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks

Information Security Conference, 2014
Given a Boolean function with n variables, a revised algorithm for computing the algebraic immunity d against conventional algebraic attacks in O(D 2±e ) complexity is described for \(D=\sum _{i = 0}^d {n \choose i}\) and a small e, which corrects and clarifies the most efficient algorithm so far at Eurocrypt 2006.
Lin Jiao, Bin Zhang, Mingsheng Wang
openaire   +2 more sources

Revisiting algebraic attacks on MinRank and on the rank decoding problem

Designs, Codes and Cryptography, 2022
The Rank Decoding problem (RD) is at the core of rank-based cryptography. Cryptosystems such as ROLLO and RQC, which made it to the second round of the NIST Post-Quantum Standardization Process, as well as the Durandal signature scheme, rely on it or its
M. Bardet   +4 more
semanticscholar   +1 more source

Improvement of algebraic attacks for solving superdetermined MinRank instances

Post-Quantum Cryptography, 2022
The MinRank (MR) problem is a computational problem that arises in many cryptographic applications. In Verbel et al. [24], the authors introduced a new way to solve superdetermined instances of the MinRank problem, starting from the bilinear Kipnis ...
M. Bardet, Manon Bertin
semanticscholar   +1 more source

A new algebraic attack on DASTA

Journal of High Speed Networks, 2023
As a fully homomorphic encryption friendly symmetric-key primitive, DASTA was invented by Hebborn at Fast Software Encryption 2020. A new fixed linear layer design concept is introduced in the DASTA stream cipher so that its AND depth and the number of ANDs per encrypted bit are quite small.
Haixia Zhao, Keque Li, Yongzhuang Wei
openaire   +1 more source

Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions

open access: yesIEEE Transactions on Information Theory, 2011
In this correspondence, first we give a decomposition of symmetric Boolean functions, then we show that almost all symmetric Boolean functions, including these functions with good algebraic immunity, behave badly against fast algebraic attacks.
Meicheng Liu, Dongdai Lin
exaly   +1 more source

Hardware attacks: an algebraic approach

Journal of Cryptographic Engineering, 2016
Many VLSI chips now contain cryptographic processors to secure their data and external communications. Attackers target the hardware to imitate or understand the system design, to gain access to the system or to obtain encryption keys. They may also try to initiate attacks such as denial of service to disable the services supported by a chip, or reduce
Samer Moein   +2 more
openaire   +1 more source

Improved Interpolation Attacks on Cryptographic Primitives of Low Algebraic Degree [PDF]

open access: yesIACR Cryptology ePrint Archive, 2019
Symmetric cryptographic primitives with low multiplicative complexity have been proposed to improve the performance of emerging applications such as secure Multi-Party Computation. However, primitives composed of round functions with low algebraic degree
Chaoyun Li, B. Preneel
semanticscholar   +2 more sources

A New Variant of Algebraic Attack

2014
Algebraic attack is an important attack strategy against symmetric ciphers, particularly stream ciphers. The most vital issue in this attack is to reduce the degree of the algebraic equations as much as possible in order to obtain a lower time complexity.
Dibyendu Roy 0001   +2 more
openaire   +1 more source

Simplifying algebraic attacks with univariate analysis

2011 Information Theory and Applications Workshop, 2011
The purpose of this paper is to present a more fine-grained view on cryptanalysis of stream ciphers based on LFSRs in terms of the univariate representation and to provide some connections to cyclic codes. A usual way of presenting such ciphers is in terms of multivariate equations over GF(2).
Tor Helleseth, Sondre Rønjom
openaire   +1 more source

Home - About - Disclaimer - Privacy