2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353)
DOI: 10.1109/iscas.2002.1010996
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of different Rijndael implementations for high end servers

Abstract: We present the results of our research on different hardware implementations of the Rijndael cryptographic algorithm. We have implemented variations of the substitution box (sbox) and compare the different implementations based on area and timing requirements, as well as pipelining capabilities. Additionally, the speed of the Rijndael hardware variants is compared to a hand optimized software implementation.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
9
0
2

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 11 publications
(12 citation statements)
references
References 4 publications
1
9
0
2
Order By: Relevance
“…Since our primary concern was latency performance, we opted for the fastest direct implementation. Using the same constraint considerations, a similar conclusion can also be reached using figures from other authors [6].…”
Section: S-box Designsupporting
confidence: 75%
“…Since our primary concern was latency performance, we opted for the fastest direct implementation. Using the same constraint considerations, a similar conclusion can also be reached using figures from other authors [6].…”
Section: S-box Designsupporting
confidence: 75%
“…The hardware implementation of crypto algorithms, associated with keys, is by nature very secure and cannot be easily modified from outside [3]. After the Rijndael algorithm has become a standard encryption algorithm, many hardware implementations based on FPGA and ASIC have been proposed [3][4][5][6][7][8][9]. ASIC provides low power design but the design time and time to market is very high.…”
Section: Introductionmentioning
confidence: 99%
“…Various methods for constructing compact inversion circuits over GF have been studied, based on Fermat's Little Theorem, the extended Euclid's Algorithm and so on [11]. In particular, the composite field (or tower field) inversion [8] is effective over GF (2 8 ), and it can be used to create compact AES implementations [9,10].…”
Section: Basic Approachesmentioning
confidence: 99%
“…[13], or by making a decision diagram such as a BDD [12] or an FDD [14]. In many actual AES implementations the table-lookup method is used [11], where the S -Box circuit is automatically synthesized using EDA tools.…”
Section: Basic Approachesmentioning
confidence: 99%
See 1 more Smart Citation