Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 4,457 papers for “Block cipher”
2007
1.0 29-Oct-2007 Derived from Security Target, no changes 1.1 07-Nov-2007 Updated Reference to new Version of AES User Guidance Contact information
Cited by 0
Lưu Hồng Dũng, Trang, Nong Phuong · 2023
Cited by 0Open access
Lars R. Knudsen, Gregor Leander · 2025
Cited by 0
Abdel-karim Al Tamimi · 2008
The two main characteristics that identify and differentiate one encryption algorithm from another are its ability to secure the protected data against attacks and its speed and efficiency in doing so. This paper provides a performance comparison between four of the most common encryption algorithms: DES, 3DES, Blowfish and AES (Rijndael). The comparison has been conducted by running several encryption settings to process different sizes of data blocks to evaluate the algorithm's encryption/decryption speed. Simulation has
Cited by 0
Square Joan, Joan Daemen, Lars Knudsen et al. · 2007
. In this paper we present a new 128-bit block cipher called Square. The original design of Square concentrates on the resistance against differential and linear cryptanalysis. However, after the initial design a dedicated attack was mounted that forced us to augment the number of rounds. The goal of this paper is the publication of the resulting cipher for public scrutiny. A C implementation of Square is available that runs at 2.63 MByte/s on a 100 MHz Pentium. Our M68HC05 Smart Card implementation fits in 547 bytes and takes less than 2 msec. (4 MHz Clock). The high degree of parallellism allows hardware implementations in the Gbit/s range today. 1 Introduction In this paper, we propose the block cipher Square. It has a block length and key length of 128 bits. However, its modular design approach allows extensions to higher block lengths in a straightforward way. The cipher has a new selfreciprocal structure, similar to that of Threeway and SHARK [2, 15]. The structure of the ciphe...
Cited by 0
Lars R. Knudsen, Gregor Leander · 2025
Cited by 0
Omar A. Dawood, Abdul Monem S. Rahma, Abdul Mohsen J. Abdul Hossen · International Journal of Computer Network and Information Security · 2015
In the present paper we have proposed a new variant of AES cipher with high level of security and an elegant construction called TIGRIS cipher. The TIGRIS name has been derived from one of the two famous rivers in Iraq. The proposed TIGRIS cipher is a revision for the proposed Euphrates cipher which has already been published. It has been designed with a good coherent structure that is based on solid algebraic and well mathematical opinions. The proposed cipher uses the SPN structure and what is known by the Galois Field GF (2 8 ). It is an iterated cipher that has a conservative design which is easily implemented on both hardware and software. It operates with block size of 128-bits and with three variable key lengths of 128-bits, 192-bits and 256bits in addition to sixteen rounds or multiples of four rounds. The proposed cipher works with good invertible operations' stages and a compact duplicated ciphering key. The Tigris cipher construction strategy includes the adoption of construction a new S-box with high nonlinearity that uses the same routines of the AES-S-box stage but with different modular arithmetic of irreducible polynomial and different affine matrix in addition to the distinct constant vector. The second and the third layers of the proposed model are based on the shifting concept for the confusion and diffusion process with reversible operations. The last layer of the proposed model is the key addition layer that is responsible for the expanding and generating the ciphering key by two directions those of row and column expansion, which are associated with two constant vectors of golden ratio and base nature algorithm as a fixed word to eliminate any weak or semiweak ciphering key.
Cited by 16Open access
Jesse Zaman, Sahar Ali Laskar · 2023
In the communication system, it is an important and essential concept that secret information must be kept secured. Cryptography is a branch of study that deals with message security. A public key cryptosystem RSA is an important mile stone in the field of message communication networks. In today’s modern computerized era where most of the messages are communicated through the internet, it is evident that messages are not in limited access between the sender and the receiver only. Third party, that is, any unauthorized person also may get access to the message communicated through any hostile communication channels like internet, telephone line etc. During the last five decades various types of cryptographic algorithms have emerged to protect the message from intruder. A new concept of public key cryptosystem was introduced by W. Diffie and M. E. Hellman in their revolutionary article. Following this concept, three eminent researchers at MIT Laboratory for Computer Science, Cambridge have designed the RSA algorithm which is the first public key cryptosystem. In this paper, a brief review on the RSA cryptosystem is presented.
Cited by 1
Hussein Ahmad, Al Hassan, Magdy Saeb et al. · 2005
The “PYRAMIDS ” Block Cipher is a symmetric encryption algorithm of a 64, 128, 256-bit plaintext block, that accepts a variable key length of 128, 192, 256 bits. The algorithm is an iterated cipher consisting of repeated applications of simple round transformations with different operations and different sequences in each round.
Cited by 0
Hong Dung Luu · Journal of Science and Technique · 2023
The paper proposes a type of block cipher scheme based on cryptographic hash function and public key cryptography. The scheme proposed here is capable of verifying the origin and integrity of the encrypted message. On the other hand, establishing a shared secret key between the sender/encryptor and the receiver/decryptor can be done for each message separately.
Cited by 0Open access
V. Valli Kumari, B. Dinesh Reddy, K. V. S. V. N. Raju · 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. Different block cipher modes are utilized as a part of an extension to these algorithms to make the resulting Cipher probabilistic in nature. Secure Cipher Block Modes make symmetrical algorithms to execute serially. The proposed cipher block Parallel (CPB) Mode is secure and brings parallelism in the execution of symmetric algorithms. Thereby enables faster encoding of the information blocks on a Multi-processor system framework simultaneously. This paper discusses the design and implementation of cipher block parallel mode in detail, including its security and performance.
Cited by 1
Arvind Kumar, Pawan Singh Mehra, Gagan Gupta et al. · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · 2013
Cited by 8
Joan Daemen, Lars R. Knudsen, Vincent Rijmen · Lecture notes in computer science · 1997
Cited by 693Open access
Phongphun Kijsanayothin, Somnuk Keretho · 2002
We propose a new block cipher called Taros. Taros has a block size of 128 bits and allows a variable-length key up to 1024 bits whereas the Square block can accept key only 128 bits. The cipher is a 6-round non-Feistel network. The proposed cipher is modified from the Square block cipher. The design of Taros concentrates on the resistance against Square attack cryptanalysis.
Cited by 0
Takeshi Shimoyama, Hitoshi Yanami, Keitaro Yokoyama et al. · 2001
Cited by 2
Ronald L. Rivest, M. J. B. Robshaw, Y.L. Yin et al. · 1998
We introduce the RC6 block cipher. RC6 is an evolutionary improvement of RC5, designed to meet the requirements of the Advanced Encryption Standard (AES). Like RC5, RC6 makes essential use of data-dependent rotations. New features of RC6 include the use of four working registers instead of two, and the inclusion of integer multiplication as an additional primitive operation. The use of multiplication greatly increases the diffusion achieved per round, allowing for greater security, fewer rounds, and increased throughput.
Cited by 0
Daesung Kwon, Jaesung Kim, Sangwoo Park et al. · Lecture notes in computer science · 2004
Cited by 138
Takeshi Shimoyama, Hitoshi Yanami, Kazuhito Yokoyama et al. · Lecture notes in computer science · 2002
Cited by 32Open access
Kenji Ohkuma, Hirofumi Muratani, Fumihiko Sano et al. · Lecture notes in computer science · 2001
Cited by 30
Doland, Charles M. · Defense Technical Information Center (DTIC) · 2002
A method is provided for generating a pseudo random sequence of integers, and the method is applied to the encryption of messages. The method uses a key K and a pair of prime numbers p and q, where q=2p+1. According to one aspect of the invention, a sequence of integers is formed. A sequence of bits is then formed from the sequence of integers, e.g., by selecting the least significant bit from each integer value. The sequence of bits is then used to encrypt a message using a selected encryption algorithm such as the XOR algorithm. Since prime numbers p and q can be selected to be larger than key K, the repeating period of the sequence of integers is larger than that permitted by the bit length of K.
Cited by 0