A Vendor-Neutral Unified Core for Cryptographic Operations in GF(p) and GF(sm) Based on Montgomery Arithmetic

  title={A Vendor-Neutral Unified Core for Cryptographic Operations in GF(p) and GF(sm) Based on Montgomery Arithmetic},
  author={Martin Schramm and Reiner Dojen and Michael Heigl},
  journal={Secur. Commun. Networks},
In the emerging IoT ecosystem in which the internetworking will reach a totally new dimension the crucial role of efficient security solutions for embedded devices will be without controversy. Typically IoT-enabled devices are equipped with integrated circuits, such as ASICs or FPGAs to achieve highly specific tasks. Such devices must have cryptographic layers implemented and must be able to access cryptographic functions for encrypting/decrypting and signing/verifying data using various… 
2 Citations
SDR Implementation of a D2D Security Cryptographic Mechanism
This paper proposes a security mechanism for D2D communication involving the use of physically unclonable functions (PUF) for unique key generation, elliptic-curve cryptography (ECC) and Diffie–Hellman key exchange (DHKE) for key management, and Salsa20/20 as stream cyphering encryption method, suitable for confidentiality of the wireless transmissions.
A Lightweight BCH Code Corrector of TRNG with Measurable Dependence
A new lightweight BCH code corrector of the random number generator such that the bitwise dependence of the output value is controllable and the degree of dependence among the output bits of the corrector is adjustable depending on the bias of the input bits.


High-performance low-energy implementation of cryptographic algorithms on a programmable SoC for IoT devices
This paper proposes to use an FPGA as the reconfigurable substrate for cryptographic operations and demonstrates the approach on a Zedboard, which has two ARM cores and a Zynq FPGP, and integrates its cryptographic engines with the OpenSSL library to inherit its support for block cipher modes.
A Review of Modular Multiplication Methods ands Respective Hardware Implementation
Most known and recent methods for efficient modular multiplication are surveyed, investigating and examining their strengths and weaknesses and providing an adequate hardware implementation.
Comparison of ECC and RSA Algorithm in Resource Constrained Devices
Using ECC in resource constrained devices has advantages over RSA but ECC needs continues enhancement to satisfy the limitations of newly designed chips.
A Survey of Hardware Implementations of Elliptic Curve Cryptographic Systems
The paper outlines ECC’s vulnerability against quantum attacks and references one possible solution to that problem, and the suitability of the hardware/software approach in regard to the security challenges opposed by the low-end embedded devices of the Internet of Things is briefly examined.
A survey of some known and recent Montgomery multiplier designs is presented, examining their strengths and weaknesses and a new high speed architecture for the same is proposed.
Implementation of RSA Algorithm with Chinese Remainder Theorem for Modulus N 1024 Bit and 4096 Bit
In testing the algorithm RSA-CRT 4096 bits, the conclusion that the decryption process is also effective undertaken more rapidly is reached, however, the time needed is longer to generate the keys.
Modular Multiplication and Exponentiation Architectures for Fast RSA Cryptosystem Based on Digit Serial Computation
Experimental results show that the proposed modular exponentiation and modular-multiplication design obtain the best delay performance compared with the published works and outperform them in terms of area-time complexity as well.
Novel algorithms and hardware architectures for Montgomery Multiplication over GF(p)
A novel digit-digit based MM algorithm is derived and two hardware architectures that compute that algorithm are described, making use of available dedicated multiplier and memory blocks reducing drastically the FPGA’s standard logic while keeping an acceptable performance compared with other implementation approaches.
Public Key Cryptography - PKC 2008, 11th International Workshop on Practice and Theory in Public-Key Cryptography, Barcelona, Spain, March 9-12, 2008. Proceedings
  • R. Cramer
  • Computer Science, Mathematics
    Public Key Cryptography
  • 2008
This presentation discusses the development of Digital Signature Schemes in Weakened Random Oracle Models, and its application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents.
A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
A scalable and unified architecture for a Montgomery multiplication module which operates in both types of finite fields GF(p) and GF(2m) and utilizes the concurrency in the Montgomery multiplication operation by employing a pipelining design methodology.