Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Adam J. Elbirt

dblp:46/547 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 3 first-authorSecurity and privacy · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
3 papers
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Reconfigurable computing and FPGAs · 86% Hardware accelerators and domain-specific architectures · 9% Embedded and real-time systems · 5%

Topics — the 11 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
block cipher implementation
0.122005
An Instruction-Level Distributed Processor for Symmetric-Key Cryptography · IEEE Trans. Parallel Distributed Syst. 2005
An FPGA implementation and performance evaluation of the Serpent block cipher · FPGA 2000
Cryptographic primitives and cryptanalysis
block cipher
0.112005
An Instruction-Level Distributed Processor for Symmetric-Key Cryptography · IEEE Trans. Parallel Distributed Syst. 2005
Cryptographic primitives and cryptanalysis
symmetric cryptography
0.112005
An Instruction-Level Distributed Processor for Symmetric-Key Cryptography · IEEE Trans. Parallel Distributed Syst. 2005
Reconfigurable computing and FPGAs
reconfigurable architecture
0.112005
An Instruction-Level Distributed Processor for Symmetric-Key Cryptography · IEEE Trans. Parallel Distributed Syst. 2005
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography
0.012001
NTRU in Constrained Devices · CHES 2001
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
NTRU
0.012001
NTRU in Constrained Devices · CHES 2001
Cryptographic primitives and cryptanalysis
public-key cryptography
0.012001
NTRU in Constrained Devices · CHES 2001
Reconfigurable computing and FPGAs
FPGA implementation
0.012000
An FPGA implementation and performance evaluation of the Serpent block cipher · FPGA 2000
Hardware accelerators and domain-specific architectures
cryptographic accelerator
0.012005
An Instruction-Level Distributed Processor for Symmetric-Key Cryptography · IEEE Trans. Parallel Distributed Syst. 2005
Embedded and real-time systems › resource-constrained systems
resource-constrained devices
0.012001
NTRU in Constrained Devices · CHES 2001
Cryptographic primitives and cryptanalysis › block cipher
serpent
0.012000
An FPGA implementation and performance evaluation of the Serpent block cipher · FPGA 2000

Methods — techniques the papers use, named apart from their topics

