summaryrefslogtreecommitdiffhomepage
diff options
context:
space:
mode:
authorJeff Forcier <jeff@bitprophet.org>2014-04-14 10:50:28 -0400
committerJeff Forcier <jeff@bitprophet.org>2014-04-14 10:50:28 -0400
commitfa86d655dc8f08eb9171930c41b508e2bee08b08 (patch)
treed744730f04ba7a3e90659aac5428933fad54d550
parent1e0e296b05a3e63b33291cfe3d688a435f592c3c (diff)
parent23528069ec2d14464c8cb5754cca8e039692f255 (diff)
Merge pull request #296 from alex/remove-unused
Remove unused function
-rw-r--r--paramiko/primes.py20
1 files changed, 0 insertions, 20 deletions
diff --git a/paramiko/primes.py b/paramiko/primes.py
index 58d158c8..5279b1a5 100644
--- a/paramiko/primes.py
+++ b/paramiko/primes.py
@@ -20,31 +20,11 @@
Utility functions for dealing with primes.
"""
-from Crypto.Util import number
-
from paramiko import util
from paramiko.py3compat import byte_mask, long
from paramiko.ssh_exception import SSHException
-def _generate_prime(bits, rng):
- """primtive attempt at prime generation"""
- hbyte_mask = pow(2, bits % 8) - 1
- while True:
- # loop catches the case where we increment n into a higher bit-range
- x = rng.read((bits + 7) // 8)
- if hbyte_mask > 0:
- x = byte_mask(x[0], hbyte_mask) + x[1:]
- n = util.inflate_long(x, 1)
- n |= 1
- n |= (1 << (bits - 1))
- while not number.isPrime(n):
- n += 2
- if util.bit_length(n) == bits:
- break
- return n
-
-
def _roll_random(rng, n):
"""returns a random # from 0 to N-1"""
bits = util.bit_length(n - 1)