logmod

버전 1.4.0.0 (22.6 KB) 작성자: Steven Gregory
Computes y such that mod(a^y, p^N) == x
5.0
(2)
다운로드 수: 643
업데이트 날짜: 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 (2024). logmod (https://www.mathworks.com/matlabcentral/fileexchange/23803-logmod), MATLAB Central File Exchange. 검색됨 .

MATLAB 릴리스 호환 정보
개발 환경: R2006a
모든 릴리스와 호환
플랫폼 호환성
Windows macOS Linux
카테고리
Help Center 및 MATLAB Answers에서 Number Theory에 대해 자세히 알아보기

Community Treasure Hunt

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

Start Hunting!

버전 게시됨 릴리스 정보
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