Gecko [ biogenelab.eu ]

Name	Size	Permission
__init__.py	3.83 KB	-rw-r--r--
__init__.pyc	3.69 KB	-rw-r--r--
_version.py	81 B	-rw-r--r--
_version.pyc	270 B	-rw-r--r--
_winapi.py	8.09 KB	-rw-r--r--
_winapi.pyc	10.21 KB	-rw-r--r--
agent.py	11.22 KB	-rw-r--r--
agent.pyc	14.88 KB	-rw-r--r--
auth_handler.py	26.81 KB	-rw-r--r--
auth_handler.pyc	18.38 KB	-rw-r--r--
ber.py	4.23 KB	-rw-r--r--
ber.pyc	4.11 KB	-rw-r--r--
buffered_pipe.py	6.82 KB	-rw-r--r--
buffered_pipe.pyc	6.9 KB	-rw-r--r--
channel.py	43.84 KB	-rw-r--r--
channel.pyc	44.55 KB	-rw-r--r--
client.py	23.6 KB	-rw-r--r--
client.pyc	20.87 KB	-rw-r--r--
common.py	7.23 KB	-rw-r--r--
common.pyc	5.92 KB	-rw-r--r--
compress.py	1.22 KB	-rw-r--r--
compress.pyc	1.43 KB	-rw-r--r--
config.py	10.14 KB	-rw-r--r--
config.pyc	7.2 KB	-rw-r--r--
dsskey.py	6.62 KB	-rw-r--r--
dsskey.pyc	7.3 KB	-rw-r--r--
ecdsakey.py	6.17 KB	-rw-r--r--
ecdsakey.pyc	6.91 KB	-rw-r--r--
file.py	17.28 KB	-rw-r--r--
file.pyc	14.48 KB	-rw-r--r--
hostkeys.py	11.96 KB	-rw-r--r--
hostkeys.pyc	13.42 KB	-rw-r--r--
kex_gex.py	9.51 KB	-rw-r--r--
kex_gex.pyc	7.41 KB	-rw-r--r--
kex_group1.py	5.4 KB	-rw-r--r--
kex_group1.pyc	4.52 KB	-rw-r--r--
kex_group14.py	1.62 KB	-rw-r--r--
kex_group14.pyc	943 B	-rw-r--r--
kex_gss.py	24.21 KB	-rw-r--r--
kex_gss.pyc	19.37 KB	-rw-r--r--
message.py	9.96 KB	-rw-r--r--
message.pyc	12.45 KB	-rw-r--r--
packet.py	17.42 KB	-rw-r--r--
packet.pyc	14.08 KB	-rw-r--r--
pipe.py	3.91 KB	-rw-r--r--
pipe.pyc	5.37 KB	-rw-r--r--
pkey.py	13.68 KB	-rw-r--r--
pkey.pyc	14.19 KB	-rw-r--r--
primes.py	4.83 KB	-rw-r--r--
primes.pyc	3.36 KB	-rw-r--r--
proxy.py	4.08 KB	-rw-r--r--
proxy.pyc	3.63 KB	-rw-r--r--
py3compat.py	3.8 KB	-rw-r--r--
py3compat.pyc	5.52 KB	-rw-r--r--
resource.py	2.49 KB	-rw-r--r--
resource.pyc	2.21 KB	-rw-r--r--
rsakey.py	6.48 KB	-rw-r--r--
rsakey.pyc	7.31 KB	-rw-r--r--
server.py	29.36 KB	-rw-r--r--
server.pyc	31.58 KB	-rw-r--r--
sftp.py	6.06 KB	-rw-r--r--
sftp.pyc	5.66 KB	-rw-r--r--
sftp_attr.py	7.69 KB	-rw-r--r--
sftp_attr.pyc	6.92 KB	-rw-r--r--
sftp_client.py	31.28 KB	-rw-r--r--
sftp_client.pyc	31.32 KB	-rw-r--r--
sftp_file.py	18.63 KB	-rw-r--r--
sftp_file.pyc	18.26 KB	-rw-r--r--
sftp_handle.py	7.34 KB	-rw-r--r--
sftp_handle.pyc	7.43 KB	-rw-r--r--
sftp_server.py	18.06 KB	-rw-r--r--
sftp_server.pyc	14.22 KB	-rw-r--r--
sftp_si.py	11.65 KB	-rw-r--r--
sftp_si.pyc	12.51 KB	-rw-r--r--
ssh_exception.py	4.1 KB	-rw-r--r--
ssh_exception.pyc	4.95 KB	-rw-r--r--
ssh_gss.py	22.04 KB	-rw-r--r--
ssh_gss.pyc	19.97 KB	-rw-r--r--
transport.py	97.1 KB	-rw-r--r--
transport.pyc	86 KB	-rw-r--r--
util.py	9.64 KB	-rw-r--r--
util.pyc	11.74 KB	-rw-r--r--
win_pageant.py	4.07 KB	-rw-r--r--
win_pageant.pyc	4.13 KB	-rw-r--r--

