1024位RSA加密 [英] 1024-bit RSA cryptography

问题描述

RSA算法：

1.选择两个不同的素数p和q。出于安全目的，整数的p和q必须很大。

2.计算n = p * q

n将用作公钥和私钥的模块， n也称为key_component。

3.计算f（n）=（q-1）（p-1），其中f是Euler的函数

4选择一个整数e，使得1 e
5.确定d：

d是e mod的乘法逆（f（n））（e * d）mod f（n）= 1，d是私钥。



加密：

M是纯文本数据。

C = m ^ e mod n



解密：

C收到狙击文本。

M = C ^ d mod n



问：对于rsa 1024位是否也使用上述算法？

解决方案

RSA [ ^ ]是RSA，不管你选择什么位大小...但是最好使用更大的，可能是最大的可用（今天有4096个公共库），并且无论如何不小于2048（1024位被证明是可破坏的2003）...

RSA algorithm:
1. Select two different prime numbers p and q. For security aim, the integer's p and q must be large.
2. Calculate n = p * q
n will be used as the module for public key and private key and n is also known as key_component.
3. Calculate f(n) = (q-1)(p-1), where f is a function of Euler's
4. Select an integer e such that 1<e><f(n)>e and f(n) are co prime.
5. Determine d:
d is multiplicative inverse of e mod (f(n)) (e * d) mod f(n) = 1, d is a private key.

Encryption:
M is plain text data.
C = m^e mod n

Decryption:
C is received chiper text.
M = C^d mod n

Ask: whether for rsa 1024-bit also using algorithm as above ?

解决方案

RSA[^] is RSA, not matter what bit size you choose...But it is better to use larger, probably the largest available (4096 today with public libraries), and in any case not less than 2048 (1024 bit was proved as breakable in 2003)...

这篇关于1024位RSA加密的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！