Added bip039 functionality. Not tested yet

Author: Steve132

bitcoin/bip39.py

@@ -1,46 +1,46 @@
 import hashlib
 import os.path
-from bisect import bisect_right,bisect_left
-
-wordlist_english=list(open(os.path.join(os.path.dirpath(__file__),'english.txt'),'r'))
+from bisect import bisect_left
 
+wordlist_english=list(open(os.path.join(os.path.dirpath(os.path.realpath(__file__)),'english.txt'),'r'))
+def _eint_to_bytes(entint,entbits):
+	return binascii.unhexlify(hex(entint)[2:].zfill(entbits//4).rstrip("L"))
+	
 def entropy_cs(entbytes):
 	entropy_size=8*len(entbytes)
 	checksum_size=entropy_size//32
 	hd=hashlib.sha256(entbytes).hexdigest()
 	csint=int(hd,16) >> (256-checksum_size)
 	return csint,checksum_size
 
+def mnemonic_int_to_words(mint,mint_num_words,wordlist=wordlist_english):
+	backwords=[wordlist[(mint >> (11*x)) & 0x7FF].strip() for x in range(mint_num_words)]	
+	return backwords[::-1]
+	
 def entropy_to_words(entbytes,wordlist=wordlist_english):
+	if(len(entbytes) < 4 || len(entbytes) % 4 != 0):
+		raise ValueError("The size of the entropy must be a multiple of 4 bytes (multiple of 32 bits)")
 	entropy_size=8*len(entbytes)
 	csint,checksum_size = entropy_cs(entbytes)
 
 	mint=(entint << checksum_size) | csint
-	mnemonic_size=(entropy_size+checksum_size)/11
-	
-	backwords=[wordlist[(seedint >> (11*x)) & 0x7FF].strip() for x in range(seedsize)]
-	return reversed(backwords)
-
-	
-#def words_to_seed(words,wordlist=wordlist_english):
+	mint_num_words=(entropy_size+checksum_size)//11
 
+	return mnemonic_int_to_words(mint,mint_num_words,wordlist)
 
 def words_bisect(word,wordlist=wordlist_english):
 	lo=bisect_left(wordlist,word)
-	hi=lo
-	lw=len(word)
-	while(wordlist[hi][:lw]==word):
-		hi+=1
+	hi=len(wordlist)-bisect_left(wordlist[:lo:-1],word)
 
 	return lo,hi
 
 def words_split(wordstr,wordlist=wordlist_english):
 	def popword(wordstr,wordlist):
 		for fwl in range(1,9):
-			w=wordstr[:fwl]
+			w=wordstr[:fwl].strip()
 			lo,hi=words_bisect(w,wordlist)
 			if(hi-lo == 1):
-				return w,wordstr[fwl:]
+				return w,wordstr[fwl:].lstrip()
 			wordlist=wordlist[lo:hi]
 		raise Exception("Wordstr %s not found in list" %(w))
 
@@ -51,7 +51,33 @@ def popword(wordstr,wordlist):
 		words.append(head)
 	return words
 
-def words_verify(words):
-	pass
-	#if words in string, split them first.
+def words_to_mnemonic_int(words,wordlist=wordlist_english):
+	if(instance(words,str)):
+		words=words_split(words,wordlist)
+	return sum([wordlist.index(w) << (11*x) for x,w in enumerate(words[::-1])])
+
+def words_verify(words,wordlist=wordlist_english):
+	if(isinstance(words,str)):
+		words=words_split(words,wordlist)
 
+	mint = words_to_mnemonic_int(words,wordlist)
+	mint_bits=len(words)*11
+	cs_bits=mint_bits//32
+	entropy_bits=mint_bits-cs_bits
+	eint=mint >> cs_bits
+	csint=mint & ((1 << cs_bits)-1)
+	ebytes=_eint_to_bytes(eint,entropy_bits)
+	return csint == entropy_cs(ebytes)
+
+def mnemonic_to_seed(mnemonic_phrase,passphrase=""):
+	try:
+		from hashlib import pbkdf2_hmac
+		def pbkdf2_hmac_sha256(password,salt,iters=2048):
+			return pbkdf2_hmac(name='sha512',password=password,salt=salt,iters)
+	except:
+		from Crypto.Protocol.KDF import PBKDF2
+		from Crypto.Hash import SHA512,HMAC
+		
+		def pbkdf2_hmac_sha256(password,salt,iters=2048):
+			return PBKDF2(password=password,salt=salt,dkLen=64,count=iters,prf:lambda p,s: HMAC.new(p,s,SHA512).digest())
+	return pbkdf2_hmac_sha256(password=mnemonic_phrase,salt="mnemonic"+passphrase)