j*******e
发帖数: 2168 | 1 好看:) Grabbed my attention immediately.
The chapters begin with number 2, then 3, I thought it was an error first,
then 5, 7, and I knew:)
I like the way the boy described prime numbers. He said that they are like
life. Logical but one can never work out the rules. He also said that prime
numbers are useful for codes. Anybody knowledgable about cryptology knows why?
Is it because prime numbers are good for choosing hash table size? | s******w
发帖数: 138 | 2 是啊，他的好多想法都很有意思呢。:)
素数应用在密码学上最基本的思想是这样的，两个极大的素数（比如每个素数有二三十位
甚至上百位的样子）的乘积我们能很快算出来，但是反过来，我们知道一个极大的数，要
把它分解成某两个极大的素数的乘积，可就难啦，要是一点点试的话估计几万年几十万年
都不够的。很多加密法都是以这种思想为基础的。
why?
【在 j*******e 的大作中提到】
: 好看:) Grabbed my attention immediately.
: The chapters begin with number 2, then 3, I thought it was an error first,
: then 5, 7, and I knew:)
: I like the way the boy described prime numbers. He said that they are like
: life. Logical but one can never work out the rules. He also said that prime
: numbers are useful for codes. Anybody knowledgable about cryptology knows why?
: Is it because prime numbers are good for choosing hash table size?
| g******a
发帖数: 730 | 3 RSA encryption
最常见的public key加密算法
【在 s******w 的大作中提到】
: 是啊，他的好多想法都很有意思呢。:)
: 素数应用在密码学上最基本的思想是这样的，两个极大的素数（比如每个素数有二三十位
: 甚至上百位的样子）的乘积我们能很快算出来，但是反过来，我们知道一个极大的数，要
: 把它分解成某两个极大的素数的乘积，可就难啦，要是一点点试的话估计几万年几十万年
: 都不够的。很多加密法都是以这种思想为基础的。
:
: why?
|
|
