Results 61 to 70 of about 6,764 (215)

Cryptanalysis on Two Kinds of Number Theoretic Pseudo‐Random Generators Using Coppersmith Method

open access: yesIET 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

Algebraic Attacks against Some Arithmetization-Oriented Primitives

open access: yesIACR Transactions on Symmetric Cryptology, 2022
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

Constructing Efficient Identity‐Based Signatures on Lattices

open access: yesIET 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

A Method of Ultra-Large-Scale Matrix Inversion Using Block Recursion

open access: yesInformation, 2020
Ultra-large-scale matrix inversion has been applied as the fundamental operation of numerous domains, owing to the growth of big data and matrix applications.
HouZhen Wang, Yan Guo, HuanGuo Zhang
doaj   +1 more source

Further Results of the Cryptographic Properties on the Butterfly Structures

open access: yes, 2016
Recently, a new structure called butterfly introduced by Perrin et at. is attractive for that it has very good cryptographic properties: the differential uniformity is at most equal to 4 and algebraic degree is also very high when exponent $e=3$.
Feng, Xiutao, Fu, Shihui
core   +1 more source

A Fast Search Method for 3‐Share Second‐Order Masking Schemes for Lightweight S‐Boxes

open access: yesIET Information Security, Volume 2025, Issue 1, 2025.
Masking schemes are widely adopted strategies for countering side‐channel analysis (SCA) attacks. The initial hardware masking strategy, threshold implementation (TI), provides robust security against glitches in hardware platforms. The minimum number of shares required for a TI scheme depends not only on the desired security order but also on the ...
Yanhong Fan   +4 more
wiley   +1 more source

Analysing Relations involving small number of Monomials in AES S- Box [PDF]

open access: yes, 2017
In the present day, AES is one the most widely used and most secure Encryption Systems prevailing. So, naturally lots of research work is going on to mount a significant attack on AES.
Ghosal, Riddhi
core   +1 more source

Post‐Quantum Digital Signatures for Enhanced Medical Image Security

open access: yesIET Quantum Communication, Volume 6, Issue 1, January/December 2025.
This study explores the use of Sphincs+, Dilithium, and Falcon to enhance the security of medical images against quantum threats. By leveraging digital signatures for authentication and integrity verification, the proposed approach mitigates risks of tampering and ensures the reliability of healthcare records.
Kumar Sekhar Roy   +5 more
wiley   +1 more source

Preimage attacks on reduced‐round Keccak hash functions by solving algebraic systems

open access: yesIET Information Security, 2023
In this paper, improved preimage attacks are presented on 3‐round Keccak‐256 and Keccak‐512 and 4‐round Keccak‐256 based on algebraic methods. The authors propose some new properties about the components of Keccak permutation, reconsider the existing ...
Junling Pei, Lusheng Chen
doaj   +1 more source

Group theory in cryptography [PDF]

open access: yes, 2010
This paper is a guide for the pure mathematician who would like to know more about cryptography based on group theory. The paper gives a brief overview of the subject, and provides pointers to good textbooks, key research papers and recent survey papers ...
Blackburn, Simon R.   +2 more
core  

Home - About - Disclaimer - Privacy