remove spurious whitespace

Author: warner

ecdsa/ecdsa.py

@@ -24,7 +24,7 @@
   privkey = Private_key( pubkey, secret )
 
   # Signing a hash value:
- 
+
   hash = randrange( 1, n )
   signature = privkey.sign( hash, randrange( 1, n ) )
 
@@ -77,7 +77,7 @@ def __init__( self, generator, point ):
     """generator is the Point that generates the group,
     point is the Point that defines the public key.
     """
-    
+
     self.curve = generator.curve()
     self.generator = generator
     self.point = point
@@ -109,7 +109,7 @@ def verifies( self, hash, signature ):
     xy = u1 * G + u2 * self.point
     v = xy.x() % n
     return v == r
-    
+
 
 
 class Private_key( object ):
@@ -120,7 +120,7 @@ def __init__( self, public_key, secret_multiplier ):
     """public_key is of class Public_key;
     secret_multiplier is a large integer.
     """
-    
+
     self.public_key = public_key
     self.secret_multiplier = secret_multiplier
 
@@ -396,31 +396,31 @@ def test_signature_validity( Msg, Qx, Qy, R, S, expected ):
     0x6a223d00bd22c52833409a163e057e5b5da1def2a197dd15, \
     0x7b482604199367f1f303f9ef627f922f97023e90eae08abf, \
     True )
-  
+
   test_point_validity(
     p192, \
     0x6dccbde75c0948c98dab32ea0bc59fe125cf0fb1a3798eda, \
     0x0001171a3e0fa60cf3096f4e116b556198de430e1fbd330c8835, \
     False )
-  
+
   test_point_validity(
     p192, \
     0xd266b39e1f491fc4acbbbc7d098430931cfa66d55015af12, \
     0x193782eb909e391a3148b7764e6b234aa94e48d30a16dbb2, \
     False )
-  
+
   test_point_validity(
     p192, \
     0x9d6ddbcd439baa0c6b80a654091680e462a7d1d3f1ffeb43, \
     0x6ad8efc4d133ccf167c44eb4691c80abffb9f82b932b8caa, \
     False )
-  
+
   test_point_validity(
     p192, \
     0x146479d944e6bda87e5b35818aa666a4c998a71f4e95edbc, \
     0xa86d6fe62bc8fbd88139693f842635f687f132255858e7f6, \
     False )
