Modular Exponentiation Core

Helion Tech LogoThe Helion Modular Exponentiation core performs the Z = YE mod M computation which is at the heart of many commonly used Public-Key encryption schemes such as RSA, Diffie-Hellman and the Digital Signature Algorithm (DSA) described in FIPS 186-2. These algorithms provide the strong encyption to facilitate key exchange and certificate-based authentication for communication protocols such as TLS/SSL and IPsec which are widely used for securing transactions over open networks such as the Internet.

Modular Exponentiation is an extremely CPU intensive computation which can present a significant overhead for embedded systems which implement these Public-Key algorithms in software. The Helion ModExp core has been designed to be highly efficient in Lattice FPGA, and to provide an easy to use and resource efficient means to perform hardware acceleration for applications which require a cryptographic key exchange.

Features

  • Implements the Z = YE mod M Modular Exponentiation function commonly used in Public-Key Cryptography
  • Ideal for hardware acceleration of RSA, Diffie-Hellman and DSA
  • Supports 192, 256, 384, 512, 768, 1024, 1536 and 2048-bit operands
  • Efficiently supports short exponent lengths at higher performance e.g. 180-bit for Diffie-Hellman
  • Simple 32-bit RAM interface
  • Available in a choice of versions allowing user to trade-off area and performance for optimal solution
  • Highly optimised for use in Lattice FPGA

Jump to

Block Diagram

Ordering Information

This IP core is supported and sold by Helion Technology, contact Helion Technology at info@heliontech.com or visit their website at www.heliontech.com for more information.

Documentation

Quick Reference
TITLE NUMBER VERSION DATE FORMAT SIZE
Helion Technology - Modular Exponentiation Core
3/23/2011 PDF 81.3 KB


Like most websites, we use cookies and similar technologies to enhance your user experience. We also allow third parties to place cookies on our website. By continuing to use this website you consent to the use of cookies as described in our Cookie Policy.