Results 71 to 80 of about 6,665 (199)
Folding Alternant and Goppa Codes with Non-Trivial Automorphism Groups [PDF]
, 2014 The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus on subclasses of alternant/Goppa codes with a non trivial automorphism group. Such codes display
de Portzamparc, Frédéric +4 more
core +2 more sources
A New Method for Constructing Integral‐Resistance Matrix for 5‐Round AES
IET Information Security, Volume 2025, Issue 1, 2025.A powerful theory for evaluating block ciphers against integral distinguishers was introduced by Hebborn et al. at ASIACRYPT 2021. To show the integral‐resistance property for a block cipher, their core idea is to construct a full‐rank integral‐resistance matrix. However, their method does not work practically for 5‐round AES due to the large S‐box and
Fanyang Zeng, Tian Tian, Qichun Wang
wiley +1 more source
Algebraic Precomputations in Differential Cryptanalysis
, 2010 Algebraic cryptanalysis is a general tool which permits one to assess the security of a wide range of cryptographic schemes. Algebraic techniques have been successfully applied against a number of multivariate schemes and stream ciphers. Yet, their feasibility against block ciphers remains the source of much speculation.
Albrecht, Martin +4 more
openaire +14 more sources
A new method to solve MRHS equation systems and its connection to group factorization
Journal of Mathematical Cryptology, 2013 Multiple right-hand side (MRHS) equations over finite fields are a relatively new tool useful for algebraic cryptanalysis. The main advantage is in an efficient representation of the cryptographic primitives.
Zajac Pavol
doaj +1 more source
Polynomial-Time Key Recovery Attack on the Faure-Loidreau Scheme based on Gabidulin Codes
, 2017 Encryption schemes based on the rank metric lead to small public key sizes of order of few thousands bytes which represents a very attractive feature compared to Hamming metric-based encryption schemes where public key sizes are of order of hundreds of ...
Gaborit, Philippe +2 more
core +3 more sources
Cryptanalysis on Two Kinds of Number Theoretic Pseudo‐Random Generators Using Coppersmith Method
IET Information Security, Volume 2025, Issue 1, 2025.Pseudo‐random number generator (PRNG) is a type of algorithm that generates a sequence of random numbers using a mathematical formula, which is widely used in computer science, such as simulation, modeling applications, data encryption, et cetera. The efficiency and security of PRNG are closely related to its output bits at each iteration.
Ran Zhang +4 more
wiley +1 more source
Cryptanalysis of Algebraic Verifiable Delay Functions
Verifiable Delay Functions (VDF) are a class of cryptographic primitives aiming to guarantee a minimum computation time, even for an adversary with massive parallel computational power. They are useful in blockchain protocols, and several practical candidates have been proposed based on exponentiation in a large finite field: Sloth++, Veedo, MinRoot ...
Biryukov, Alex +6 more
openaire +1 more source
Algebraic Cryptanalysis of 58-Round SHA-1 [PDF]
, 2007 In 2004, a new attack against SHA-1 has been proposed by a team leaded by Wang [15]. The aim of this article is to sophisticate and improve Wang’s attack by using algebraic techniques. We introduce new notions, namely semi-neutral bit and adjuster and propose then an improved message modification technique based on algebraic techniques.
Sugita, Makoto +3 more
openaire +1 more source
Constructing Efficient Identity‐Based Signatures on Lattices
IET Information Security, Volume 2025, Issue 1, 2025.In this work, we explore the recent developments related to lattice‐based signature and preimage sampling, and specify a compact identity‐based signature (IBS) on an ideal lattice for practical use. Specifically, we first propose an ellipsoid version of the G + G signature scheme (Asiacrypt 2023) that achieves slightly better signature size and higher ...
Huiwen Jia +4 more
wiley +1 more source
Algebraic Cryptanalysis of Ascon Using MRHS Equations
Tatra Mountains Mathematical PublicationsAbstract Ascon is a family of lightweight authenticated encryption and hashing algorithms, which is a finalist in the NIST Lightweight Cryptography competition. We study the Ascon algorithm from the perspective of algebraic cryptanalysis based on the MRHS representation of the cipher. We call such an approach an MRHS cryptanalysis.
Smičík, Miloslav, Zajac, Pavol
openaire +2 more sources