reconfiguration · 0.1instruction-level parallelism · 0.1high-speed FPGA architecture · 0.1
YearPublicationVenuePosition
2010 Enhancing the Performance of Symmetric-Key Cryptography via Instruction Set Extensions
abstract
In this paper, instruction set extensions for a reduced instruction set computer processor are presented to improve the software performance of the data encryption standard (DES), the triple DES, the international data encryption algorithm (IDEA), and the advanced encryption standard (AES) algorithms. The most computationally intensive operations of each algorithm are off-loaded to a set of newly defined instructions. The additional hardware required to support these instructions is integrated into the processor's data path. For each of the targeted algorithms, comparisons are presented between traditional software implementations and new implementations that take advantage of the extended instruction set architecture. Results show that the utilization of the proposed instructions significantly reduces program code size, and improves encryption and decryption throughput. Moreover, the additional hardware resources required to support the instruction set extensions increase the total area of the processor by less than 65%. Finally, it will be shown that the throughputs for triple DES, IDEA, and AES are approximately the same when accelerated via instruction set extensions. This allows for seamless and transparent algorithm agility as one algorithm may be easily replaced by another algorithm with minimal performance degradation.
Sean O'Melia, Adam J. Elbirt
IEEE Trans. Very Large Scale Integr. Syst.2
2008 Instruction Set Extensions for Enhancing the Performance of Symmetric-Key Cryptography
abstract
Instruction set extensions for a RISC processor are presented to improve the software performance of the Data Encryption Standard (DES), Triple-DES, the International Data Encryption Algorithm (IDEA), and the Advanced Encryption Standard (AES) algorithms. The most computationally intensive operations of each algorithm are off-loaded to a set of newly defined instructions. The additional hardware required to support these instructions is integrated into the processor's datapath. For each of the targeted algorithms, comparisons are presented between traditional software implementations and new implementations that take advantage of the extended instruction set architecture. Results show that utilization of the proposed instructions significantly reduces program code size and improves encryption and decryption throughput. Moreover, the additional hardware resources required to support the instruction set extensions increases the total area of the processor by less than 65%.
Sean O'Melia, Adam J. Elbirt
ACSAC2
2008 Accelerated AES implementations via generalized instruction set extensions
abstract
Efficient implementation of block ciphers is critical towards achieving both high security and high-speed processing. Numerous block ciphers, including the Advanced Encryption Standard (AES), have been proposed and implemented, using a wide and varied range of functional operations. Existing microp rocessor architectures do not provide this broad range of support. However, the advent of intellectual property (IP) processor cores presents the opportunity to augment existing datapaths with instruction set extensions to add acceleration modules in the form of new instructions. We will present a general purpose instruction set extension to a 32-bit SPARC V8 compatible processor core that accelerates the performance of Galois Field fixed field constant multiplication, a core element of the AES algorithm. This extension will be shown to accelerate AES encryption versus pure software implementations at a small hardware cost. This matches the improvement demonstrated in previously proposed AES-specific instruction set extensions while maintaining a generalized implementation format capable of supporting other algorithms that use Galois Field fixed field constant multiplication.
Adam J. Elbirt
J. Comput. Secur.1
2005 An Instruction-Level Distributed Processor for Symmetric-Key Cryptography
abstract
Efficient implementation of block ciphers is critical toward achieving both high security and high-speed processing. Numerous block ciphers have been proposed and implemented, using a wide and varied range of functional operations. Existing architectures such as microcontrollers do not provide this broad range of support. Therefore, we will present a hardware architecture that achieves efficient block cipher implementation while maintaining flexibility through reconfiguration. In an effort to achieve such a hardware architecture, a study of a wide range of block ciphers was undertaken to develop an understanding of the functional requirements of each algorithm. This study led to the development of COBRA, a reconfigurable architecture for the efficient implementation of block ciphers. A detailed discussion of the top-level architecture, interconnection scheme, and underlying elements of the architecture will be provided. System configuration and on-the-fly reconfiguration will be analyzed, and from this analysis, it will be demonstrated that the COBRA architecture satisfies the requirements for achieving efficient implementation of a wide range of block ciphers that meet the 622 Mbps ATM network encryption throughput requirement.
Adam J. Elbirt, Christof Paar
IEEE Trans. Parallel Distributed Syst.1
2001 NTRU in Constrained Devices
Daniel V. Bailey, Daniel Coffin, Adam J. Elbirt, Joseph H. Silverman, Adam D. Woodbury
CHES3
2001 An FPGA-based performance evaluation of the AES block cipher candidate algorithm finalists
abstract
The technical analysis used in determining which of the potential Advanced Encryption Standard candidates was selected as the Advanced Encryption Algorithm includes efficiency testing of both hardware and software implementations of candidate algorithms. Reprogrammable devices such as field-programmable gate arrays (FPGAs) are highly attractive options for hardware implementations of encryption algorithms, as they provide cryptographic algorithm agility, physical security, and potentially much higher performance than software solutions. This contribution investigates the significance of FPGA implementations of the Advanced Encryption Standard candidate algorithms. Multiple architectural implementation options are explored for each algorithm. A strong focus is placed on high-throughput implementations, which are required to support security for current and future high bandwidth applications. Finally, the implementations of each algorithm will be compared in an effort to determine the most suitable candidate for hardware implementation within commercially available FPGAs.
Adam J. Elbirt, W. Yip, B. Chetwynd, Christof Paar
IEEE Trans. Very Large Scale Integr. Syst.1
2000 An FPGA implementation and performance evaluation of the Serpent block cipher
abstract
With the expiration of the Data Encryption Standard (DES) in 1998, the Advanced Encryption Standard (AES) development process is well underway. It is hoped that the result of the AES process will be the specification of a new nonclassified encryption algorithm that will have the global acceptance achieved by DES as well as the capability of longterm protection of sensitive information. The technical analysis used in determining which of the potential AES candidates will be selected as the Advanced Encryption Algorithm includes e#ciency testing of both hardware and software implementations of candidate algorithms. Reprogrammable devices such as Field Programmable Gate Arrays (FPGAs) are highly attractive options for hardware implementations of encryption algorithms as they provide cryptographic algorithm agility, physical security, and potentially much higher performance than software solutions. This contribution investigates the significance of an FPGA implementation of Serpent, one of the Advanced Encryption Standard candidate algorithms. Multiple architecture options of the Serpent algorithm will be explored with a strong focus being placed on a high speed implementation within an FPGA in order to support security for current and future high bandwidth applications. One of the main findings is that Serpent can be implemented with encryption rates beyond 4 Gbit/s on current FPGAs.
Adam J. Elbirt, Christof Paar
FPGA1