Results 1 to 10 of about 2,028,418 (131)
New Low-Memory Algebraic Attacks on LowMC in the Picnic Setting
The security of the post-quantum signature scheme Picnic is highly related to the difficulty of recovering the secret key of LowMC from a single plaintext-ciphertext pair.
Fukang Liu +3 more
doaj +3 more sources
In this paper, we propose and evaluate a method for generating key-dependent feedback configurations (KDFC) for $\sigma $ -LFSRs. $\sigma $ -LFSRs with such configurations can be applied to any stream cipher that uses a word-based LFSR.
Subrata Nandi +3 more
doaj +1 more source
A Bound of Fast Algebraic Immunity of Constructions With BPR Using a Four-Disjoint-Part Support
Boolean functions are used for stream cipher ought to be a high fast algebraic immunity (FAI) to effectively against fast algebraic attacks. In the previous research methods, there is no suitable method to gain the FAI of Boolean functions using ...
Kai Xu, Ying Zhang, Jing Wang
doaj +1 more source
Improved Twofish Algorithm: A Digital Image Enciphering Application
With the growth of networks, the Internet of Things (IoT) and new cyber attacks pose threats to privacy and security, secure communication is therefore becoming one of the most crucial concerns.
Tanveer ul Haq +5 more
doaj +1 more source
Hybrid tabu search algorithm for excellent Boolean function
Boolean function in symmetric cryptographic algorithm must satisfy excellent cryptographic criteria to ensure the security of the algorithm.By combining the advantages of tabu search algorithm and hill climbing algorithm, a new heuristic generation ...
Weiqiong WANG +3 more
doaj +2 more sources
A Lower Bound of Fast Algebraic Immunity of a Class of 1-Resilient Boolean Functions
Boolean functions should possess high fast algebraic immunity when used in stream ciphers in order to stand up to fast algebraic attacks. However, in previous research, the fast algebraic immunity of Boolean functions was usually calculated by the ...
Yindong Chen +3 more
doaj +1 more source
Fast Algebraic Immunity of
Boolean functions should possess high fast algebraic immunity (FAI) when it is used in stream ciphers in order to stand up to fast algebraic attacks. However, in previous research, the FAI of Boolean functions was usually calculated by computer.
Yindong Chen +3 more
doaj +1 more source
Constructing Two Classes of Boolean Functions With Good Cryptographic Properties
Wu et al. proposed a generalized Tu-Deng conjecture over $\mathbb {F}_{2^{rm}}\times {\mathbb {F}_{2^{m}}}$ , and constructed Boolean functions with good properties. However the proof of the generalized conjecture is still open.
Yindong Chen +3 more
doaj +1 more source
In this paper, a novel scheme for secure audio transmission is introduced. The novelty of this scheme is that it combines four different techniques for audio encryption in the same scheme which makes it more secure: self-adaptive scrambling, multi ...
Roayat Ismail Abdelfatah
doaj +1 more source
Single Trace Side Channel Analysis on NTRU Implementation
As researches on the quantum computer have progressed immensely, interests in post-quantum cryptography have greatly increased. NTRU is one of the well-known algorithms due to its practical key sizes and fast performance along with the resistance against
Soojung An +4 more
doaj +1 more source

