Right-Sizing Your Cryptographic Processing Solution
By Synopsys
The cornerstone of all security solutions that deal with confidentiality, integrity and authentication is cryptography. Cryptography is a complex math problem used to help create security applications. Algorithms vary for different applications and are used for specific purposes. The common cryptographic algorithms are symmetric block ciphers for confidentiality, hash functions for integrity, and public key cryptography for authentication. Performance requirements for these operations range widely depending on the specific application and market. Implementation and runtime costs for meeting these requirements vary even widely.
In this white paper we investigate different cryptography implementation options and trade-offs, describe the measurable parameters, and analyze examples. We introduce and use the new EEMBC SecureMark™ benchmark for these measurements. This benchmark was developed under the umbrella of EEMBC by an industry consortium chaired by Synopsys. It provides an accurate, reliable tool to compare the efficiency of cryptography implementations for several security profiles quickly and equitably.
To read the full article, click here
Related Semiconductor IP
- HBM4 PHY IP
- Ultra-Low-Power LPDDR3/LPDDR2/DDR3L Combo Subsystem
- MIPI D-PHY and FPD-Link (LVDS) Combinational Transmitter for TSMC 22nm ULP
- HBM4 Controller IP
- IPSEC AES-256-GCM (Standalone IPsec)
Related Articles
- ARChitect Processor Configurator: The Power of Configurable Processing At Your Fingertips
- Tutorial: Enhance Your Signal Processing Toolbox with Complex Notation
- Making your UWB solutions ''Future Proof''
- This Isn't Your Father's JTAG Anymore
Latest Articles
- A 14ns-Latency 9Gb/s 0.44mm² 62pJ/b Short-Blocklength LDPC Decoder ASIC in 22FDX
- Pipeline Stage Resolved Timing Characterization of FPGA and ASIC Implementations of a RISC V Processor
- Lyra: A Hardware-Accelerated RISC-V Verification Framework with Generative Model-Based Processor Fuzzing
- Leveraging FPGAs for Homomorphic Matrix-Vector Multiplication in Oblivious Message Retrieval
- Extending and Accelerating Inner Product Masking with Fault Detection via Instruction Set Extension