A Note on the Computation of the Modular Inverse for Cryptography

In literature, there are a number of cryptographic algorithms (RSA, ElGamal, NTRU, etc.) that require multiple computations of modulo multiplicative inverses. In this paper, we describe the modulo operation and we recollect the main approaches to computing the modulus. Then, given <i>a</i> and <i>n<...

Fuld beskrivelse

Bibliografiske detaljer

Principais autores:	Michele Bufalo, Daniele Bufalo, Giuseppe Orlando
Format:	Artigo
Sprog:	Inglês
Udgivet:	MDPI AG 2021-06-01
Serier:	Axioms
Fag:	extended-Euclid algorithm RSA algorithm modular multiplicative inverse public-key cryptography
Online adgang:	https://www.mdpi.com/2075-1680/10/2/116
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!