5 Commits

Author	SHA1	Message	Date
Dhruv Manilawala	60895366c0	fix(mypy): type annotations for cipher algorithms (#4306) ... * fix(mypy): type annotations for cipher algorithms * Update mypy workflow to include cipher directory * fix: mypy errors in hill_cipher.py * fix build errors	2021-04-04 07:22:12 +02:00
Jenia Dysin	9d745b6156	Add typehints ciphers and bool alg (#3264) ... * updating DIRECTORY.md * updating DIRECTORY.md * Fixed accidental commit of file I have't touched * fixup! Format Python code with psf/black push * updating DIRECTORY.md * updating DIRECTORY.md * Fixed some suggested coding style issues * Update rsa_key_generator.py * Update rsa_key_generator.py Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: John Law <johnlaw.po@gmail.com>	2020-10-16 14:11:52 +08:00
Christian Clauss	9200a2e543	from __future__ import annotations (#2464) ... * from __future__ import annotations * fixup! from __future__ import annotations * fixup! from __future__ import annotations * fixup! Format Python code with psf/black push Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>	2020-09-23 13:30:13 +02:00
Zizhou Zhang	e3aa0f65e8	fix implementation errors. (#1568) ... I revised my implementation and found out that I have miss a inner loop for t. x and y should be recalculated everytime when t is divisble by 2. I have also included a more readble source for this algorithm.	2019-11-14 20:29:54 +01:00
Zizhou Zhang	db515e585e	added rsa_factorization.py (#1556) ... * added RSA_factorization.py This algorithm can effectively factor RSA large prime N given public key e and private key d. * Rename RSA_factorization.py to rsa_factorization.py * Add definitions for d, e, and N	2019-11-09 15:02:30 +01:00