• pem文件类解析

    pem文件

    pem格式的文件通常用于数字证书认证机构(Certificate Authorities，CA)，其文件形式主要为base64编码的文件，头尾有类似于-----BEGIN PUBLIC KEY-----和-----END PUBLIC KEY-----的头尾标记。

    生成公私钥

    在python中，可以通过安装包from Crypto.PublicKey import RSA生成想要的公私钥文件

    public key
    1. from Crypto.PublicKey import RSA
    2. from Crypto.Util.number import *
    3. p,q = getPrime(512),getPrime(512)
    4. n = p * q
    5. e = 0x10001
    6. pub = RSA.construct((n,e))
    7. with open('out.pem','wb') as f:
    8.     f.write(pub.exportKey('PEM'))
    9. with open('out.pem','rb') as f:
    10.     print(f.read().decode())
    11. '''
    12. -----BEGIN PUBLIC KEY-----
    13. MIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQCuRPouMRTcLWPBEUlhjCrZ6MNQ
    14. rSy29BrHjH4+lGMykB23azPtT9fk7IsEFXoodm6tsPL8kheJ6cP+0WPldlQOw/K3
    15. c9LUGzeCCAhNJuBjUoeW32ruE2HS7RoIF6vkP36zLs167ZZMK7Fg0cqW6VNXoJHT
    16. zaKdqysBe+3W1VHl6QIDAQAB
    17. -----END PUBLIC KEY-----
    18. '''
    private key
    1. from Crypto.PublicKey import RSA
    2. from Crypto.Util.number import *
    3. p,q = getPrime(512),getPrime(512)
    4. n = p * q
    5. e = 0x10001
    6. d = inverse(e,(p - 1) * (q - 1))
    7. pub = RSA.construct((n,e,d,p,q))
    8. with open('out.pem','wb') as f:
    9.     f.write(pub.exportKey('PEM'))
    10. with open('out.pem','rb') as f:
    11.     print(f.read().decode())
    12. '''
    13. -----BEGIN RSA PRIVATE KEY-----
    14. MIICXAIBAAKBgQCnHIvLP0IERPVRaED+71dlCRBcm3be4jlHgqVqIIXyIvrzc8ZC
    15. IIbIDqlBybNgq32i6PVlzBCsWiiTfBYS6J24qCjYVTywKk+yieNshieNNohmvQRF
    16. bZOZITJiP99URkhtGWo3trQfoAZEQ7NfMoS1N3PDvPet1lMfFK81AyWt1wIDAQAB
    17. AoGAIq74DK0KZJxzVfwPUVoXh27EKJRTrZrCTKc+8bHiWwkLkK+8vEjH8Imqc28L
    18. fcrZ/o/fLsuVwk/MECA27KG+6hiRPJDWZmFgCInCABuhd+xitSBciMSGrO5ITjoq
    19. YdgMsR5xJTI8vhXIJ1iCkkCz6fD6Di7s+3n/+Ti3iuK87jECQQDOY/pLyH0ppOk0
    20. 49pieQRshckQMXqsKhahEDZmWMu70JqDLF0U3aIfup1R87uogB8hJj8+K5RQavG4
    21. 4l0W5ghTAkEAz0eTNEWTe2iJ/Dq+8JKTN/MA/a8MiG7wvAkXqjx+B+Eow77IdoN8
    22. D5ehD0x6ou73yaorTddidDAplNmvyq0D7QJAJbcPXhndBWclVozss2H59Prdqx/f
    23. kuZ+DCCyUDGZyVBta9sHh3CY18N6TCeF+1yuU5hxpiLAj5F7apWy/SQ8EQJBAMtv
    24. AxGda6cGLc8o1PeF1AlobUONxy4sPAdAoUJKRqNzH7AmEdcHKv6eoctDE2XQRc9e
    25. PUwTpSRFlLnrgLXZYu0CQBKKT+oY4ssnwKDQqGPsh9MtPyilySL9sWJilk1cSXmQ
    26. Xm7gjDq5S/x4k1gJyQFXbUnxTfsbLWs6BljHHlKSRes=
    27. -----END RSA PRIVATE KEY-----
    28. '''

    如果是生成一组随机的公私钥文件，可以直接直接使用RSA.generate(bits)，其中的bits参数为生成的公钥文件中n的二进制位数，且bits>=1024，默认为1024。

    1. from Crypto.PublicKey import RSA
    2. from Crypto.Util.number import *
    3. key = RSA.generate(1024)
    4. print(key.publickey)
    5. with open('out.pem','wb') as f:
    6.     f.write(key.exportKey('PEM'))
    7. with open('out.pem','rb') as f:
    8.     print(f.read().decode())
    9. '''
    11. -----BEGIN RSA PRIVATE KEY-----
    12. MIICXQIBAAKBgQCOTfkFWAc5UsCT07Y4bU9jKfpT5pt+ScHFIk/39jsE8yDHSFAo
    13. pcQMlJ6GKRYfU7F/3xbY2udbvXBj9jJVLBmh3ORbZT06xwYDeqhvE2kJB+QfGk+J
    14. POqzjCkFiDorxMUzWEq4us8nXmkv6WsrJMGSQZ0SQ7c29N9M0/8K622JvwIDAQAB
    15. AoGAJyntaVuXLV8JcgW3piLrUNLKOpICZEi/Q9ZUJN2G069n64CK0wz//ihe0nR3
    16. SqrZdGQ84PSp7LUfu9sTch5fdSQLH/OAQtVf/rwWuwulm8wS0njrU9xxQQWrwZoe
    17. L9W7DlBWf5+PbmYdgyoLIwL3+wskvxiWswlvVcSR7RkXGiUCQQC+J0pN+1W2U3qe
    18. a8rhAwX7XMSXoblFuqfBfH/duLZvseEEjtuTcj0ISlJgts2aZT1J8yHnllUoiqAu
    19. WQPUK/rTAkEAv5T6OwPHj+4J/4WzQgJTN89Xj9ihR45wpr8Rr6WPXUCgXTe82UFz
    20. ny68nIzALvKrLTf58yu8/E5wy2+SejBJ5QJASNUnwsK3y8QhvTgwVwsfaW3Y5vNM
    21. 0YZy5stW9offaNzLAUHunIUvF1PQRbb+/Vo1pXN40wljyMmAHQB/VO8bfQJBAIGQ
    22. nVKAEdyzHavjngHMVL9vyEYOObSNDn6Wxb1GeJiWdl3UrjE35JwJHaG6Rtb5Yu7n
    23. 5nCgaeUwn3PV9vgP5EkCQQCWIiD5b8Qb5Mma8/iDNhchmRkosUug/iCBeqNh3nJc
    24. txZnUy1fjc0toXxJY3ZBzTl3TNsk8p8x4H9y/NXoDtvu
    25. -----END RSA PRIVATE KEY-----
    26. '''

    有n,e,d,p,q,u个6个参数，其中$u=p^{-1} \bmod q$。

    使用公私钥加密或解密文件

    在python中，利用公私钥文件，通过PKCS1_OAEP算法填充可以实现加解密，例如

    1. from Crypto.PublicKey import RSA
    2. from Crypto.Cipher import PKCS1_OAEP
    3. from Crypto.Util.number import *
    4. flag = b'This_is_a_message_qwer'
    5. ​
    6. key = RSA.generate(1024)
    7. pub = key.publickey().exportKey()
    8. public_key = RSA.importKey(pub)
    9. pk = PKCS1_OAEP.new(public_key)
    10. enc = pk.encrypt(flag)
    11. print(enc)
    12. ​
    13. priv = key.exportKey()
    14. priv_key = RSA.importKey(priv)
    15. sk = PKCS1_OAEP.new(priv_key)
    16. msg = sk.decrypt(enc)
    17. print(msg)
    18. b'\xd1/Ou\xae\xba]z\xc0\t\xc6\xd7\xc4f\x13\x96\x9a\xeb5\xdb8\x92\xc7\x19\x12y\x9c\x18\xf7A\x9d\xe9\n&=<\x16\x07\xefz\xad2-\x983\xec\x932\xcb\xf0\x87~\xdf\xc1\xd2\x9f\xd7@\\H\x1f\x87#\xf3\x84\xa0\xfc\xd9\xcfV$>\xd7Of\xe6G\x06\xcb\x91\xa1\xcc\x0c\xad\xc2\x9a\xad\xe46\x91x\xad\xa51\xbb\xfb\xc1E\x93~e%\xd1~\xf8l\x19n\x88\xff\xac^\xca\x8fs*}\xb9c0\xc0N\xf2\xfa\xa4\xd8\x18g'
    19. b'This_is_a_message_qwer'

    解析公私钥

    openssl

    openssl是linux系统里一个开源的的软件包，应用程序通过openssl加密通信避免窃听，主要库为C语言写成。openssl还支持许多加密算法，例如RSA、DSA、ECDSA、ECDHE、Diffie–Hellman key exchange等。本文主要介绍openssl用于RSA中pem文件的加解密。

    读取公钥pem
    openssl rsa -pubin -text -modulus -in 1.pem
