trapdoor one-way function

См. также в других словарях:

• One-way function — Unsolved problems in computer science Do one way functions exist? In computer science, a one way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here easy and hard are to be… …   Wikipedia

• One-way encryption — In cryptography, the term one way encryption has been used to refer to a number of different things: *One way function, a function difficult to invert. Note that encryption is, by definition, reversible. Hence, the term one way encryption is… …   Wikipedia

• Trapdoor function — 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… …   Wikipedia

• RSA-Kryptosystem — RSA ist ein asymmetrisches kryptographisches Verfahren, das sowohl zur Verschlüsselung als auch zur digitalen Signatur verwendet werden kann.[1] Es verwendet ein Schlüsselpaar, bestehend aus einem privaten Schlüssel, der zum Entschlüsseln oder… …   Deutsch Wikipedia

• односторонняя функция RSA с потайным ходом — — [http://www.rfcmd.ru/glossword/1.8/index.php?a=index&d=4141] Тематики защита информации EN RSA trapdoor one way function …   Справочник технического переводчика

• односторонняя функция с лазейкой — Лазейка в односторонней функции дает возможность простого обратного вычисления односторонней функций, если вы знаете некоторую секретную информацию. Такая секретная информация называется лазейкой. [http://www.rfcmd.ru/glossword/1.8/index.php?a=ind… …   Справочник технического переводчика

• Digital signature — This article is about secure cryptographic signatures. For simple signatures in digital form, see Electronic signature. A digital signature or digital signature scheme is a mathematical scheme for demonstrating the authenticity of a digital… …   Wikipedia

• Pseudorandom generator theorem — In computational complexity a distribution is considered pseudorandom if no efficient computation can distinguish it from the true uniform distribution by a non negligible advantage. Formally, a family of distributions Dn is pseudorandom if for… …   Wikipedia

• Hard-core predicate — In cryptography, a hard core predicate of a one way function f is a predicate b (i.e., a function whose output is a single bit) which is easy to compute given x but is hard to compute given f(x) . In formal terms, there is no probabilistic… …   Wikipedia

• Optimal Asymmetric Encryption Padding — This article is about the padding scheme used in public key cryptography. For the division of the Thailand Ministry of Science Technology and Environment entitled Office of Atomic Energy for Peace, see [http://www.oaep.go.th/english/index.html] …   Wikipedia

• Optimal asymmetric encryption padding — This article is about the padding scheme used in public key cryptography. For the division of the Thailand Ministry of Science Technology and Environment entitled Office of Atomic Energy for Peace, see [1]. In cryptography, Optimal Asymmetric… …   Wikipedia