This work presents the first third-party cryptanalysis of the full-round Iasta -3 and Iasta -4 instances and further extend the approach to Iasta -5, exploiting the restricted randomness and structured construction of the nonce-dependent affine-layer matrices.
The security of modern block ciphers heavily relies on the cryptographic strength of Substitution boxes (S-boxes), which introduce non-linearity and confusion. While numerous methods for S-box generation exist, there is a continuous pursuit of designs that offer a superior and balanced profile against various cryptanal...
A. Razzaque, Hafiza Zara Mustafa, Dilshad Alghazzawi et al.· PLoS ONE· 0 citations
We present a Differential Fault Attack (DFA) targeting Dasta and Fasta, two stream cipher constructions proposed for efficient Fully Homomorphic Encryption (FHE) schemes. Both designs are inspired by Rasta but modified with an affine layer. Dasta replaces the per-round pseudorandom matrices with a single fixed public m...
R. Radheshwar, Dibyendu Roy, Notan Roy et al.· IEEE Access· 0 citations
We formulate key recovery for the International Data Encryption Algorithm (IDEA) as a quantifier-free bit-vector satisfiability problem. The IDEA is a 64-bit block cipher with a 128-bit key whose round function combines multiplication modulo 2^16+1, addition modulo 2^16, and XOR. The model includes the 25-bit cyclic ke...
Praveen Kumar Gundaram· Journal of Information and C...· 0 citations
Ciphers built on bitwise AND, XOR, and rotation are highly competitive for resource‑constrained Internet of Things devices. A representative example is the SIMON family of lightweight block ciphers, introduced by the U.S. National Security Agency in 2013. Differential‑linear (DL) cryptanalysis of such ciphers comprises...
Guang-Qiu Lv, Yi Zhang· Designs, Codes and Cryptogra...· 0 citations
Schwaemm is a member of the Sparkle-suite, a family of lightweight symmetric cryptographic algorithms that advanced to finalist status in the NIST lightweight cryptography standardization process. In 2023, using differential-linear cryptanalysis, Xiong and Liu presented a practical 4-round distinguisher and a theoretic...
Jiajun Zhou, Zhicheng Xiong, Zhen-Zhen Bao et al.· Cybersecurity· 0 citations
Pseudorandom permutations are ubiquitous in theoretical and applied cryptography. PRPs that offer security even against adversaries making quantum queries are of increasing interest, and used in applications ranging from constructing pseudorandom unitaries to separating SZK from BQP. A successful framework for construc...
G. Alagic, Joseph Carolan, Christian Majenz et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