┌──(root㉿kali)-[/tmp]
└─# openssl rsa -pubin -text -modulus -in 1.pem 
RSA Public-Key: (1024 bit)
Modulus:
    00:8f:36:54:4b:9c:ac:89:f9:76:b1:3c:16:8c:10:
    db:99:4c:e9:95:92:ab:03:e9:31:d3:41:6f:a3:52:
    da:fe:66:fc:9a:4e:22:37:98:73:b3:c2:97:e6:42:
    ee:9b:04:ae:2d:5d:d0:3d:6f:09:9f:e7:44:35:b0:
    2f:3b:b2:41:8a:b1:3c:2b:d5:97:c1:8e:77:df:8b:
    d1:06:02:c3:35:42:d3:f0:fb:ec:a7:af:13:5c:1b:
    96:97:92:15:7b:35:a9:b3:58:d7:ba:f0:d1:45:9f:
    c8:d5:05:59:e7:ff:4d:8a:97:93:29:a0:7e:50:ab:
    6d:2e:e6:45:7e:74:b0:4b:3d
Exponent: 65537 (0x10001)
Modulus=8F36544B9CAC89F976B13C168C10DB994CE99592AB03E931D3416FA352DAFE66FC9A4E22379873B3C297E642EE9B04AE2D5DD03D6F099FE74435B02F3BB2418AB13C2BD597C18E77DF8BD10602C33542D3F0FBECA7AF135C1B969792157B35A9B358D7BAF0D1459FC8D50559E7FF4D8A979329A07E50AB6D2EE6457E74B04B3D
writing RSA key
-----BEGIN PUBLIC KEY-----
MIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQCPNlRLnKyJ+XaxPBaMENuZTOmV
kqsD6THTQW+jUtr+ZvyaTiI3mHOzwpfmQu6bBK4tXdA9bwmf50Q1sC87skGKsTwr
1ZfBjnffi9EGAsM1QtPw++ynrxNcG5aXkhV7NamzWNe68NFFn8jVBVnn/02Kl5Mp
oH5Qq20u5kV+dLBLPQIDAQAB
-----END PUBLIC KEY-----

    其中Modulus为模数n的16进制下的值，Exponent为加密指数e。

    读取私钥pem
    openssl rsa -in 1.pem -text