-  
+
   test_point_validity(
     p192, \
     0xe594d4a598046f3598243f50fd2c7bd7d380edb055802253, \
@@ -550,18 +550,18 @@ def test_signature_validity( Msg, Qx, Qy, R, S, expected ):
   # further precautions are appropriate.)
 
   randrange = random.SystemRandom().randrange
-  
+
   secret = randrange( 1, n )
   pubkey = Public_key( g, g * secret )
   privkey = Private_key( pubkey, secret )
 
   # Signing a hash value:
-  
+
   hash = randrange( 1, n )
   signature = privkey.sign( hash, randrange( 1, n ) )
 
   # Verifying a signature for a hash value:
-  
+
   if pubkey.verifies( hash, signature ):
     print_("Demo verification succeeded.")
   else:

ecdsa/ellipticcurve.py

@@ -72,7 +72,7 @@ def __init__( self, curve, x, y, order = None ):
     # self.curve is allowed to be None only for INFINITY:
     if self.__curve: assert self.__curve.contains_point( x, y )
     if order: assert self * order == INFINITY
- 
+
   def __eq__( self, other ):
     """Return True if the points are identical, False otherwise."""
     if self.__curve == other.__curve \
@@ -84,7 +84,7 @@ def __eq__( self, other ):
 
   def __add__( self, other ):
     """Add one point to another point."""
-    
+
     # X9.62 B.3:
 
     if other == INFINITY: return self
@@ -103,7 +103,7 @@ def __add__( self, other ):
 
     x3 = ( l * l - self.__x - other.__x ) % p
     y3 = ( l * ( self.__x - x3 ) - self.__y ) % p
-    
+
     return Point( self.__curve, x3, y3 )
 
   def __mul__( self, other ):
@@ -139,7 +139,7 @@ def leftmost_bit( x ):
 
   def __rmul__( self, other ):
     """Multiply a point by an integer."""
-    
+
     return self * other
 
   def __str__( self ):
@@ -162,7 +162,7 @@ def double( self ):
 
     x3 = ( l * l - 2 * self.__x ) % p
     y3 = ( l * ( self.__x - x3 ) - self.__y ) % p
-    
+
     return Point( self.__curve, x3, y3 )
 
   def x( self ):
@@ -173,13 +173,13 @@ def y( self ):
 
   def curve( self ):
     return self.__curve
-  
+
   def order( self ):
     return self.__order
 
 
 # This one point is the Point At Infinity for all purposes:
-INFINITY = Point( None, None, None )  
+INFINITY = Point( None, None, None )
 
 def __main__():
 

ecdsa/numbertheory.py

@@ -92,9 +92,7 @@ def polynomial_multiply_mod( m1, m2, polymod, p ):
 
   return polynomial_reduce_mod( prod, polymod, p )
 
-  
 
-  
 def polynomial_exp_mod( base, exponent, polymod, p ):
   """Polynomial exponentiation modulo a polynomial over ints mod p.
 
@@ -146,7 +144,6 @@ def jacobi( a, n ):
   if a1 == 1: return s
   if n%4 == 3 and a1%4 == 3: s = -s
   return s * jacobi( n % a1, a1 )
-  
 
 
 
@@ -163,7 +160,7 @@ def square_root_mod_prime( a, p ):
 
   if a == 0: return 0
   if p == 2: return a
-  
+
   jac = jacobi( a, p )
   if jac == -1: raise SquareRootError( "%d has no square root modulo %d" \
                                        % ( a, p ) )
@@ -291,7 +288,7 @@ def factorization( n ):
             count = count + 1
           result.append( ( d, count ) )
       if n > 1: result.append( ( n, 1 ) )
-        
+
   return result
 
 
@@ -405,12 +402,12 @@ def is_prime( n ):
   Miller-Rabin was (19999999 - 10000001)*(2/3)*(4/5)*(6/7)
   = 4.57 million.
   """
-  
+
   # (This is used to study the risk of false positives:)
   global miller_rabin_test_count
 
   miller_rabin_test_count = 0
-  
+
   if n <= smallprimes[-1]:
     if n in smallprimes: return True
     else: return False
@@ -496,7 +493,7 @@ def next_prime( starting_value ):
 miller_rabin_test_count = 0
 
 def __main__():
-  
+
   # Making sure locally defined exceptions work:
   # p = modular_exp( 2, -2, 3 )
   # p = square_root_mod_prime( 2, 3 )

ecdsa/rfc6979.py

@@ -1,14 +1,12 @@
 '''
-           
 RFC 6979:
     Deterministic Usage of the Digital Signature Algorithm (DSA) and
     Elliptic Curve Digital Signature Algorithm (ECDSA)
 
     http://tools.ietf.org/html/rfc6979
-    
+
 Many thanks to Coda Hale for his implementation in Go language:
     https://github.com/codahale/rfc6979
-
 '''
 
 import hmac
@@ -38,34 +36,34 @@ def bit_length(num):
 def bits2int(data, qlen):
     x = int(hexlify(data), 16)
     l = len(data) * 8
-    
+
     if l > qlen:
         return x >> (l-qlen)
-    return x    
+    return x
 
 def bits2octets(data, order):
     z1 = bits2int(data, bit_length(order))
     z2 = z1 - order
-    
+
     if z2 < 0:
         z2 = z1
-        
+
     return number_to_string_crop(z2, order)
-    
+
 # https://tools.ietf.org/html/rfc6979#section-3.2
 def generate_k(generator, secexp, hash_func, data):
     '''
         generator - ECDSA generator used in the signature
         secexp - secure exponent (private key) in numeric form
         hash_func - reference to the same hash function used for generating hash
-        data - hash in binary form of the signing data 
+        data - hash in binary form of the signing data
     '''
-    
+
     qlen = bit_length(generator.order())
     holen = hash_func().digest_size
     rolen = (qlen + 7) / 8
     bx = number_to_string(secexp, generator.order()) + bits2octets(data, generator.order())
-    
+
     # Step B
     v = b('\x01') * holen
 
@@ -74,11 +72,11 @@ def generate_k(generator, secexp, hash_func, data):
 
     # Step D
 
-    k = hmac.new(k, v+b('\x00')+bx, hash_func).digest() 
+    k = hmac.new(k, v+b('\x00')+bx, hash_func).digest()
 
     # Step E
     v = hmac.new(k, v, hash_func).digest()
-    
+
     # Step F
     k = hmac.new(k, v+b('\x01')+bx, hash_func).digest()