logmod

Versione 1.4.0.0 (22,6 KB) da Steven Gregory
Computes y such that mod(a^y, p^N) == x
5.0
(2)
643 download
Aggiornato 23 apr 2009

Visualizza la licenza

Suppose
p is an odd prime,
ord(a) = p-1
GCD(x, p) = 1
N is an integer >= 2

Then
y = logmod(x, a, p, N)

Returns y such that a^y = x (mod p^N)

Example
Let x= vpi(154), a = vpi(7), p = vpi(17), N = vpi(37)
y = logmod(x, a, p, N)
returns
y = 2088349219044680767324467844670001776975183904

Cita come

Steven Gregory (2024). logmod (https://www.mathworks.com/matlabcentral/fileexchange/23803-logmod), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R2006a
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Riconoscimenti

Ispirato da: nextperm, modinv(x, N)

Ispirato: modinv(x, N), nextperm, egcd.m

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versione Pubblicato Note della release
1.4.0.0

Brought the description up to date. This routine no longer needs the m-file modinv.m.
1.3.0.0

Modified to correct logic errors and to exploit the latest version of the vpi software. A Microsoft word file has been included that describes and proves the algorithm used.
1.2.0.0

Rewrote the description.
1.0.0.0