┌──(root㉿kali)-[/tmp]
└─# openssl rsa -in 1.pem -text                
RSA Private-Key: (1024 bit, 2 primes)
modulus:
    00:8f:36:54:4b:9c:ac:89:f9:76:b1:3c:16:8c:10:
    db:99:4c:e9:95:92:ab:03:e9:31:d3:41:6f:a3:52:
    da:fe:66:fc:9a:4e:22:37:98:73:b3:c2:97:e6:42:
    ee:9b:04:ae:2d:5d:d0:3d:6f:09:9f:e7:44:35:b0:
    2f:3b:b2:41:8a:b1:3c:2b:d5:97:c1:8e:77:df:8b:
    d1:06:02:c3:35:42:d3:f0:fb:ec:a7:af:13:5c:1b:
    96:97:92:15:7b:35:a9:b3:58:d7:ba:f0:d1:45:9f:
    c8:d5:05:59:e7:ff:4d:8a:97:93:29:a0:7e:50:ab:
    6d:2e:e6:45:7e:74:b0:4b:3d
publicExponent: 65537 (0x10001)
privateExponent:
    1b:5b:06:de:0c:96:de:a2:22:bc:77:1c:5d:73:e8:
    e6:8f:0c:fd:4f:af:50:07:6e:c7:8a:33:cf:70:47:
    b9:99:a5:7d:ba:18:0a:23:9a:52:47:84:e9:6c:76:
    94:70:df:ee:75:81:8e:02:94:45:91:90:f3:6a:6c:
    93:4c:18:fd:a2:75:d5:18:9a:81:1d:38:ec:85:c3:
    33:f6:1e:69:0a:27:d5:ba:12:5d:1d:86:ac:4e:14:
    dc:e1:ad:f7:0b:64:ac:6a:3c:58:f7:c1:1c:5c:4f:
    d9:91:9a:05:c3:de:a0:2f:4c:43:28:da:33:9b:fe:
    60:a5:31:83:2f:ce:d8:51
prime1:
    00:bc:a4:41:8f:de:bc:c4:cc:c3:4b:ac:7e:65:da:
    f9:53:0b:53:d7:e9:f2:11:8b:fd:03:96:27:ca:f6:
    cb:02:ba:fd:60:51:56:78:64:7d:37:b5:b8:ee:92:
    12:57:ce:5f:be:96:32:40:48:47:fb:ea:8f:75:bb:
    60:c1:90:c1:e9
prime2:
    00:c2:59:5e:53:6e:a6:17:33:ea:00:72:87:da:0b:
    55:36:0f:cd:40:25:c6:e3:2c:b8:a3:4f:e5:13:9d:
    80:b2:76:78:66:04:88:51:13:fa:3e:7e:fc:08:f7:
    06:6b:3b:ce:09:bd:cc:46:91:e7:b7:74:8a:52:e4:
    f7:66:a9:36:35
exponent1:
    4e:a6:3d:1f:7a:c2:41:5b:0d:e1:b3:1d:4f:e2:28:
    29:53:83:b5:75:b8:93:50:46:41:04:8d:ba:b5:82:
    96:b4:d7:87:1c:e2:6c:77:99:2d:6c:fa:99:9d:15:
    40:be:ae:74:8b:b2:8f:d2:93:10:99:0f:0f:0a:fc:
    a0:37:76:61
exponent2:
    22:2f:a6:2f:f6:de:b0:66:29:5b:3a:ca:3a:c8:93:
    8c:96:ea:fb:c5:a9:5e:7c:97:5d:e2:c7:e0:d3:6b:
    b7:f8:ae:e5:03:17:17:6b:f4:30:da:15:6b:5e:48:
    7a:c4:62:51:c4:59:12:70:c7:d9:b5:5e:3f:86:97:
    1e:2f:d5:a1
