Efficient Software Implementation of AES on 32-Bit Platforms

Bertoni, Guido; Breveglieri, Luca; Fragneto, Pasqualina; Macchetti, Marco; Marchesin, Stefano

doi:10.1007/3-540-36400-5_13

Cited by 89 publications

(47 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We had the least available information on Bertoni's idea, according to [1] probably for Bertoni's work had been under patenting process. We therefore gave up making any attempts to optimize implementation based on his idea.…”

Section: Measurement Results-standard-defi Ned Aes Algorithmmentioning

confidence: 99%

“…This approach uses only three smaller tablesSBox, inverse SBox and RCon, therefore consumes signifi cantly less memory [1], but uses multiplication more intensively.…”

Section: Implementation Detailsmentioning

confidence: 99%

“…These implementations are characterized by the high processing speed, which is based on pre-calculated tables, due to which a great deal of memory is used. On the other side, there is a very interesting idea of Bertoni that achieves very good performance with signifi cant decrease in memory usage [1], because the idea is based on a signifi cantly smaller utilization of pre-calculated tables with interim results.…”

Section: Hypothesesmentioning

confidence: 99%

See 2 more Smart Citations

Comparative Implementation Analysis of AES Algorithm

Damjanović¹,

Simić²

2011

JITA

View full text Add to dashboard Cite

Advanced Encryption Standard (AES) is the fi rst cryptographic standard aroused as a result of public competition that was established by U.S. National Institute of Standards and Technology. Standard can theoretically be divided into three cryptographic algorithms: AES-128, . This paper represents a study which compares performance of well known cryptographic packages -Oracle/Sun and Bouncy Castle implementations in relation to our own small and specialized implementations of AES algorithm. The paper aims to determine advantages between the two well known implementations, if any, as well as to ascertain what benefi ts we could derive if our own implementation was developed. Having compared the well known implementations, our evaluation results show that Bouncy Castle and Oracle/SUN gave pretty equal performance results -Bouncy Castle has produced slightly better results than Oracle/Sun during encryption, while in decryption, the results prove that Oracle/Sun implementation has been slightly faster. It should be noted that the results presented in this study will show some advantages of our own specialized implementations related not only to algorithm speed, but also to possibilities for further analysis of the algorithm.

show abstract

Section: Measurement Results-standard-defi Ned Aes Algorithmmentioning

confidence: 99%

“…This approach uses only three smaller tablesSBox, inverse SBox and RCon, therefore consumes signifi cantly less memory [1], but uses multiplication more intensively.…”

Section: Implementation Detailsmentioning

confidence: 99%

Section: Hypothesesmentioning

confidence: 99%

See 1 more Smart Citation

Comparative Implementation Analysis of AES Algorithm

Damjanović¹,

Simić²

2011

JITA

View full text Add to dashboard Cite

show abstract

“…The only difference is that the sub-key rounds are applied in reverse order for decryption. 7 Each one of the above described transformations BS, SR, MC, and ARK are invertible [28]. Let us call them IBS, ISR, IMC, and IARK, respectively.…”

Section: A4 Add Round Key (Ark) Stepmentioning

confidence: 99%

“…For example, AES software implementations [7,19] have a throughput that ranges from 300 to 800 Mbps depending on the specific architecture and platform selected by the developers. Some efficient encryptor/decryptor core VLSI implementations have also been reported in [27,36,51].…”

Section: Introductionmentioning

confidence: 99%

Block Cipher Modes of Operation from a Hardware Implementation Perspective

Chakraborty

Henríquez

2009

Cryptographic Engineering

View full text Add to dashboard Cite

Block ciphers are one of the most important primitives in cryptology. They are based on well-understood mathematical and cryptographic principles. Due to their inherent efficiency, these ciphers are used in many kinds of applications which require bulk encryption at high speed.Generally speaking, a block cipher consists of at least two closely related algorithms: block encryption and block decryption. Block encryption takes as an input a fixed-length block (known as the plaintext) and transform it into another block of the same length (known as the ciphertext) under the action of a fixed secret key that may or may not have the same length of the plaintext. A block cipher must be invertible in the sense that by using the block decryption algorithm it should be always possible to recover the original plaintext from the ciphertext and the secret key. Figure 1.1 shows schematically the situation just described. We stress that once that the plaintext has been encrypted using a given key then, a successful decryption can only be performed by knowing that key. Due to this feature, block ciphers are classified as a secret or symmetric key primitives.Formally a block cipher is considered to be secure if it behaves like a strong pseudorandom permutation, i.e., a block cipher is secure if an adversary cannot distinguish its output from a randomly chosen permutation. This definition of security for block ciphers is very strong, it implies that for any possible input, a secure block cipher should produce random outputs. It is unfortunate that there exists no formal security model for assessing whether a block cipher is or not secure or rather, how secure a cipher is. Hence, we rely on a block cipher by the fact that no one has been able to find an attack on it.Assuming that an adversary has managed to obtain a plaintext and the corresponding cipher text, then she can always try to obtain the n-bit secret key of a given symmetric block cipher by trying all possible keys, a procedure traditionally termed brute-force attack. We say that a block cipher has a security strength of n bits if the 2 Debrup Chakraborty and Francisco Rodríguez-Henríquez best known attack against it is not computationally cheaper than the brute force attack. Modern block ciphers typically use a block and key length ranging from 64 bits up to 256 bits. At the present state of the technology, block/key sizes of 128 bits are generally considered adequate in terms of both, security and efficiency.Block ciphers have been around for civilian/commercial use since 1971, when a team leaded by H. Feistel and his colleagues at IBM designed a family of ciphers known as Lucifer [2,53]. Early versions of Lucifer operated on 24-bit long plaintext blocks. The strongest variant which was released in 1973, operated on 128-bit blocks and 128-bit secret keys. A revised version of that Lucifer variant, known as the Data Encryption Standard (DES), was adopted as a US FIPS standard in 1974 [16, 42]. Across the years, DES became the most influential block cipher ever inspiring...

show abstract

Efficient mapping and acceleration of AES on custom multi‐core architectures

Pande¹,

Zambreno²

2010

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYMulti-core processors can deliver significant performance benefits for multi-threaded software by adding processing power with minimal latency, given the proximity of the processors. Cryptographic applications are inherently complex and involve large computations. Most cryptographic operations can be translated into logical operations, shift operations, and table look-ups. In this paper we design a novel processor (called -core) with a reconfigurable Arithmetic Logic Unit, and design custom two-dimensional multicore architectures on top of it to accelerate cryptographic kernels. We propose an efficient mapping of instructions from the multi-core grid to the individual processor cores and illustrate the performance of AES-128E algorithm over custom-sized grids. The model was developed using Simulink and the performance analysis suggests a positive trend towards development of large multi-core (or multi--core) architectures to achieve high throughputs in cryptographic operations.

show abstract

Efficient Software Implementation of AES on 32-Bit Platforms

Cited by 89 publications

References 7 publications

Comparative Implementation Analysis of AES Algorithm

Comparative Implementation Analysis of AES Algorithm

Block Cipher Modes of Operation from a Hardware Implementation Perspective

Efficient mapping and acceleration of AES on custom multi‐core architectures

Contact Info

Product

Resources

About