3 Commits

Author	SHA1	Message	Date
Nick Thompson	faa61cd911	[ci skip] It is *not* the case that a discrete log exists when the base and modulus are coprime. Take 4^x = 2 mod 5 as a counterexample. Change API accordingly.	2018-02-10 17:51:59 -06:00
Nick Thompson	8c415f77b1	[ci skip] Use less verbose naming. Add asserts as verfication of algorithms is a negligible fraction of total runtime. Use boost::multiprecision::powm and boost::multiprecision::sqrt rather than one-offs.	2018-02-09 17:19:26 -06:00
Nick Thompson	fc4d657201	[ci skip] Modular exponentiation, modular multiplicative inverse, extended Euclidean algorithm, discrete logarithm.	2018-01-28 14:47:14 -06:00