coefficient:
    00:83:55:17:ad:1a:fe:bb:ac:04:d5:f7:92:ee:1a:
    b4:37:a9:28:e2:e9:73:3f:14:b3:d0:2d:8f:56:28:
    d5:55:22:9d:56:27:de:18:67:e5:b4:96:42:ca:8f:
    b0:b9:60:fb:23:9f:ab:62:3b:19:92:2c:0c:6a:31:
    b9:ad:09:0b:3c
writing RSA key
-----BEGIN RSA PRIVATE KEY-----
MIICXAIBAAKBgQCPNlRLnKyJ+XaxPBaMENuZTOmVkqsD6THTQW+jUtr+ZvyaTiI3
mHOzwpfmQu6bBK4tXdA9bwmf50Q1sC87skGKsTwr1ZfBjnffi9EGAsM1QtPw++yn
rxNcG5aXkhV7NamzWNe68NFFn8jVBVnn/02Kl5MpoH5Qq20u5kV+dLBLPQIDAQAB
AoGAG1sG3gyW3qIivHccXXPo5o8M/U+vUAdux4ozz3BHuZmlfboYCiOaUkeE6Wx2
lHDf7nWBjgKURZGQ82psk0wY/aJ11RiagR047IXDM/YeaQon1boSXR2GrE4U3OGt
9wtkrGo8WPfBHFxP2ZGaBcPeoC9MQyjaM5v+YKUxgy/O2FECQQC8pEGP3rzEzMNL
rH5l2vlTC1PX6fIRi/0DlifK9ssCuv1gUVZ4ZH03tbjukhJXzl++ljJASEf76o91
u2DBkMHpAkEAwlleU26mFzPqAHKH2gtVNg/NQCXG4yy4o0/lE52AsnZ4ZgSIURP6
Pn78CPcGazvOCb3MRpHnt3SKUuT3Zqk2NQJATqY9H3rCQVsN4bMdT+IoKVODtXW4
k1BGQQSNurWClrTXhxzibHeZLWz6mZ0VQL6udIuyj9KTEJkPDwr8oDd2YQJAIi+m
L/besGYpWzrKOsiTjJbq+8WpXnyXXeLH4NNrt/iu5QMXF2v0MNoVa15IesRiUcRZ
EnDH2bVeP4aXHi/VoQJBAINVF60a/rusBNX3ku4atDepKOLpcz8Us9Atj1Yo1VUi
nVYn3hhn5bSWQsqPsLlg+yOfq2I7GZIsDGoxua0JCzw=
-----END RSA PRIVATE KEY-----

    其中一共有8个参数，分别为：

    modulus:模数n

    publicExponent:加密指数e

    privateExponent:解密指数d

    prime1&2:模数n的两个大因子p和q

    exponent1&2:dp和dq，d mod (p - 1)和d mod (q - 1)

    coefficient:$q^{-1} \bmod p$

    原始数据读取
    读取公钥pem

    例如一个pem公钥文件

    -----BEGIN PUBLIC KEY-----
MIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQDXrGq02sFKE5Znv2GljNLThSWB
P6N2NfV41vaADS/ZEZB6JPo0RLTg4UYZOGg5SLYQkr5IvO6thXQJ+xFduuOYl8oe
p4BeLZLIwFnxZQIjSDe5GD/Id6wPLTDTGFB4y7aVK/D0v+y12uW44HrYAUeTCNU8
renYB8YQwZIwuO2qZwIDAQAB
-----END PUBLIC KEY-----

    读取其中的base64编码并转hex得到

    30819f300d06092a864886f70d010101050003818d0030818902818100d7ac6ab4dac14a139667bf61a58cd2d38525813fa37635f578d6f6800d2fd911907a24fa3444b4e0e1461938683948b61092be48bceead857409fb115dbae39897ca1ea7805e2d92c8c059f16502234837b9183fc877ac0f2d30d3185078cbb6952bf0f4bfecb5dae5b8e07ad801479308d53cade9d807c610c19230b8edaa670203010001

    其中

    内容解析
    3081标签头，81表示后面接1bytes，82表示后接2bytes表示长度
    9f后接上0xdf(159)bytes的内容
    300d06092a864886f70d010101050003固定序列(具体包含的内容未知)
    81后面接1bytes，为82则表示后接2bytes表示长度
    8d后接上0x8d(141)bytes的内容
    0030固定序列
    81后面接1bytes，为82则表示后接2bytes表示长度
    89后接上0x89(137)bytes的内容
    028181表示后面接1bytes，82表示后接2bytes表示长度
    81后面的模数n长度为0x81bytes，但是其中1bytes为00，故生成的模数二进制位数为1024
    00d7-67模数n的16进制形式
    020301000102后接加密指数e的长度03即内容010001
    读取私钥pem

    私钥的读取和公钥大同小异，但是私钥的内容会比公钥多一些，相比于公钥，私钥还有p,q,dp,dq,qinvp。

    测试样例，生成了个1024位的RSA对象之后，讲该变量中每一个值给读出来。

    from Crypto.PublicKey import RSA
