Zander671/lisp-encryption-practice
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix another bug in the modular inverse

Browse Source
This commit is contained in:
Alexander Rosenberg
2024-10-07 20:54:07 -07:00
parent f154ef9b35
commit e8f351b7b3
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
hill.lisp
View File

@ -146,7 +146,7 @@ return a cons of (x . y) such char x * N1 + y * N2 = GCD."
integer i such that (N * i) mod M = 1." integer i such that (N * i) mod M = 1."
(destructuring-bind (gcd (x . y)) (destructuring-bind (gcd (x . y))
(multiple-value-list (extended-gcd (if (minusp n) (multiple-value-list (extended-gcd (if (minusp n)
(+ 26 n) (+ m n)
n) n)
m)) m))
(declare (ignorable y)) (declare (ignorable y))

2
shift-affine.lisp
View File

@ -62,7 +62,7 @@ return a cons of (x . y) such char x * N1 + y * N2 = GCD."
integer i such that (N * i) mod M = 1." integer i such that (N * i) mod M = 1."
(destructuring-bind (gcd (x . y)) (destructuring-bind (gcd (x . y))
(multiple-value-list (extended-gcd (if (minusp n) (multiple-value-list (extended-gcd (if (minusp n)
(+ 26 n) (+ m n)
n) n)
m)) m))
(declare (ignorable y)) (declare (ignorable y))