释义 |
Trapdoor FunctionAn easily computed function whose inverse is extremely difficult to compute. An example is the multiplication of twolarge Primes. Finding and verifying two large Primes is easy, as is their multiplication. But factorization of theresultant product is very difficult. See also RSA Encryption References
Gardner, M. Chs. 13-14 in Penrose Tiles and Trapdoor Ciphers...and the Return of Dr. Matrix, reissue ed. New York: W. H. Freeman, pp. 299-300, 1989.
|