key = RSA.generate(1024)
with open('1.pem','wb') as f:
    f.write(b'n = ' + str(hex(key.n)[2:]).encode() + b'\n')
    f.write(b'e = ' + str(hex(key.e)[2:]).encode() + b'\n')
    f.write(b'p = ' + str(hex(key.p)[2:]).encode() + b'\n')
    f.write(b'q = ' + str(hex(key.q)[2:]).encode() + b'\n')
    f.write(b'd = ' + str(hex(key.d)[2:]).encode() + b'\n')
    f.write(b'dp = '+ str(hex((key.d) % ((key.p) - 1))[2:]).encode() + b'\n')
    f.write(b'dq = ' + str(hex((key.d) % ((key.q) - 1))[2:]).encode() + b'\n')
    f.write(b'p_q = ' + str(hex(pow(key.p,-1,key.q))[2:]).encode() + b'\n')
    f.write(b'q_p = ' + str(hex(pow(key.q, -1, key.p))[2:]).encode() + b'\n')
    f.write(key.exportKey('PEM'))
​
with open('1.pem','rb') as f:
    print(f.read().decode())

    例如一个私钥文件

    -----BEGIN RSA PRIVATE KEY-----
MIICWwIBAAKBgQCw/aHmn+xs4OCJbVu1U0JhR/M4h42TYeVyR02wdtV+Dwt+CrE7
JlZyKBCM+jOXx+tgoxZ6e/U+voP9iU4Fpdmyi/HE8U5ZZ6YH8Bzx8Qh8vM3QM8XU
W4NGfg6N9VG7uVdwioOBbZ9AoOBYHjMdxoZ8O5AxO3Lp0rzkfQTUe9CQFwIDAQAB
AoGAE+puYeOj+HpzebNXCvfT89tjSHykVy3AYlQYr18n1df+jI/KcqP1PUI53os2
7ADggQ7I9D5nkchhVNGy+Fq5vLgdTRYZ859iT1h9i+bTwt7Uq2OfJR/NRkVcvaSv
7UKHmF3AyzNOpSf2NunvYUSJ5n92jUuXdXkvqmeS3/FOWA0CQQDJbCjac+mVzCzZ
U84s+7JXviTHPoN9GXZY3vr1tIBogwyftCa1+pVIYu7WTwwHzcKe9KU4GPbLCTYU
45FJ0ejjAkEA4PK+h3cB65Oahwmxza1w7tugGNTXcLhMpJ8PCO65pG0wRIpp3doC
TRLKdUUAcVromiiU8m/Mt8jwyhVxFMpGPQJAN6/uj47yapbbY253FxqzUOzh8DAJ
XGHYxXNIgPvZcIuixtigxzkzYqLvk1KhadrqTtYmg57rRHEUgav09CrTrwJANTc3
+7QbsC9rDycr+Qxe+yLZ7QXtMa1n9EnstKBFKrDqCkz0XpeEk9cuLi/0utxWyqFv
Gyt3ssLGtAf+iHyRwQJAIWcJAM/jTFTMXNUrYK0fa0MMpNMrwnlDb6uyMn/4Q41g
f3RB/34+gFrCRZEhMtasgaOkoHYP3VZQvqkXzyaycg==
-----END RSA PRIVATE KEY-----

    读取base64转hex(手动排版换行过后)

    3082025b02010002818100
