Results 101 to 110 of about 461 (143)

A novel framework for secure cryptocurrency transactions using quantum crypto guard. [PDF]

PeerJ Comput Sci
Alsayaydeh JAJ, Yusof MF, Yahaya NA, Kovtun V, Herawan SG.   +4 more
europepmc   +1 more source

Conic curve encryption and digital signature based on complex number theory for cybersecurity applications. [PDF]

Sci Rep
Kamal A, El-Kamchochi HA, El-Fahar A, Hagras EAA.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks

IEEE Transactions on Information Theory, 2013
Inspired by the previous work of Tu and Deng, we propose two infinite classes of Boolean functions of 2k variables where k ≥ 2. The first class contains unbalanced functions having high algebraic degree and nonlinearity. The functions in the second one are balanced and have maximal algebraic degree and high nonlinearity (as shown by a lower bound that ...
Deng Tang, Claude Carlet, Xiaohu Tang
openaire   +1 more source

A CLASS OF 1-RESILIENT BOOLEAN FUNCTIONS WITH OPTIMAL ALGEBRAIC IMMUNITY AND GOOD BEHAVIOR AGAINST FAST ALGEBRAIC ATTACKS

International Journal of Foundations of Computer Science, 2014
Recently, Tang, Carlet and Tang presented a combinatorial conjecture about binary strings, allowing proving that all balanced functions in some infinite class they introduced have optimal algebraic immunity. Later, Cohen and Flori completely proved that the conjecture is true.
Tang, Deng, Carlet, Claude, Tang, Xiaohu
openaire   +2 more sources

Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks

2014
Given a Boolean function with n variables, a revised algorithm for computing the algebraic immunity d against conventional algebraic attacks in O(D 2±e ) complexity is described for \(D=\sum _{i = 0}^d {n \choose i}\) and a small e, which corrects and clarifies the most efficient algorithm so far at Eurocrypt 2006.
Lin Jiao, Bin Zhang, Mingsheng Wang
openaire   +1 more source

Establishing Equations: The Complexity of Algebraic and Fast Algebraic Attacks Revisited

2015
Algebraic and fast algebraic attacks have posed serious threats to some deployed LFSR-based stream ciphers. Previous works on this topic focused on reducing the time complexity by lowering the degree of the equations, speeding up the substitution step by Fast Fourier Transform and analysis of Boolean functions exhibiting the optimal algebraic immunity.
Lin Jiao, Bin Zhang, Mingsheng Wang
openaire   +1 more source

Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Yindong, Guo, Fei, Ruan, Jie
openaire   +2 more sources

On the Resistance of Boolean Functions against Fast Algebraic Attacks

2012
Boolean functions with large algebraic immunity resist algebraic attacks to a certain degree, but they may not resist fast algebraic attacks (FAA's). It is necessary to study the resistance of Boolean functions against FAA's. In this paper, we localize the optimal resistance of Boolean functions against FAA's and introduce the concept of e-fast ...
Yusong Du, Fangguo Zhang, Meicheng Liu
openaire   +1 more source

A Note on Fast Algebraic Attacks and Higher Order Nonlinearities

2011
In this note, we deduce a bound between fast algebraic immunity and higher order nonlinearity (it is the first time that a bound between these two cryptographic criteria is given), and find that a Boolean function should have high r-order nonlinearity to resist fast algebraic attacks.
Qichun Wang, Thomas Johansson
openaire   +1 more source