⭐本专栏主要用python实现密码学中的常用经典算法,例如Vigenere、3DES、RSA、ElGamal、Diffie-Hellman、RSA签名、ElGamal签名、HMAC、哈希算法、列移位、AES等等。
🔥文章和代码已归档至【Github仓库:cryptography-codebase】,需要的朋友们自取。或者公众号【AIShareLab】回复 密码学 也可获取。
Program : Textbook RSA (on group)
In this part, you are required to implement the textbook RSA algorithm from scratch. It contains the following three procedures, KeyGen, Encrypt, and Decrypt.
-
KeyGen
- Return the private key
(
N
,
d
)
(N,d)
(N,d) and the corresponding public key
(
N
,
e
)
(N,e)
(N,e). The prime number
p
p
p and
q
q
q should be approximately 512 bits and therefore the RSA modulus number
N
N
N should be approximately 1024 bits. Note that finding an encryption exponent
e
e
e might be time-consuming.
-
Encrypt
- Given a plaintext message
m
∈
Z
N
m \in \mathbb{Z}_N
m∈ZN and a public key
(
N
,
e
)
(N,e)
(N,e), return the encrypted message
c
c
c.
-
Decrypt
- Given a ciphertext message
c
∈
Z
N
c \in \mathbb{Z}_N
c∈ZN and a private key
(
N
,
d
)
(N,d)
(N,d), return the decrypted message
m
′
m^\prime
m′.
Your program does the following:
- Generate a textbook RSA key pair. You may use the Miller-Rabin Test algorithm to determine whether an integer is prime. Print the private key and the public key as multiple decimal strings.
- Read a decimal string representing a plaintext message
m
m
m. Raise an exception if
m
m
m is invalid.
- Encrypt the message
m
m
m. Print the encrypted message
c
c
c as a decimal string.
- Decrypt the encrypted message
c
c
c. Print the decrypted message
m
现在能在网上找到很多很多的学习资源,有免费的也有收费的,当我拿到1套比较全的学习资源之前,我并没着急去看第1节,我而是去审视这套资源是否值得学习,有时候也会去问一些学长的意见,如果可以之后,我会对这套学习资源做1个学习计划,我的学习计划主要包括规划图和学习进度表。
分享给大家这份我薅到的免费视频资料,质量还不错,大家可以跟着学习
网上学习资料一大堆,但如果学到的知识不成体系,遇到问题时只是浅尝辄止,不再深入研究,那么很难做到真正的技术提升。
一个人可以走的很快,但一群人才能走的更远!不论你是正从事IT行业的老鸟或是对IT行业感兴趣的新人,都欢迎加入我们的的圈子(技术交流、学习资源、职场吐槽、大厂内推、面试辅导),让我们一起学习成长!