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...
Gardado en:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
MDPI AG
2021-02-01
|
| Series: | Cryptography |
| Assuntos: | |
| Acceso en liña: | https://www.mdpi.com/2410-387X/5/1/6 |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|