Code Editor : primes.py

# Copyright (C) 2003-2007  Robey Pointer <robeypointer@gmail.com>
#
# This file is part of paramiko.
#
# Paramiko is free software; you can redistribute it and/or modify it under the
# terms of the GNU Lesser General Public License as published by the Free
# Software Foundation; either version 2.1 of the License, or (at your option)
# any later version.
#
# Paramiko is distributed in the hope that it will be useful, but WITHOUT ANY
# WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
# A PARTICULAR PURPOSE.  See the GNU Lesser General Public License for more
# details.
#
# You should have received a copy of the GNU Lesser General Public License
# along with Paramiko; if not, write to the Free Software Foundation, Inc.,
# 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA.

"""
Utility functions for dealing with primes.
"""

import os

from paramiko import util
from paramiko.py3compat import byte_mask, long
from paramiko.ssh_exception import SSHException
from paramiko.common import *

def _roll_random(n):
    """returns a random # from 0 to N-1"""
    bits = util.bit_length(n - 1)
    byte_count = (bits + 7) // 8
    hbyte_mask = pow(2, bits % 8) - 1

# so here's the plan:
    # we fetch as many random bits as we'd need to fit N-1, and if the
    # generated number is >= N, we try again.  in the worst case (N-1 is a
    # power of 2), we have slightly better than 50% odds of getting one that
    # fits, so i can't guarantee that this loop will ever finish, but the odds
    # of it looping forever should be infinitesimal.
    while True:
        x = os.urandom(byte_count)
        if hbyte_mask > 0:
            x = byte_mask(x[0], hbyte_mask) + x[1:]
        num = util.inflate_long(x, 1)
        if num < n:
            break
    return num

class ModulusPack (object):
    """
    convenience object for holding the contents of the /etc/ssh/moduli file,
    on systems that have such a file.
    """

def __init__(self):
        # pack is a hash of: bits -> [ (generator, modulus) ... ]
        self.pack = {}
        self.discarded = []

def _parse_modulus(self, line):
        timestamp, mod_type, tests, tries, size, generator, modulus = line.split()
        mod_type = int(mod_type)
        tests = int(tests)
        tries = int(tries)
        size = int(size)
        generator = int(generator)
        modulus = long(modulus, 16)

# weed out primes that aren't at least:
        # type 2 (meets basic structural requirements)
        # test 4 (more than just a small-prime sieve)
        # tries < 100 if test & 4 (at least 100 tries of miller-rabin)
        if (mod_type < 2) or (tests < 4) or ((tests & 4) and (tests < 8) and (tries < 100)):
            self.discarded.append((modulus, 'does not meet basic requirements'))
            return
        if generator == 0:
            generator = 2

# there's a bug in the ssh "moduli" file (yeah, i know: shock! dismay!
        # call cnn!) where it understates the bit lengths of these primes by 1.
        # this is okay.
        bl = util.bit_length(modulus)
        if (bl != size) and (bl != size + 1):
            self.discarded.append((modulus, 'incorrectly reported bit length %d' % size))
            return
        if bl not in self.pack:
            self.pack[bl] = []
        self.pack[bl].append((generator, modulus))

def read_file(self, filename):
        """
        :raises IOError: passed from any file operations that fail.
        """
        self.pack = {}
        with open(filename, 'r') as f:
            for line in f:
                line = line.strip()
                if (len(line) == 0) or (line[0] == '#'):
                    continue
                try:
                    self._parse_modulus(line)
                except:
                    continue

def get_modulus(self, min, prefer, max):
        bitsizes = sorted(self.pack.keys())
        if len(bitsizes) == 0:
            raise SSHException('no moduli available')
        good = -1
        # find nearest bitsize >= preferred
        for b in bitsizes:
            if (b >= prefer) and (b < max) and (b < good or good == -1):
                good = b
        # if that failed, find greatest bitsize >= min
        if good == -1:
            for b in bitsizes:
                if (b >= min) and (b < max) and (b > good):
                    good = b
        if good == -1:
            # their entire (min, max) range has no intersection with our range.
            # if their range is below ours, pick the smallest.  otherwise pick
            # the largest.  it'll be out of their range requirement either way,
            # but we'll be sending them the closest one we have.
            good = bitsizes[0]
            if min > good:
                good = bitsizes[-1]
        # now pick a random modulus of this bitsize
        n = _roll_random(len(self.pack[good]))
        return self.pack[good][n]

${this.title}

Code Editor : primes.py