Montgomery Reduction for Gaussian Integers
Modular arithmetic over integers is required for many cryptography systems. Montgomery reduction is an efficient algorithm for the modulo reduction after a multiplication. Typically, Montgomery reduction is used for rings of ordinary integers. In contrast, we investigate the modular reduction over r...
Main Authors: | Malek Safieh, Jürgen Freudenberger |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-02-01
|
Series: | Cryptography |
Subjects: | |
Online Access: | https://www.mdpi.com/2410-387X/5/1/6 |
Similar Items
-
A Compact Coprocessor for the Elliptic Curve Point Multiplication over Gaussian Integers
by: Malek Safieh, et al.
Published: (2020-12-01) -
Towards High-Performance Supersingular Isogeny Cryptographic Hardware Accelerator Design
by: Guantong Su, et al.
Published: (2023-03-01) -
An improved public key cryptography based on the elliptic curve
by: Al-Daoud, Essam Faleh
Published: (2002) -
FPGA Implementation for Elliptic Curve Cryptography Algorithm and Circuit with High Efficiency and Low Delay for IoT Applications
by: Deming Wang, et al.
Published: (2023-05-01) -
A Crypto Accelerator of Binary Edward Curves for Securing Low-Resource Embedded Devices
by: Asher Sajid, et al.
Published: (2023-07-01)