diff options
| -rw-r--r-- | CHANGELOG.md | 2 | ||||
| -rw-r--r-- | rsa/key.py | 4 |
2 files changed, 2 insertions, 4 deletions
diff --git a/CHANGELOG.md b/CHANGELOG.md index 3781be9..969ef2e 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -12,6 +12,8 @@ - Use the Chinese Remainder Theorem when decrypting with a private key. This makes decryption 2-4x faster ([#163](https://github.com/sybrenstuvel/python-rsa/pull/163)). +- Remove debug logging from `rsa/key.py` + ([#194](https://github.com/sybrenstuvel/python-rsa/pull/194)). ## Version 4.7.2 - released 2021-02-24 @@ -31,7 +31,6 @@ of pyasn1. """ -import logging import threading import typing import warnings @@ -43,7 +42,6 @@ import rsa.randnum import rsa.core -log = logging.getLogger(__name__) DEFAULT_EXPONENT = 65537 @@ -669,9 +667,7 @@ def find_p_q( qbits = nbits - shift # Choose the two initial primes - log.debug("find_p_q(%i): Finding p", nbits) p = getprime_func(pbits) - log.debug("find_p_q(%i): Finding q", nbits) q = getprime_func(qbits) def is_acceptable(p: int, q: int) -> bool: |