summaryrefslogtreecommitdiff
path: root/src/math.lisp
AgeCommit message (Expand)Author
2020-01-19Improve probable primality testGuillaume Le Vaillant
2019-10-21More fixes for :invert readtable-case.Guillaume Le Vaillant
2017-08-11Add a function to compute a modular inverse with a blinding factorGuillaume LE VAILLANT
2017-05-28Make modular exponentiation safer against timing attackGuillaume LE VAILLANT
2016-11-22Rename expt-mod-fast to expt-mod/unsafe. (#75)glv2
2016-02-14Use Montgomery ladder algorithm for modular exponentiation by default.Guillaume LE VAILLANT
2016-02-14Optimization for ed25519.Guillaume LE VAILLANT
2016-02-14Use faster algorithm (2^k-ary method) for modular exponentiation.Guillaume LE VAILLANT
2016-02-14Add key generation for RSA and DSAGuillaume LE VAILLANT
2016-02-14Fix generate-prime function (was returning primes 1 bit too long)Guillaume LE VAILLANT
2012-09-29Fix wrong LOOP form: it contained FOR and UNTIL statements mixed in an invali...Juan Jose Garcia Ripoll
2012-05-29add emacs modelines to all lisp-y filesNathan Froyd
2012-04-26(+small-primes+): define with DEFCONSTRobert A. Uhl
2012-04-26Added prime generation functionalityRobert A. Uhl
generated by cgit v1.2.3-70-g09d2 (git 2.46.0) at 2024-10-23 03:18:13 +0000