Results 41 to 50 of about 458 (184)
Transformation Method for Solving System of Boolean Algebraic Equations
In recent years, various methods and directions for solving a system of Boolean algebraic equations have been invented, and now they are being very actively investigated. One of these directions is the method of transforming a system of Boolean algebraic
Dostonjon Barotov +6 more
doaj +1 more source
Algebraic fault attack on PRESENT
A new fault analysis method on PRESENT—algebraic fault attack was proposed.This attack combined conventional algebraic cryptanalysis with fault attack,firstly built equivalent Boolean algebraic equations of cipher encryption by algebraic cryptanalysis ...
Ke-hui WU +4 more
doaj +2 more sources
Short expressions of permutations as products and cryptanalysis of the Algebraic Eraser [PDF]
On March 2004, Anshel, Anshel, Goldfeld, and Lemieux introduced the \emph{Algebraic Eraser} scheme for key agreement over an insecure channel, using a novel hybrid of infinite and finite noncommutative groups. They also introduced the \emph{Colored Burau Key Agreement Protocol (CBKAP)}, a concrete realization of this scheme.
Arkadius Kalka +2 more
openalex +4 more sources
Generic Quantum‐Safe IIoT Forensics Framework (QS‐IIoT‐F) ABSTRACT The continuous evolution of quantum computing has shown novel and transformative possibilities and critical implications for the Industrial Internet of Things (IIoT) forensic processes.
Victor R. Kebande
wiley +1 more source
Cryptanalysis of ARX-based White-box Implementations
At CRYPTO’22, Ranea, Vandersmissen, and Preneel proposed a new way to design white-box implementations of ARX-based ciphers using so-called implicit functions and quadratic-affine encodings. They suggest the Speck block-cipher as an example target.
Alex Biryukov +2 more
doaj +1 more source
This paper proposes a DNA‐Dynamic Concurrent Permutation‐Diffusion Algorithm (DNA‐DCP‐DA) for secure image encryption, employing novel scaling chaotification models and advanced noncommutative DNA operations to address weaknesses in existing systems.
Mustafa Kamil Khairullah +5 more
wiley +1 more source
A New Method for Constructing Integral‐Resistance Matrix for 5‐Round AES
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
Cryptanalysis on Two Kinds of Number Theoretic Pseudo‐Random Generators Using Coppersmith Method
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
Improved Integral Attack on Reduced-Round Simeck
Simeck, a family of lightweight block ciphers utilizing Simon-like structure, is widely used under resource constrained environment. So far, many cryptanalysis methods have been used to attack Simeck.
Hang Li, Jiongjiong Ren, Shaozhen Chen
doaj +1 more source
Algebraic Attacks against Some Arithmetization-Oriented Primitives
Recent advanced Zero-Knowledge protocols, along with other high-level constructions such as Multi-Party Computations (MPC), have highlighted the need for a new type of symmetric primitives that are not optimized for speed on the usual platforms (desktop
Augustin Bariant +3 more
doaj +1 more source

