摘要:
题目: from Crypto.Util.number import isPrime from secret import flag import random m = int.from_bytes(flag) def getMyPrime(nbits, d): print(d) s = rando 阅读全文
posted @ 2025-03-11 22:04
sevensnight
阅读(63)
评论(0)
推荐(0)
摘要:
攻击阐述 我们用b'\x00'替换消息中的x这样就有了(m+x)^e mod n=c m知道一部分 x是b'\x00\x00******'未知的 (e,n)是公钥,c是密文 问题变为如何找到x Coppersmith可以解决了这个问题 (这种题本质上就是已知m高位Coppersmith求小根的变体) 阅读全文
posted @ 2025-03-11 21:54
sevensnight
阅读(67)
评论(0)
推荐(2)
摘要:
题目: from Crypto.Util.number import * m = bytes_to_long(b'NSSCTF{******}') p = getPrime(512) q = getPrime(512) n = p*q e = 9 r = getPrime(512) c1 = pow 阅读全文
posted @ 2025-03-11 21:53
sevensnight
阅读(38)
评论(0)
推荐(0)
摘要:
反素数,英文称作emirp(prime(素数)的左右颠倒拼写),是素数的一种,把一个素数的阿拉伯字数字序列(十进制)变成由低位向高位反写出来,得到的另一个数还是素数,例如素数<font style="color:rgb(32, 33, 34);">13</font>,反写就是<font style= 阅读全文
posted @ 2025-03-11 21:53
sevensnight
阅读(97)
评论(0)
推荐(0)
摘要:
题目: from Crypto.Util.number import * flag = b'NSSCTF{******}' p = getPrime(512) q = getPrime(512) n = p*q e = 3 m1 = bytes_to_long(flag) a = getPrime( 阅读全文
posted @ 2025-03-11 21:53
sevensnight
阅读(25)
评论(0)
推荐(0)
摘要:
题目1: from Crypto.Util.number import * import random from sympy import prime FLAG=b'hgame{xxxxxxxxxxxxxxxxxx}' e=0x10001 def primorial(num): result = 1 阅读全文
posted @ 2025-03-11 21:52
sevensnight
阅读(121)
评论(0)
推荐(0)
摘要:
题目: from Crypto.Util.number import * flag = b'NSSCTF{******}' m = bytes_to_long(flag) a = getPrime(512) b = getPrime(512) c = getPrime(512) d = getPri 阅读全文
posted @ 2025-03-11 21:52
sevensnight
阅读(61)
评论(0)
推荐(0)
摘要:
题目: from Crypto.Util.number import * from secret import flag def genKey(nbits): p = getPrime(nbits) q = getPrime(nbits) N = p*p*q d = inverse(N, (p-1) 阅读全文
posted @ 2025-03-11 21:52
sevensnight
阅读(41)
评论(0)
推荐(0)
摘要:
题目: from Crypto.Util.number import * def generkey(k): p, q = getPrime(k), getPrime(k) pubkey = p**2 * q n = pubkey l = (p-1)*(q-1) / gcd(p-1, q-1) pri 阅读全文
posted @ 2025-03-11 21:52
sevensnight
阅读(55)
评论(0)
推荐(0)
摘要:
题目: from Crypto.Util.number import * flag = b'NSSCTF{******}' p = getPrime(512) q = getPrime(512) n = p*p*q e = n c = pow(bytes_to_long(flag), e, n) d 阅读全文
posted @ 2025-03-11 21:52
sevensnight
阅读(37)
评论(0)
推荐(0)

浙公网安备 33010602011771号