Update third_party/tlslite to 0.4.8.

third_party/tlslite/tlslite/utils/cryptomath.py

 # Authors: 
 #   Trevor Perrin
 #   Martin von Loewis - python 3 port
+#   Yngve Pettersen (ported by Paul Sokolovsky) - TLS 1.2
 #
 # See the LICENSE file for legal information regarding use of this file.
 
 """cryptomath module
 
 This module has basic math/crypto code."""
 from __future__ import print_function
 import os
 import math
 import base64
@@ skipping 61 matching lines @@
 def HMAC_MD5(k, b):
     k = compatHMAC(k)
     b = compatHMAC(b)
     return bytearray(hmac.new(k, b, hashlib.md5).digest())
 
 def HMAC_SHA1(k, b):
     k = compatHMAC(k)
     b = compatHMAC(b)
     return bytearray(hmac.new(k, b, hashlib.sha1).digest())
 
+def HMAC_SHA256(k, b):
+    k = compatHMAC(k)
+    b = compatHMAC(b)
+    return bytearray(hmac.new(k, b, hashlib.sha256).digest())
 
 # **************************************************************************
 # Converter Functions
 # **************************************************************************
 
 def bytesToNumber(b):
     total = 0
     multiplier = 1
     for count in range(len(b)-1, -1, -1):
         byte = b[count]
         total += multiplier * byte
         multiplier *= 256
-    # Force-cast to long to appease PyCrypto.
-    # https://github.com/trevp/tlslite/issues/15
-    return long(total)
+    return total
 
 def numberToByteArray(n, howManyBytes=None):
     """Convert an integer into a bytearray, zero-pad to howManyBytes.
 
     The returned bytearray may be smaller than howManyBytes, but will
     not be larger.  The returned bytearray will contain a big-endian
     encoding of the input integer (n).
     """    
     if howManyBytes == None:
         howManyBytes = numBytes(n)
@@ skipping 101 matching lines @@
         if power < 0:
             result = pow(base, power*-1, modulus)
             result = invMod(result, modulus)
             return result
         else:
             return pow(base, power, modulus)
 
 #Pre-calculate a sieve of the ~100 primes < 1000:
 def makeSieve(n):
     sieve = list(range(n))
-    for count in range(2, int(math.sqrt(n))):
+    for count in range(2, int(math.sqrt(n))+1):
         if sieve[count] == 0:
             continue
         x = sieve[count] * 2
         while x < len(sieve):
             sieve[x] = 0
             x += sieve[count]
     sieve = [x for x in sieve[2:] if x]
     return sieve
 
 sieve = makeSieve(1000)
@@ skipping 65 matching lines @@
         if (q >= high):
             q = getRandomNumber(low, high)
             q += 29 - (q % 30)
         #Ideas from Tom Wu's SRP code
         #Do trial division on p and q before Rabin-Miller
         if isPrime(q, 0, display=display):
             p = (2 * q) + 1
             if isPrime(p, display=display):
                 if isPrime(q, display=display):
                     return p