summaryrefslogtreecommitdiff
path: root/rsa
Commit message (Collapse)AuthorAgeFilesLines
...
* Bumped version to 4.1-dev0Sybren A. Stüvel2019-08-041-2/+2
|
* Mark 4.0 as releasedversion-4.0Sybren A. Stüvel2018-09-161-2/+2
|
* speedupyjqiang2018-09-166-6/+6
| | | "if A and B" if mostly A is True then we should judge B at first
* Moved `get_word_alignment()` from `_compat.py` to `machine_size.py`Sybren A. Stüvel2018-09-162-3/+77
| | | | | | In preparation of removal of Python 2.7 support, I only want to have compatibility code for Python 2.7 in `_compat.py`, and not other kinds of 'compatibility'.
* Add support for SHA224 for PKCS1 signaturesJoost Rijneveld2018-02-051-2/+4
|
* Remove duplicate hash method definitionJoost Rijneveld2018-02-051-10/+2
| | | | | | | There is no need to specify this list in PKCS1_v2 when it is already specified in PKCS1. This does rely on the digest_size attribute being available, but pkcs1.py already depends heavily on the specific API of hashlib.
* PKCS#1 2.0: Implementation of MGF1 (#89)Michael Manganiello2017-06-102-1/+112
| | | | Implementation of the Mask Generation Function `MGF1` used in the OAEP encoding step. For more information, the MGF1 specification is at https://tools.ietf.org/html/rfc2437#section-10.2.1
* Support signing a pre-calculated hash (#87)Justin Simon2017-05-072-18/+37
| | | | | | | | | | | | | | | | | | | | | | | | | | * Split the hashing out of the sign method This code change adds support to split the hashing of a message and the actual signing of the message. * Updating unit test and documentation This commit updates the unit test and usage docs. In addition, This change removes a redundant error check inside rsa.sign(). * Refactore unit tests and code comments Removed the print statements from the unit test and refactored a few code comments to improve readability. * Rename hash function The new hash function had the same name as a function in the standard library. This commit changes the name to avoid conflicts. * Rename hash function to compute_hash() This commit renames the hash function to compute_hash().
* Ceiling division implementation (#88)Michael Manganiello2017-04-181-3/+25
| | | | Created as a new function as it will be needed by the new PKCS#1 2.0 implementation. Specifically, for the MGF1 function used in the OAEP encoding/decoding. This allows us not to have `math` dependencies
* Feature request #78: Expose function to find the hash method of a signatureSybren A. Stüvel2017-04-102-2/+22
| | | | | | I've not used the name "find_method_hash" suggested in #78, as it's a bit vague. It's ok-ish for a private function `_find_method_hash`, but I thought `find_signature_hash` would be more descriptive.
* Use iterative zip in Python 2 (#85)Michael Manganiello2017-01-173-1/+6
| | | Good catch, thanks!
* Implementation of bitwise XOR function for bytes object (#72)Michael Manganiello2017-01-161-0/+21
|
* Create PY2 constant to simplify compatibility decisions (#82)Michael Manganiello2017-01-152-20/+19
| | | It's about time to get this merged, thanks again!
* Remove custom PrivateKey exponents/coefficient (#71)Michael Manganiello2017-01-051-32/+25
| | | Thanks for the improvements!
* Fixes a typo in docstrings (#83)Alexandr2016-11-081-2/+2
|
* Drop byte_literal in favour of b''adamantike2016-05-085-61/+40
|
* Update security warning (#70)Michael Manganiello2016-05-081-3/+2
|
* xrange compatibility optimization for Python 2 (#69)Michael Manganiello2016-05-087-3/+15
|
* Remove sys.maxint fallback usageadamantike2016-04-231-5/+1
|
* Drop psyco usageSybren A. Stüvel2016-04-231-10/+0
|
* Trivial fix on primality testingadamantike2016-04-161-1/+1
|
* Set Miller-Rabin rounds based on bitsizeadamantike2016-04-151-8/+32
|
* Implemented __hash__ function for key objects.Sybren A. Stüvel2016-03-291-0/+6
| | | | | | Overriding __eq__ blocks inheritance of __hash__ in Python 3. Fixes issue #55
* No longer require string operations to find bit lengths.Sybren A. Stüvel2016-03-291-37/+4
| | | | | Now that we no longer support Python 2.6, we can use int.bit_length() instead. Co-authored by @adamantike.
* Introduced NotRelativePrimeError exception.Sybren A. Stüvel2016-03-292-4/+15
| | | | | | This makes catching exceptions slightly stronger, as it is now possible to check for this specific exception. Furthermore, information about the not-prime numbers is included in the exception object.
* Added unittest for rsa.common.inverseSybren A. Stüvel2016-03-291-1/+1
| | | | | This unittest tests both execution branches of the function, reducing randomness of code coverage.
* PEP8 formattingSybren A. Stüvel2016-03-291-9/+9
|
* Merge branch 'version-3.4-fix-changelog'Sybren A. Stüvel2016-03-291-1/+1
|\
| * Bumped version to 3.4.2Sybren A. Stüvel2016-03-291-2/+2
| |
* | Merge branch 'version-3.4-repackaging'Sybren A. Stüvel2016-03-261-1/+1
|\ \ | |/
| * Bumped version to 3.4.1Sybren A. Stüvel2016-03-261-2/+2
| |
* | Using set instead of list, it's faster.Sybren A. Stüvel2016-03-171-1/+1
| |
* | Removed a doctest, it's covered by a unit test anyway.Sybren A. Stüvel2016-03-171-2/+0
| |
* | More CLI tests & clearer bytes stuffSybren A. Stüvel2016-03-172-12/+67
| | | | | | | | | | Ensuring that bytes are written correctly on all supported Python versions, including when writing to stdout.
* | Ensuring that PEM output is always in bytes.Sybren A. Stüvel2016-03-172-6/+10
| | | | | | | | | | This may break some applications. However, it does make the RSA library easier to use on different Python versions.
* | Removed deprecated functionality.Sybren A. Stüvel2016-03-176-1369/+24
| | | | | | | | | | | | | | | | | | | | | | The following modules have been removed: - rsa._version133 - rsa._version200 - rsa.bigfile - rsa.varblock The encrypt/decrypt-bigfile CLI commands have also been removed.
* | Bumped version to 4.0-alphaSybren A. Stüvel2016-03-171-1/+1
|/
* Bumped to version 3.4Sybren A. Stüvel2016-03-171-2/+2
|
* Allow loading PEM from strings (not just bytes), closes issue #49Sybren A. Stüvel2016-03-171-0/+4
|
* Remove list comprehension used for method executionadamantike2016-03-171-2/+6
|
* Prevent possible infinite loops.Sybren A. Stüvel2016-03-171-3/+8
|
* Remove Solovay-Strassen implementationadamantike2016-03-171-63/+0
|
* Use Miller-Rabin primality testingadamantike2016-03-171-1/+70
|
* Use specific function for odd integer generationadamantike2016-03-173-8/+15
|
* Correct doctest returns for 'are_relatively_prime'adamantike2016-02-051-2/+2
|
* Remove unneeded conditional on Jacobi functionadamantike2016-02-051-2/+0
|
* Bumped version to 3.4-beta1Sybren A. Stüvel2016-02-051-1/+1
|
* Updated documentation, mostly http -> https changesSybren A. Stüvel2016-02-0518-19/+19
| | | | | | Also: - changed http to https in the code - changed header underlines in the documentation to match the header length
* Fixed PEP8 style issuesSybren A. Stüvel2016-01-273-11/+15
|
* Fix #18: Add an 'exponent' argument to key.newkeys()Sybren A. Stüvel2016-01-271-15/+41
| | | | | | | | Adds the possibility to create a new key using a custom exponent. Mostly for compatibility. Also removed the unused parameter nbits from calculate_keys(). I added a new function calculate_keys_custom_exponent() so that people still passing a value to nbits don't accidentally use it as the exponent.