Results 111 to 120 of about 2,395 (159)
Some of the next articles are maybe not open access.
2020 IEEE-HYDCON, 2020
Most of the current symmetric cryptographic algorithms are deterministic algorithms, i.e., for a given plain text and key mix, the encryption dependably results in the same cipher-text. The attacker can misuse this deterministic nature of symmetric block encryption algorithms by carrying cryptanalysis.
V Valli Kumari +2 more
openaire +1 more source
Most of the current symmetric cryptographic algorithms are deterministic algorithms, i.e., for a given plain text and key mix, the encryption dependably results in the same cipher-text. The attacker can misuse this deterministic nature of symmetric block encryption algorithms by carrying cryptanalysis.
V Valli Kumari +2 more
openaire +1 more source
2002
We did not design Rijndael from scratch. In fact, prior to the design of Rijndael, we had already published three block ciphers that are similar to Rijndael. Each of these ciphers inherits properties from its predecessor and enriches them with new ideas.
Joan Daemen, Vincent Rijmen
openaire +1 more source
We did not design Rijndael from scratch. In fact, prior to the design of Rijndael, we had already published three block ciphers that are similar to Rijndael. Each of these ciphers inherits properties from its predecessor and enriches them with new ideas.
Joan Daemen, Vincent Rijmen
openaire +1 more source
2011
A block cipher on its own is rather limited.It takes a b-bit string and outputs a b-bit string under the action of a secret key. But what happens when the message we wish to encrypt is 37 bits long and is too small to fill an entire block? What happens if the message is too long for a single block?
Lars R. Knudsen, Matthew J. B. Robshaw
openaire +1 more source
A block cipher on its own is rather limited.It takes a b-bit string and outputs a b-bit string under the action of a secret key. But what happens when the message we wish to encrypt is 37 bits long and is too small to fill an entire block? What happens if the message is too long for a single block?
Lars R. Knudsen, Matthew J. B. Robshaw
openaire +1 more source
Proceedings of the Twenty-First National Radio Science Conference, 2004. NRSC 2004., 2004
This paper presents a new block cipher (KAMKAR 1.0). It uses a structure that resembles that of the famous cipher Rijndael [Joan Daeman et al., (1999), Brain Gladman, (2003)] chosen as advanced encryption standard (AES) in October 2000. The difference between the two ciphers is that in our proposal the encryption process is made more key-dependent in ...
H.M. Elkamchouchi, M.A. Makar
openaire +1 more source
This paper presents a new block cipher (KAMKAR 1.0). It uses a structure that resembles that of the famous cipher Rijndael [Joan Daeman et al., (1999), Brain Gladman, (2003)] chosen as advanced encryption standard (AES) in October 2000. The difference between the two ciphers is that in our proposal the encryption process is made more key-dependent in ...
H.M. Elkamchouchi, M.A. Makar
openaire +1 more source
1999
This paper considers modern secret-key block ciphers. The theory behind the design and analysis of modern block ciphers is explained, and the most important known attacks are outlined. Finally the Advanced Encryption Standard is discussed.
openaire +1 more source
This paper considers modern secret-key block ciphers. The theory behind the design and analysis of modern block ciphers is explained, and the most important known attacks are outlined. Finally the Advanced Encryption Standard is discussed.
openaire +1 more source
2012
Differential Fault Analysis (DFA) was one of the earliest techniques invented to attack block ciphers by provoking a computational error. In the basic DFA scenario the adversary obtains a pair of ciphertexts both of which encrypt the same plaintext.
openaire +2 more sources
Differential Fault Analysis (DFA) was one of the earliest techniques invented to attack block ciphers by provoking a computational error. In the basic DFA scenario the adversary obtains a pair of ciphertexts both of which encrypt the same plaintext.
openaire +2 more sources
Enhanced Block Playfair Cipher
2013In this paper we will enhance the traditional Blick Playfair Cipher by encrypting the plaintext in blocks. For each block the keyword would be the same but the matrix will shift by some random value. As a result of which the diagram analysis would be very difficult which is done in the traditional Playfair Cipher to obtain the plaintext from the cipher
Arvind Kumar +3 more
openaire +1 more source
2010
For much of human history, cryptography has generally been a stream-based concept: for example, a general writes down a note, and a soldier encrypts it letter-by-letter to be sent on. As written language is based on letters and symbols, it is natural that our initial designs for encryption and decryption algorithms operate on individual symbols ...
openaire +1 more source
For much of human history, cryptography has generally been a stream-based concept: for example, a general writes down a note, and a soldier encrypts it letter-by-letter to be sent on. As written language is based on letters and symbols, it is natural that our initial designs for encryption and decryption algorithms operate on individual symbols ...
openaire +1 more source
2000
In this paper we present a new 96-bit block cipher called BKSQ. The cipher can be implemented efficiently on a wide range of processors (including smartcards) and in hardware.
Joan Daemen, Vincent Rijmen
openaire +1 more source
In this paper we present a new 96-bit block cipher called BKSQ. The cipher can be implemented efficiently on a wide range of processors (including smartcards) and in hardware.
Joan Daemen, Vincent Rijmen
openaire +1 more source
2004
In this paper, we propose a 128-bit block cipher ARIA which is an involution substitution and permutation encryption network(SPN). We use the same S-boxes as Rijndael to eliminate defects which are caused by a totally involution structure. In the diffusion layer of ARIA, a 16× 16 binary matrix of the maximum branch number 8 is used to avoid some ...
Daesung Kwon +12 more
openaire +1 more source
In this paper, we propose a 128-bit block cipher ARIA which is an involution substitution and permutation encryption network(SPN). We use the same S-boxes as Rijndael to eliminate defects which are caused by a totally involution structure. In the diffusion layer of ARIA, a 16× 16 binary matrix of the maximum branch number 8 is used to avoid some ...
Daesung Kwon +12 more
openaire +1 more source