public key cryptography

The basic idea behind public key cryptography, is that a user can publish (for instance on the internet) all the information needed to send them an encypted message, but for this information to be insufficient to decrypt the message in reasonable time. In general, this time requirement is taken to that, if the public key has length $n$ (over a particular alphabet), then the message cannot be decrypted in time $\\leq p(n)$ for any polynomial $p$ .

The information published to all users is called the public key, and the additional information needed to decrypt a message is a users private key.

Public key cryptography was first conceived by James Ellis in 1969, and a workable scheme was developed in 1973. This was kept secret however, and it was not until 1978 that two schemes were announced publicly. These were the Merkle-Hellman scheme, and the RSA scheme.

单词	PublicKeyCryptography
释义	public key cryptography The basic idea behind public key cryptography, is that a user can publish (for instance on the internet) all the information needed to send them an encypted message, but for this information to be insufficient to decrypt the message in reasonable time. In general, this time requirement is taken to that, if the public key has length $n$ (over a particular alphabet), then the message cannot be decrypted in time $\\leq p(n)$ for any polynomial $p$ . The information published to all users is called the public key, and the additional information needed to decrypt a message is a users private key. Public key cryptography was first conceived by James Ellis in 1969, and a workable scheme was developed in 1973. This was kept secret however, and it was not until 1978 that two schemes were announced publicly. These were the Merkle-Hellman scheme, and the RSA scheme.
随便看	1013Quotients 10.1.3 Quotients 1014SetIsAPimathsfWpretopos 10.1.4 Set is a Π⁢𝖶-pretopos 1015TheAxiomOfChoiceImpliesExcludedMiddle 10.1.5 The axiom of choice implies excluded middle 101TheCategoryOfSets 10.1 The category of sets 102CardinalNumbers 10.2 Cardinal numbers 103OrdinalNumbers 10.3 Ordinal numbers 104ClassicalWellorderings 10.4 Classical well-orderings 105TheCumulativeHierarchy 10.5 The cumulative hierarchy 10SetTheory 10. Set theory 110PatternMatchingAndRecursion 1.10 Pattern matching and recursion 111PropositionsAsTypes 1.11 Propositions as types 111TheFieldOfRationalNumbers 11.1 The field of rational numbers 1121PathInduction