b0fda1e69fec6ce0e0896d5bb553426147f338878d9361e572474db076d57e0f0b7e0ab13b26567228108cfa3397c7eb60a3167a7bf53ebe83fd894e05a5d9b28bf1c4f14e5967a607f01cf1f1087cbccdd033c5d45b83467e0e8df551bbb957708a83816d9f40a0e0581e331dc6867c3b90313b72e9d2bce47d04d47bd09017
0203010001
028180 13ea6e61e3a3f87a7379b3570af7d3f3db63487ca4572dc0625418af5f27d5d7fe8c8fca72a3f53d4239de8b36ec00e0810ec8f43e6791c86154d1b2f85ab9bcb81d4d1619f39f624f587d8be6d3c2ded4ab639f251fcd46455cbda4afed4287985dc0cb334ea527f636e9ef614489e67f768d4b9775792faa6792dff14e580d
024100 c96c28da73e995cc2cd953ce2cfbb257be24c73e837d197658defaf5b48068830c9fb426b5fa954862eed64f0c07cdc29ef4a53818f6cb093614e39149d1e8e3
024100 e0f2be877701eb939a8709b1cdad70eedba018d4d770b84ca49f0f08eeb9a46d30448a69ddda024d12ca754500715ae89a2894f26fccb7c8f0ca157114ca463d
0240   37afee8f8ef26a96db636e77171ab350ece1f030095c61d8c5734880fbd9708ba2c6d8a0c7393362a2ef9352a169daea4ed626839eeb44711481abf4f42ad3af
0240   353737fbb41bb02f6b0f272bf90c5efb22d9ed05ed31ad67f449ecb4a0452ab0ea0a4cf45e978493d72e2e2ff4badc56caa16f1b2b77b2c2c6b407fe887c91c1
0240   21670900cfe34c54cc5cd52b60ad1f6b430ca4d32bc279436fabb2327ff8438d607f7441ff7e3e805ac245912132d6ac81a3a4a0760fdd5650bea917cf26b272

    解析过程如下

    内容解析
    3082标签头，81表示后面接1bytes，82表示后接2bytes表示长度。
    025e后接0x25e(606)bytes的内容。
    02010002固定序列
    8181表示后面接1bytes，82表示后接2bytes表示长度。
    81后面的模数n长度为0x81bytes，但是其中1bytes为00，故生成的模数二进制位数为1024
    b0fd-9017模数n的16进制
    020301000102后接加密指数e的长度03即内容010001
    02818081表示后面接1bytes的长度信息，80表示后接0x80(128)bytes长度的信息
    13ea-580d私钥指数d的16进制
    024100起始序列
    c96c-e8e3p的16进制
    024100起始序列
    e0f2-463dq的16进制
    0240起始序列
    37af-d3afdp的16进制
    0240起始序列
    3537-91c1dq的16进制
    0240起始序列
    2167-b272q inv p

    可以通过0x02进行大概区分：

    1. for i in k.split('02'):
    2.     print('02', i)

    例题1 2022ACTF impossible RSA

    附件

    1. from Crypto.Util.number import *
    2. from Crypto.PublicKey import RSA
    3. ​
    4. e = 65537
    5. flag = b'ACTF{...}'
    6. ​
    7. while True:
    8.     p = getPrime(1024)
    9.     q = inverse(e, p)
    10.     if not isPrime(q):
    11.         continue
    12.     n = p * q
    13.     public = RSA.construct((n, e))
    14.     with open("public.pem", "wb") as file:
    15.         file.write(public.exportKey('PEM'))
    16.     with open("flag", "wb") as file:
    17.         file.write(long_to_bytes(pow(bytes_to_long(flag), e, n)))
    18.     break

    本题中的公钥就是以文件形式读取，读取公钥代码为

    1. from Crypto.PublicKey import RSA
    2. with open(r'public.pem', "r") as f:
    3.     key = f.read()
    4.     rsakey = RSA.importKey(key)
    5.     n = rsakey.n
    6.     e = rsakey.e

    回到本题，题目给了p,q,e之间满足关系$q\equiv e^{-1} \bmod p$，写成等式得到$eq=1+kp$，可知k的大小与e差不多，可以尝试队k进行爆破再联立$n=p\times q$两组等式解得pq。

    两式联立化简可得$kp^{2}+p-en=0$，只需判断其判别式是否能开整次方即可，完整解答为

    1. from Crypto.Util.number import *
    2. import gmpy2
    3. from Crypto.PublicKey import RSA
    4. from tqdm import tqdm
    5. with open(r'public.pem', "r") as f:
    6.     key = f.read()
    7.     rsakey = RSA.importKey(key)
    8.     n = rsakey.n
    9.     e = rsakey.e
    10. with open('flag','rb') as f:
    11.     c = f.read()
    12.     c = bytes_to_long(c)
    13. print(c)
    14. ​
    15. for k in tqdm(range(1,1 << 16)):
    16.     root = gmpy2.iroot(1 + 4 * k * n * e,2)
    17.     if root[1] == True:
    18.         p = (1 + root[0]) // (2 * k)
    19.         assert n % p == 0
    20.         q = n // p
    21.         phi = (p - 1) * (q - 1)
    22.         d = gmpy2.invert(e,phi)
    23.         m = pow(c,d,n)
    24.         print(long_to_bytes(m))
    25.         break

    例题2 2022蓝帽杯初赛corrupted_key

    该题主要考察对私钥文件pem的读取理解，附件如下

    1. from Crypto.PublicKey import RSA
    2. from Crypto.Cipher import PKCS1_OAEP
    3. from secret import flag
    4. ​
    5. key = RSA.generate(1024)
    6. open("flag.enc",'wb').write(PKCS1_OAEP.new(key.publickey()).encrypt(flag))
    7. open('priv.pem','wb').write(key.exportKey('PEM'))

    平平无奇的附件，关键在私钥

    -----BEGIN RSA PRIVATE KEY-----
MIICXgIBAAKBgQDXFSUGqpzsBeUzXWtG9UkUB8MZn9UQkfH2Aw03YrngP0nJ3NwH
UFTgzBSLl0tBhUvZO07haiqHbuYgBegO+Aa3qjtksb+bH6dz41PQzbn/l4Pd1fXm
dJmtEPNh6TjQC4KmpMQqBTXF52cheY6GtFzUuNA7DX51wr6HZqHoQ73GQQIDAQAB
​
​
​
​
​
​
​
​
yQvOzxy6szWFheigQdGxAkEA4wFss2CcHWQ8FnQ5w7k4uIH0I38khg07HLhaYm1c
zUcmlk4PgnDWxN+ev+vMU45O5eGntzaO3lHsaukX9461mA==
-----END RSA PRIVATE KEY-----

    其中可以看出，私钥文件中间是有很大程度的缺失，首先进行原始数据读取，将base64编码转成hex看看

    第一段：
