def getHForCT(): return "8b655970153799af2aeadc9ff1add0ea6c7251d54154cfa92c173a0dd39c1f94" A = MiniNero.publicFromInt(1) H = MiniNero.hashToPoint_ct(A) Translator.hexToC(H) print(H) return H
def getH2ForCT(): A = MiniNero.publicFromInt(1) HPow2 = MiniNero.hashToPoint_ct(A) two = MiniNero.intToHex(2) H2 = [None] * 64 for i in range(0, 64): Translator.hexToCComma(HPow2) H2[i] = HPow2 HPow2 = MiniNero.scalarmultKey(HPow2, two) return H2
def getH2ForCT(): A = MiniNero.publicFromInt(1) HPow2 = MiniNero.hashToPoint_ct(A) two = MiniNero.intToHex(2) H2 = [None] * ATOMS for i in range(0, ATOMS): #Translator.hexToCComma(HPow2) H2[i] = HPow2 HPow2 = MiniNero.scalarmultKey(HPow2, two) return H2
def getHForCT(): A = MiniNero.publicFromInt(123456) return MiniNero.hashToPoint_ct(A)
t = raw_input("13 or 25 words?") a = MiniNero.electrumChecksum(t) print(a) if sys.argv[1] == "1224": #sohuld turn 12 word key to 24 print("tbd") sk = "536313cc0a88457e3d3e5aadda8d204af20e480416cc522ebd5a67df00ce2503" print(MiniNero.getAddr(sk)) if sys.argv[1] == "seed": seed = "3c817618dcbfed122a64e592bb441d73300da9123686224a84e0eab1f075117e"; a = MiniNero.hexToInt(seed) b = a // l print(b) if sys.argv[1] == "HCT": for i in [1, 12, 123, 1234, 12345, 123456]: A = MiniNero.publicFromInt(i) print(i, MiniNero.hashToPoint_ct(A)) if sys.argv[1] == "RingCTSimple": #see below for ring ct with sliding exponents exponent = 9 H_ct = RingCT.getHForCT() print("H", H_ct) sr, Pr = PaperWallet.skpkGen() #receivers private/ public se, pe, ss1, ss2 = Ecdh.ecdhGen(Pr) #compute shared secret ss digits = 32 #in practice it could will be 32 (from .0001 monero to ~400k monero) all other amounts can be represented by full 64 if necessary, otherwise you can use the sliding implementation of RingCT given below. print("inputs") a = 10000 Cia, L1a, s2a, sa, ska = RingCT.genRangeProof(10000, digits) print("outputs") b = 7000 Cib, L1b, s2b, sb, skb = RingCT.genRangeProof(7000, digits)
t = raw_input("13 or 25 words?") a = MiniNero.electrumChecksum(t) print(a) if sys.argv[1] == "1224": #sohuld turn 12 word key to 24 print("tbd") sk = "536313cc0a88457e3d3e5aadda8d204af20e480416cc522ebd5a67df00ce2503" print(MiniNero.getAddr(sk)) if sys.argv[1] == "seed": seed = "3c817618dcbfed122a64e592bb441d73300da9123686224a84e0eab1f075117e" a = MiniNero.hexToInt(seed) b = a // l print(b) if sys.argv[1] == "HCT": for i in [1, 12, 123, 1234, 12345, 123456]: A = MiniNero.publicFromInt(i) print(i, MiniNero.hashToPoint_ct(A)) if sys.argv[1] == "RingCTSimple": #see below for ring ct with sliding exponents exponent = 9 H_ct = RingCT.getHForCT() print("H", H_ct) sr, Pr = PaperWallet.skpkGen() #receivers private/ public se, pe, ss1, ss2 = Ecdh.ecdhGen(Pr) #compute shared secret ss digits = 32 #in practice it could will be 32 (from .0001 byterub to ~400k byterub) all other amounts can be represented by full 64 if necessary, otherwise you can use the sliding implementation of RingCT given below. print("inputs") a = 10000 Cia, L1a, s2a, sa, ska = RingCT.genRangeProof(10000, digits) print("outputs") b = 7000 Cib, L1b, s2b, sb, skb = RingCT.genRangeProof(7000, digits)