OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	12/11/2024 09:39:44 AM	rwxr-xr-x
📄 __init__.py	1.51 KB	04/05/2021 03:08:16 PM	rw-r--r--
📁 __pycache__	-	02/11/2025 08:19:48 AM	rwxr-xr-x
📄 _compat.py	4.24 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 asn1.py	1.74 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 cli.py	8.99 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 common.py	4.46 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 core.py	1.62 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 key.py	23.96 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 machine_size.py	2.3 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 parallel.py	2.27 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 pem.py	3.48 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 pkcs1.py	14.35 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 pkcs1_v2.py	3.38 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 prime.py	4.95 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 randnum.py	2.58 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 transform.py	6.44 KB	04/05/2021 03:08:16 PM	rw-r--r--
📄 util.py	2.99 KB	04/05/2021 03:08:16 PM	rw-r--r--

Editing: parallel.py

# -*- coding: utf-8 -*-
#
#  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.

"""

from __future__ import print_function

import multiprocessing as mp

from rsa._compat import range
import rsa.prime
import rsa.randnum

def _find_prime(nbits, pipe):
    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, poolsize):
    """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')