Domain Specific High-Level Synthesis for Cryptographic Workloads

This book offers an in-depth study of the design and challenges addressed by a high-level synthesis tool targeting a specific class of cryptographic kernels, i.e. symmetric key cryptography. With the aid of detailed case studies, it also discusses optimization strategies that cannot be automatically...

Full description

Bibliographic Details
Main Authors: Khalid, Ayesha (Author, http://id.loc.gov/vocabulary/relators/aut), Paul, Goutam (http://id.loc.gov/vocabulary/relators/aut), Chattopadhyay, Anupam (http://id.loc.gov/vocabulary/relators/aut)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: Singapore : Springer Singapore : Imprint: Springer, 2019.
Edition:1st ed. 2019.
Series:Computer Architecture and Design Methodologies,
Subjects:
Online Access:Full Text via HEAL-Link
Description
Summary:This book offers an in-depth study of the design and challenges addressed by a high-level synthesis tool targeting a specific class of cryptographic kernels, i.e. symmetric key cryptography. With the aid of detailed case studies, it also discusses optimization strategies that cannot be automatically undertaken by CRYKET (Cryptographic kernels toolkit. The dynamic nature of cryptography, where newer cryptographic functions and attacks frequently surface, means that such a tool can help cryptographers expedite the very large scale integration (VLSI) design cycle by rapidly exploring various design alternatives before reaching an optimal design option. Features include flexibility in cryptographic processors to support emerging cryptanalytic schemes; area-efficient multinational designs supporting various cryptographic functions; and design scalability on modern graphics processing units (GPUs). These case studies serve as a guide to cryptographers exploring the design of efficient cryptographic implementations.
Physical Description:XXII, 237 p. 190 illus., 73 illus. in color. online resource.
ISBN:9789811010705
ISSN:2367-3478
DOI:10.1007/978-981-10-1070-5