Gecko [ gtgates.com ]

Name	Size	Permission	Date
__pycache__	[ DIR ]	drwxr-xr-x	2024-02-12 23:56
__init__.py	1.57 KB	-rw-r--r--	2022-07-20 10:28
asn1.py	1.75 KB	-rw-r--r--	2021-03-29 21:17
cli.py	9.94 KB	-rw-r--r--	2021-11-24 09:39
common.py	4.75 KB	-rw-r--r--	2021-11-24 10:00
core.py	1.67 KB	-rw-r--r--	2021-11-24 10:00
key.py	27.62 KB	-rw-r--r--	2022-04-13 08:57
parallel.py	2.35 KB	-rw-r--r--	2021-03-29 21:17
pem.py	4.03 KB	-rw-r--r--	2021-03-29 21:17
pkcs1.py	16.3 KB	-rw-r--r--	2022-07-20 09:28
pkcs1_v2.py	3.47 KB	-rw-r--r--	2021-11-24 10:00
prime.py	5.18 KB	-rw-r--r--	2021-11-24 10:00
py.typed	64 B	-rw-r--r--	2021-03-24 09:26
randnum.py	2.69 KB	-rw-r--r--	2021-03-29 21:15
transform.py	2.22 KB	-rw-r--r--	2021-11-24 10:00
util.py	3.02 KB	-rw-r--r--	2021-03-29 21:17

Rename

#  Copyright 2011 Sybren A. Stüvel <sybren@stuvel.eu>
#
#  Licensed under the Apache License, Version 2.0 (the "License");
#  you may not use this file except in compliance with the License.
#  You may obtain a copy of the License at
#
#      https://www.apache.org/licenses/LICENSE-2.0
#
#  Unless required by applicable law or agreed to in writing, software
#  distributed under the License is distributed on an "AS IS" BASIS,
#  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
#  See the License for the specific language governing permissions and
#  limitations under the License.

"""Functions for parallel computation on multiple cores.

Introduced in Python-RSA 3.1.

.. note::

Requires Python 2.6 or newer.

"""

import multiprocessing as mp
from multiprocessing.connection import Connection

import rsa.prime
import rsa.randnum

def _find_prime(nbits: int, pipe: Connection) -> None:
    while True:
        integer = rsa.randnum.read_random_odd_int(nbits)

# Test for primeness
        if rsa.prime.is_prime(integer):
            pipe.send(integer)
            return

def getprime(nbits: int, poolsize: int) -> int:
    """Returns a prime number that can be stored in 'nbits' bits.

Works in multiple threads at the same time.

>>> p = getprime(128, 3)
    >>> rsa.prime.is_prime(p-1)
    False
    >>> rsa.prime.is_prime(p)
    True
    >>> rsa.prime.is_prime(p+1)
    False

>>> from rsa import common
    >>> common.bit_size(p) == 128
    True

"""

(pipe_recv, pipe_send) = mp.Pipe(duplex=False)

# Create processes
    try:
        procs = [mp.Process(target=_find_prime, args=(nbits, pipe_send)) for _ in range(poolsize)]
        # Start processes
        for p in procs:
            p.start()

result = pipe_recv.recv()
    finally:
        pipe_recv.close()
        pipe_send.close()

# Terminate processes
    for p in procs:
        p.terminate()

return result

__all__ = ["getprime"]

if __name__ == "__main__":
    print("Running doctests 1000x or until failure")
    import doctest

for count in range(100):
        (failures, tests) = doctest.testmod()
        if failures:
            break

if count % 10 == 0 and count:
            print("%i times" % count)

print("Doctests done")