logmod

버전 1.4.0.0 (22.6 KB) 작성자: Steven Gregory

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

다운로드 수: 644

업데이트 날짜: 2009/4/23

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

Steven Gregory (2026). logmod (https://kr.mathworks.com/matlabcentral/fileexchange/23803-logmod), MATLAB Central File Exchange. 검색 날짜: 2026/2/12.

개발 환경: R2006a

모든 릴리스와 호환

Windows macOS Linux

도움 받은 파일: nextperm, modinv(x, N)

도움 준 파일: modinv(x, N), nextperm, egcd.m

Open in new tab

버전	게시됨	릴리스 정보
1.4.0.0	2009/4/23	Brought the description up to date. This routine no longer needs the m-file modinv.m.	다운로드
1.3.0.0	2009/4/23	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	2009/4/16	Rewrote the description.	다운로드
1.0.0.0	2009/4/16		다운로드