3082025e02010002818100d7152506aa9cec05e5335d6b46f5491407c3199fd51091f1f6030d3762b9e03f49c9dcdc075054e0cc148b974b41854bd93b4ee16a2a876ee62005e80ef806b7aa3b64b1bf9b1fa773e353d0cdb9ff9783ddd5f5e67499ad10f361e938d00b82a6a4c42a0535c5e76721798e86b45cd4b8d03b0d7e75c2be8766a1e843bdc6410203010001
第二段：
c90bcecf1cbab3358585e8a041d1b1024100e3016cb3609c1d643c167439c3b938b881f4237f24860d3b1cb85a626d5ccd4726964e0f8270d6c4df9ebfebcc538e4ee5e1a7b7368ede51ec6ae917f78eb598

    从第一段可以提取出数据

    n = 0xd7152506aa9cec05e5335d6b46f5491407c3199fd51091f1f6030d3762b9e03f49c9dcdc075054e0cc148b974b41854bd93b4ee16a2a876ee62005e80ef806b7aa3b64b1bf9b1fa773e353d0cdb9ff9783ddd5f5e67499ad10f361e938d00b82a6a4c42a0535c5e76721798e86b45cd4b8d03b0d7e75c2be8766a1e843bdc641
e = 0x10001

    从第二段可以提取出数据

    _dq = 0xc90bcecf1cbab3358585e8a041d1b1
