Ensure that RSA signatures have the correct length

third_party/tlslite/tlslite/utils/cryptomath.py

 """cryptomath module
 
 This module has basic math/crypto code."""
 
 import os
 import math
 import base64
 import binascii
 
 # The sha module is deprecated in Python 2.6 
@@ skipping 111 matching lines @@
 
 def bytesToNumber(bytes):
     total = 0L
     multiplier = 1L
     for count in range(len(bytes)-1, -1, -1):
         byte = bytes[count]
         total += multiplier * byte
         multiplier *= 256
     return total
 
-def numberToBytes(n):
-    howManyBytes = numBytes(n)
+def numberToBytes(n, howManyBytes=None):
+    if howManyBytes == None:
+      howManyBytes = numBytes(n)
     bytes = createByteArrayZeros(howManyBytes)
     for count in range(howManyBytes-1, -1, -1):
         bytes[count] = int(n % 256)
         n >>= 8
     return bytes
 
 def bytesToBase64(bytes):
     s = bytesToString(bytes)
     return stringToBase64(s)
 
@@ skipping 258 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