Results 21 to 30 of about 17,540 (147)

S-Box on Subgroup of Galois Field

Cryptography, 2019
In substitution−permutation network as a cryptosystem, substitution boxes play the role of the only nonlinear part. It would be easy for adversaries to compromise the security of the system without them.
Tariq Shah, Ayesha Qureshi
doaj   +1 more source

Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers [PDF]

, 2004
Recently proposed algebraic attacks [2,6] and fast algebraic attacks [1,5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exponential in the degree of the equations. Fast algebraic attacks were introduced [5] as a way of reducing run-time complexity by reducing the degree of the system of equations ...
Philip Hawkes, Gregory G. Rose
openaire   +1 more source

Decoding the Tensor Product of MLD Codes and Applications for Code Cryptosystems

Моделирование и анализ информационных систем, 2017
For the practical application of code cryptosystems such as McEliece, it is necessary that the code used in the cryptosystem should have a fast decoding algorithm.
Vladimir Mikhailovich Deundyak, Yury Vladimirovich Kosolapov, Evgeniy Andreevich Leluk   +2 more
doaj   +1 more source

Some results on fast algebraic attacks and higher-order non-linearities

IET Information Security, 2012
In this study, the authors investigate the resistance of Boolean functions against fast algebraic attacks and deduce a bound between fast algebraic immunity and higher-order non-linearity (it is the first time that a bound between these two cryptographic criteria is given).
Q. Wang, T. Johansson, H. Kan
openaire   +1 more source

Improving Fast Algebraic Attacks [PDF]

, 2004
An algebraic attack is a method for cryptanalysis which is based on finding and solving a system of nonlinear equations. Recently, algebraic attacks where found helpful in cryptanalysing LFSR-based stream ciphers. The efficiency of these attacks greatly depends on the degree of the nonlinear equations.
openaire   +2 more sources

Homomorphic encryption and some black box attacks

, 2020
This paper is a compressed summary of some principal definitions and concepts in the approach to the black box algebra being developed by the authors. We suggest that black box algebra could be useful in cryptanalysis of homomorphic encryption schemes ...
A Acar, A Borovik, A Borovik, C Aguilar-Melchor, C Fontaine, C Gentry, D Boneh, HW Lenstra Jr, U Maurer, V Arvind, WM Kantor   +10 more
core   +1 more source

MV3: A new word based stream cipher using rapid mixing and revolving buffers [PDF]

, 2006
MV3 is a new word based stream cipher for encrypting long streams of data. A direct adaptation of a byte based cipher such as RC4 into a 32- or 64-bit word version will obviously need vast amounts of memory. This scaling issue necessitates a look for new
A. Biryukov, A. Klimov, A. Klimov, B. Schneier, D. Coppersmith, D. Gillman, D. Jao, I. Mantin, I. Mironov, J. Golić, L. Knudsen, N. Alon, P. Rogaway, S. Halevi, S. Hoory   +14 more
core   +3 more sources

A Smart Approach for GPT Cryptosystem Based on Rank Codes

, 2010
The concept of Public- key cryptosystem was innovated by McEliece's cryptosystem. The public key cryptosystem based on rank codes was presented in 1991 by Gabidulin -Paramonov-Trejtakov(GPT).
Gabidulin, Ernst M., Honary, Bahram, Rashwan, Haitham   +2 more
core   +1 more source

Roadmap on optical security [PDF]

, 2016
Postprint (author's final ...
Javidi, Bahram, Millán Garcia-Varela, M. Sagrario, Pérez Cabré, Elisabet   +2 more
core   +2 more sources

Fast Algebraic Attacks on Stream Ciphers with Linear Feedback [PDF]

, 2003
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attacks, that can be seen as solving a system of multivariate linear equations, true with some probability.
openaire   +1 more source