2011 International Conference on Field-Programmable Technology 2011
DOI: 10.1109/fpt.2011.6132722
|View full text |Cite
|
Sign up to set email alerts
|

Efficient key-dependent message authentication in reconfigurable hardware

Abstract: The paper presents a novel concept of processor aimed at symmetric-key cryptographic applications. Its architecture is optimized for implementation of common cryptography tasks. The processor has 128-bit separated data and key registers, dedicated instruction set optimized for key generation and management, embedded cipher, and embedded random number generator. From an architectural point of view, the most important characteristic of the proposed crypto-processor is the physical separation of data and key regi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 17 publications
(29 citation statements)
references
References 13 publications
0
29
0
Order By: Relevance
“…In Algorithm 1, if H is fixed, the multiplier is called a fixed operand GF (2 128 ) multiplier as shown by [5]. This design proposed by [5] can be used efficiently (smaller area) on FPGAs as the circuit is specialized for H. We integrated this multiplier proposed by [5] with a key-synthesized AES engine in [6] in order to support slow changing key applications like Virtual Private Networks (VPNs).…”
Section: Hardware Implementationmentioning
confidence: 98%
See 1 more Smart Citation
“…In Algorithm 1, if H is fixed, the multiplier is called a fixed operand GF (2 128 ) multiplier as shown by [5]. This design proposed by [5] can be used efficiently (smaller area) on FPGAs as the circuit is specialized for H. We integrated this multiplier proposed by [5] with a key-synthesized AES engine in [6] in order to support slow changing key applications like Virtual Private Networks (VPNs).…”
Section: Hardware Implementationmentioning
confidence: 98%
“…This design proposed by [5] can be used efficiently (smaller area) on FPGAs as the circuit is specialized for H. We integrated this multiplier proposed by [5] with a key-synthesized AES engine in [6] in order to support slow changing key applications like Virtual Private Networks (VPNs). Also, in [6], we proposed a protocol to secure the FPGA reconfiguration to protect the bitstream because it is a key-based bitsream.…”
Section: Hardware Implementationmentioning
confidence: 99%
“…Wang et al [18] presented a GHASH architecture based on four GHASH cores that achieved a throughput of 123.1 Gbit/s on a Virtex-5. Crenne et al [4] reached 238.1 Gbit/s by using 8 parallel finite-field multipliers, also targeting a Xilinx Virtex-5 FPGA. Since we aim at a full AE architecture, i.e., a design including both the authenticity and the confidentiality part, we do not consider these GHASH-only implementations for our investigations.…”
Section: Related Workmentioning
confidence: 99%
“…Although our development board and the AE cores have been designed to support a 100 Gbit/s communication, real-world experiments have so far only been undertaken using a 40 Gbit/s ciphertext interface due to financial reasons 4 . Nevertheless, measurements of the overall system proved it to be operational at data rates up to 40 Gbit/s with all the features described above.…”
Section: Fpga Digital Designmentioning
confidence: 99%
“…The key used for encryption and authentication is synthesized into the module structure in order to reduce the consumed area. This is achieved by combining the GF(2 128 ) multiplier proposed by [6] with our presented AES.…”
Section: Introductionmentioning
confidence: 99%