大叔又來發(fā)武林秘笈了。

占個位，仔細看

菜農(nóng)都閉關(guān)好久了，又要閉館

給自己掃盲一下。

Trapdoor function

From Wikipedia, the free encyclopedia

A trapdoor function is a function that is easy to compute in one direction, yet believed to be difficult to compute in the opposite direction (finding its inverse) without special information, called the "trapdoor". Trapdoor functions are widely used in cryptography.

In mathematical terms, if f is a trapdoor function there exists some secret information y, such that given f(x) and y it is easy to compute x. Consider a padlock and its key. It is trivial to change the padlock from open to closed without using the key, by pushing the shackle into the lock mechanism. Opening the padlock easily, however, requires the key to be used. Here the key is the trapdoor.

Trapdoor functions came to prominence in cryptography in the mid-1970s with the publication of asymmetric (or public key) encryption techniques by Diffie, Hellman, and Merkle. Indeed, Diffie and Hellman first coined the term (Diffie and Hellman, 1976). Several function classes have been proposed, and it soon became obvious that trapdoor functions are harder to find than was initially thought. For example, an early suggestion was to use schemes based on the subset sum problem. This turned out -- rather quickly -- to be unsuitable.

As of 2004[update], the best known trapdoor function (family) candidates are the RSA and Rabin families of functions. Both are written as exponentiation modulo a composite number, and both are related to the problem of prime factorization.

Functions related to the hardness of the discrete logarithm problem (either modulo a prime or in a group defined over an elliptic curve) are not known to be trapdoor functions, because there is no known "trapdoor" information about the group that enables the efficient computation of discrete logs. However, the discrete logarithm problem can be used as the basis for a trapdoor when the related problems called the computational Diffie-Hellman problem (CDH) and/or its decisional variant are used. The semantically secure version of the ElGamal Cryptosystem relies on the Decision Diffie-Hellman problem (DDH). The Digital Signature Algorithm is based on CDH in a prime order subgroup.

A trapdoor in cryptography has the very specific aforementioned meaning and is not to be confused with a backdoor (these are frequently used interchangeably and this is incorrect). A backdoor is a deliberate mechanism that is added to a cryptographic algorithm (e.g., a key pair generation algorithm, digital signing algorithm, etc.) or operating system, for example, that permits one or more unauthorized parties to bypass or subvert the security of the system in some fashion.

陷門和后門不是一回事（A trapdoor in cryptography ... is not to be confused with a backdoor）。百度百科上把陷門搞成后門了。看來還是西方人嚴謹。

陷門函數(shù)不好找（trapdoor functions are harder to find than was initially thought）。最著名的陷門函數(shù)是RSA和Rabin陷門函數(shù)。不知菜農(nóng)搞的是不是這個級別的東西？

另外，量子計算離實用還早著呢。菜農(nóng)很超前。

每次看蘭州的文章，我都為自己的語文閱讀能力的低下感到深深的自責(zé)：（

蘭州是誰呀

lss應(yīng)該是打算說樓主（lz）

解開陷門小數(shù)點將會“農(nóng)轉(zhuǎn)非”，“菜農(nóng)要做城里人”～～～

紅杏出墻記？

主題本想冠以“紅杏出墻記”，可恨被密界高人“按在墻頭上”～～～

http://bbs.pediy.com/showthread.php?t=101847

引用:
【注意】菜地公告：即日起開辟《菜農(nóng)奔甲子系列之》欄目  

1. 這是密碼版，不是開心農(nóng)場，版友不是農(nóng)夫，不種菜也不擔(dān)心菜被偷。
建議 HotPower 大哥是否更換一下標(biāo)題會比較合適一點!?

2. 建議儘量不要搞外部連結(jié)，及讓人有一種宣傳廣告嫌疑的感覺。

3. 再次謝謝熱情的參與及配合。



本主題原名被密界高人“規(guī)勸更名”，還在敢“紅杏出墻記”？？？不想在密界混了？？？

菜地公告：即日起開辟《菜農(nóng)奔甲子系列之》欄目
量子時代送臭蛋，菜農(nóng)紅杏想出墻。
還是谷歌早看出來了，百度沒發(fā)現(xiàn)~~~
最新版的HotWC3網(wǎng)上在線CRC運算器V5.01

謝謝分享�。。。。。。。。。。�

學(xué)習(xí)中……。