e744336385
C-6: ConnectorRuntime enforces capability_mask per operation.
READ-only ACs cannot invoke MUTATE operations (wipe, lock, retire).
C-7: AC validated against database (exists, active, not expired)
before connector invocation.
C-9: Delegated AC capability bounded by delegator's capability.
C-10: Command counter uses atomic SQL increment with limit check.
M-23: expire_stale() uses same atomic SQL pattern.
H-1: Sensitive credential fields hidden from repr/logs via repr=False.
H-2: Stub backend requires ALLOW_STUB_CREDENTIALS=true to activate.
H-3: Kerberos backend raises CredentialResolutionError instead of
returning stub ticket.
H-4: Chronicle INTENT emitted before execution, RESULT after.
H-5: device_id validated as UUID before Graph API URL interpolation.
H-8: ConnectorRuntime enforces governance for all connector invocations.
Signed-off-by: Tyler King <tking@guildhouse.dev>
96 lines
2.3 KiB
Python
96 lines
2.3 KiB
Python
# 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")
|