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...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
MDPI AG
2021-02-01
|
| Collection: | Cryptography |
| Sujets: | |
| Accès en ligne: | https://www.mdpi.com/2410-387X/5/1/6 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|