qinvp = 0xe3016cb3609c1d643c167439c3b938b881f4237f24860d3b1cb85a626d5ccd4726964e0f8270d6c4df9ebfebcc538e4ee5e1a7b7368ede51ec6ae917f78eb598

    题目给了提示建立方程组使用coppersmith恢复dq，模数n为1024位，dq已知后面120位，缺失了392位，缺失的392位如果能够构造出等式是可以成功通过coppersmith攻击恢复。将已知式写成等式列出

    爆破k，dq低位已知，构造方程式可解

    这里发现一个问题，构造的时候dq要写成dq = (2 ** 120 * x) + _dq而不能写成dq = (x << 120) + _dq，因为x是未知，通过移位操作实现乘法可能会出现问题。

    1. from Crypto.Util.number import *
    2. import gmpy2
    3. from tqdm import tqdm
    4. from Crypto.PublicKey import RSA
    5. from Crypto.Cipher import PKCS1_OAEP
    6. n = 0xd7152506aa9cec05e5335d6b46f5491407c3199fd51091f1f6030d3762b9e03f49c9dcdc075054e0cc148b974b41854bd93b4ee16a2a876ee62005e80ef806b7aa3b64b1bf9b1fa773e353d0cdb9ff9783ddd5f5e67499ad10f361e938d00b82a6a4c42a0535c5e76721798e86b45cd4b8d03b0d7e75c2be8766a1e843bdc641
    7. e = 0x10001
    8. _dq = 0xc90bcecf1cbab3358585e8a041d1b1
    9. t = 0xe3016cb3609c1d643c167439c3b938b881f4237f24860d3b1cb85a626d5ccd4726964e0f8270d6c4df9ebfebcc538e4ee5e1a7b7368ede51ec6ae917f78eb598
    10. with open('flag.enc','rb') as f:
    11.     c = f.read()
    12. PR.<x> = PolynomialRing(Zmod(n))
    13. dq = (2 ** 120 * x) + _dq
    14. for k in tqdm(range(65537,55000,-1)):
    15.     f = t * (e * dq - 1) ** 2 + k * (2 * t - 1) * (e * dq - 1) + t * k * k - k * k
    16.     f = f.monic()
    17.     root = f.small_roots(X=2^392,beta=0.4)
    18.     if len(root) > 0:
    19.         print(int(root[0]) * 2 ** 120 + _dq)
    20.         break
    21. #dq = 11263269100321843418340309033584057768246046953115325020896491943793759194249558697334095131684279304657225064156696057310019203890620314290203835007881649
    22. #k = 59199  

    得到dq和系数k之后，直接计算flag，但是这里需要注意，原题是通过PKCS1_OAEP算法进行加解密的，在得到私钥之后也要通过原来的方式解密回去

    1. from Crypto.Util.number import *
    2. from Crypto.PublicKey import RSA
    3. from Crypto.Cipher import PKCS1_OAEP
    4. import base64
    5. import gmpy2
    6. with open("flag.enc","rb")as f:
    7.     c = f.read()
    8. dq = 11263269100321843418340309033584057768246046953115325020896491943793759194249558697334095131684279304657225064156696057310019203890620314290203835007881649
    9. k = 59199
    10. n = 0xd7152506aa9cec05e5335d6b46f5491407c3199fd51091f1f6030d3762b9e03f49c9dcdc075054e0cc148b974b41854bd93b4ee16a2a876ee62005e80ef806b7aa3b64b1bf9b1fa773e353d0cdb9ff9783ddd5f5e67499ad10f361e938d00b82a6a4c42a0535c5e76721798e86b45cd4b8d03b0d7e75c2be8766a1e843bdc641
    11. e = 0x10001
    12. q = int((e * dq - 1) // k + 1)
    13. assert n % q == 0
    14. p = int(n // q)
    15. phi = (p - 1) * (q - 1)
    16. d = int(gmpy2.invert(e,phi))
    17. key = RSA.construct((n,e,d,p,q))
    18. flag = PKCS1_OAEP.new(key)
    19. flag = flag.decrypt(c)
    20. print(flag)

    2023羊城杯 XOR贯彻始终

    wp：

    1. x = "C0ngr4tulati0n5_y0u_fou^d_m3"
    2. import base64
    3.  
    4. import gmpy2
    5. from Crypto.Util.number import *
    6.  
    7. a = [b'MIICdwIBADANBgkqhkiG9w0BAQEFAASCAmEwggJdAgEAAoGBALmtMy+2uH1ZtbIL',
    8.     b'SuiAukFthyQRH5mp7UmLyzZQkdg9zEP9/5tgffikQ7ytx5kHySHnazgAO1sOzmYE',
    9.     b'N4Axlev6uafiP8B1Eij97v5VkYJ1I9e3mtBNheTbXKoT8op+ASQ1fQaF4A8UzLuW',
    10.     b'eZeZI8JTH/SH+bolAK3kiZXDFdkTAgMBAAECgYEAl067LaC7Cvs2A5cMPhfYsESv',
    11.     b'IgcKN1CwW4Sd3u8dSphhgu7TgyzIuvwxbuo2g1BC6WwKhaI6vGN+csfw6nh98GEn',
    12.     b'/p3D0huNroAYvf/DRRB9UnHdttX7wB+Mv3P0RBDWHgBiCDVvHFuFUV78cIs0tnbn',
    13.     b'jxjU07aPV2XRC3AfA2ECQQDqWUNPVg3i6vTyHCL7EGkbeUheYpAAfcKCQrxjc5+5',
    14.     b'X6A+XtgHAA1JHwykPlCpHUOmlA85DJF1ejuoImzlgRLJAkEAytTCnQF+MN2r1gaA',
    15.     b'UETZyj5qMYT7Th8zKEVVVJjDawLnuX4usJ2FyRnjCkk86U75QSJhw5mMc0QnG25u',
    16.     b'Gz3++w==']
    17. k = ''
    18. for i in range(len(a)):
    19.     k += hex(bytes_to_long(base64.b64decode(a[i])))[2:]
    20.  
    21. for i in k.split('02'):
    22.     print('02', i)
    23.  
    24.  
    25. n = 0xb9ad332fb6b87d59b5b20b4ae880ba416d8724111f99a9ed498bcb365091d83dcc43fdff9b607df8a443bcadc79907c921e76b38003b5b0ece660437803195ebfab9a7e23fc0751228fdeefe5591827523d7b79ad04d85e4db5caa13f28a7e0124357d0685e00f14ccbb9679979923c2531ff487f9ba2500ade48995c315d913
    26. e = 0x10001
    27. p = 0xea59434f560de2eaf4f21c22fb10691b79485e6290007dc28242bc63739fb95fa03e5ed807000d491f0ca43e50a91d43a6940f390c91757a3ba8226ce58112c9
    28. q = n//p
    29. d = gmpy2.invert(e,(p-1)*(q-1))
    30. c = 91817924748361493215143897386603397612753451291462468066632608541316135642691873237492166541761504834463859351830616117238028454453831120079998631107520871612398404926417683282285787231775479511469825932022611941912754602165499500350038397852503264709127650106856760043956604644700201911063515109074933378818
    31.  
    32. m = pow(c,d,n)
    33. x = b'C0ngr4tulati0n5_y0u_fou^d_m3'
    34. print(long_to_bytes(m^bytes_to_long(x)))
    35.  
    36. # print(k)




    ​​​​​​​参考链接

    【CTF-RSA】RSA密钥生成与读取 - 哔哩哔哩

    https://zh.m.wikipedia.org/zh-cn/OpenSSL

    OPENSSL中RSA私钥文件（PEM格式）解析_openssl pem格式_PTYX的博客-CSDN博客

  • 相关阅读:
    数据库技术基础--数据库的控制功能
    方舟生存进化自建服务器要多少成本？
    CAMx的空气质量模拟及污染来源解析丨大气臭氧来源解析模拟与臭氧成因分析
    Springboot毕设项目校园靓拍网站7883cjava+VUE+Mybatis+Maven+Mysql+sprnig）
    远程仓库(一)之git 小乌龟安装教程
    Typescript 综合笔记：解读一个github中的React 网页
    ThreadLocal
    第十三届蓝桥杯省赛与国赛真题题解大汇总（十四届参赛者必备）
    Spring-重新认识IoC二
    小白一键重装官网下载使用方法
  • 原文地址：https://blog.csdn.net/shshss64/article/details/132703259