rsademo.py

import sys
import hashlib
import random

def is_prime(n,k=40):
 if n<2:return False
 for p in[2,3,5,7,11,13,17,19,23,29]:
  if n<p*p:return n>1
  if n%p==0:return False
 s,d=0,n-1
 while d%2==0:d,s=d>>1,s+1
 for i in range(k):
  x=pow(random.randint(2,n-2),d,n)
  if x==1 or x==n-1:continue
  for r in range(1,s):
   x=pow(x,2,n)
   if x==n-1:break
  else:return False
 return True

def sample_prime():
 p = random.randint(2**1023,2**1024-1)
 while not is_prime(p):p=random.randint(2**1023,2**1024-1)
 return p


if __name__ == '__main__':
 p = sample_prime()
 q = sample_prime()
 N = p*q

 print('RSA modulus N: ', hex(N))

 # Compute the hash
 h = hashlib.sha256(N.to_bytes(256, 'big')).digest()
 print('sha2(N):', h.hex())


 ### Remote attestation
 
 # Set the user data
 with open("/dev/attestation/user_report_data", "wb") as f:
  f.write(h)
  
 # Read the quote
 with open("/dev/attestation/quote", "rb") as f:
  quote = f.read()

 # Write the quote
 print("quote")
 print(quote.hex())