85 |
printscheme(s) |
printscheme(s) |
86 |
schemes.append((n,s)) |
schemes.append((n,s)) |
87 |
|
|
88 |
|
# Integers whose products >= 160 |
89 |
|
tks = ( |
90 |
|
(2, 80), |
91 |
|
(3, 54), |
92 |
|
(4, 40), |
93 |
|
(5, 32), |
94 |
|
(6, 27), |
95 |
|
(7, 23), |
96 |
|
(8, 20), |
97 |
|
(9, 18), |
98 |
|
(10, 16), |
99 |
|
(11, 15), |
100 |
|
(12, 14), |
101 |
|
(13, 13), |
102 |
|
(14, 12), |
103 |
|
(15, 11), |
104 |
|
(16, 10), |
105 |
|
(18, 9), |
106 |
|
(20, 8), |
107 |
|
(23, 7), |
108 |
|
(27, 6), |
109 |
|
(32, 5), |
110 |
|
(40, 4), |
111 |
|
(54, 3), |
112 |
|
(80, 2), |
113 |
|
) |
114 |
|
|
115 |
if __name__ == '__main__': |
if __name__ == '__main__': |
116 |
|
|
117 |
|
if 1: |
118 |
|
|
119 |
|
def pzip(names, arrs): |
120 |
|
res = [] |
121 |
|
for i in range(0, len(arrs[0])): |
122 |
|
res.append(" + ".join([ |
123 |
|
"%s %s" % (arrs[name][i], names[name]) |
124 |
|
for name in range(0, len(names)) |
125 |
|
if arrs[name][i] != 0])) |
126 |
|
return res |
127 |
|
|
128 |
|
for N,n in tks: |
129 |
|
ss = key_boosting(N, |
130 |
|
merkle_hashtree(n, |
131 |
|
(0, 0, 1, 0, 0, 0, 0, 0))) |
132 |
|
sr = key_boosting(N, |
133 |
|
merkle_hashtree(n, |
134 |
|
(0, 0, 0, 1, 0, 0, 0, 0))) |
135 |
|
sh = key_boosting(N, |
136 |
|
merkle_hashtree(n, |
137 |
|
(0, 0, 0, 0, 1, 0, 0, 0))) |
138 |
|
sc0 = key_boosting(N, |
139 |
|
merkle_hashtree(n, |
140 |
|
(0, 0, 0, 0, 0, 1, 0, 0))) |
141 |
|
scs = key_boosting(N, |
142 |
|
merkle_hashtree(n, |
143 |
|
(0, 0, 0, 0, 0, 0, 1, 0))) |
144 |
|
scv = key_boosting(N, |
145 |
|
merkle_hashtree(n, |
146 |
|
(0, 0, 0, 0, 0, 0, 0, 1))) |
147 |
|
print "\n\n",N,n |
148 |
|
print "S,R:", pzip(("s'", "r'", "h'"), (ss, sr, sh)) [2:4] |
149 |
|
print "C0,Cs,Cv:", pzip(("C0'", "Cs'", "Cv'"), (sc0, scs, scv)) [5:] |
150 |
|
|
151 |
|
|
152 |
|
|
153 |
|
exit(0) |
154 |
|
|
155 |
ts = [] |
ts = [] |
156 |
ts.extend(range(1, 50)) |
ts.extend(range(1, 50)) |
157 |
ts.append(80) |
ts.append(80) |