Search results
Jump to navigation
Jump to search
Page title matches
- #Redirect [[One-time pad]]26 bytes (3 words) - 15:16, 24 October 2008
- #Redirect [[One-time pad]]26 bytes (3 words) - 15:16, 24 October 2008
- #Redirect [[One-time pad]]26 bytes (3 words) - 15:16, 24 October 2008
- ...lectronic version. The receiver has an identical pad to use in decryption. One-time pad is often abbreviated '''OTP''', which unfortunately also occurs as the abbr The great advantage of a one-time pad is that, properly used, it is provably secure against all [[passive attack]12 KB (1,878 words) - 05:48, 8 April 2024
- This is an external article. See [[Talk:One-time pad/Permission]]. ::One-time pad decisionmaking, I suppose[[User:Howard C. Berkowitz|Howard C. Berkowitz]] 112 KB (1,894 words) - 22:57, 28 September 2012
- #Redirect [[One-time pad]]26 bytes (3 words) - 15:15, 24 October 2008
- #Redirect [[One-time pad]]26 bytes (3 words) - 15:15, 24 October 2008
- 179 bytes (28 words) - 22:42, 23 December 2007
- | pagename = One-time pad | abc = One-time pad1 KB (115 words) - 12:52, 28 September 2012
- 1 KB (147 words) - 18:56, 27 September 2012
- 262 bytes (45 words) - 03:46, 21 August 2008
- Auto-populated based on [[Special:WhatLinksHere/One-time pad]]. Needs checking by a human.724 bytes (100 words) - 14:31, 22 March 2024
- ...[http://www.ranum.com/security/computer_security/papers/otp-faq/index.htm One-Time Pad FAQ] is a common reference.149 bytes (22 words) - 07:48, 13 June 2010
Page text matches
- #Redirect [[One-time pad]]26 bytes (3 words) - 15:16, 24 October 2008
- #Redirect [[One-time pad]]26 bytes (3 words) - 15:16, 24 October 2008
- #Redirect [[One-time pad]]26 bytes (3 words) - 15:16, 24 October 2008
- #Redirect [[One-time pad]]26 bytes (3 words) - 15:15, 24 October 2008
- #Redirect [[One-time pad]]26 bytes (3 words) - 15:15, 24 October 2008
- ...[http://www.ranum.com/security/computer_security/papers/otp-faq/index.htm One-Time Pad FAQ] is a common reference.149 bytes (22 words) - 07:48, 13 June 2010
- ...include a [http://www.ranum.com/security/computer_security/papers/otp-faq/ One-time pad FAQ] and one on [http://www.ranum.com/security/computer_security/papers/a1-286 bytes (45 words) - 01:02, 18 August 2010
- | pagename = One-time pad | abc = One-time pad1 KB (115 words) - 12:52, 28 September 2012
- {{r|One-time pad}}187 bytes (21 words) - 14:54, 25 October 2008
- {{r|One-time pad}}654 bytes (85 words) - 17:13, 11 January 2010
- {{r|One-time pad}}844 bytes (96 words) - 14:48, 4 April 2024
- ...than just a small key, to be kept secret are a bad idea. This applies to [[one-time pad]]s and to [[Cryptography#Codes_versus_ciphers|codes]] needing a codebook, a977 bytes (143 words) - 22:06, 6 February 2010
- {{r|One-time pad}}695 bytes (93 words) - 10:38, 9 May 2024
- Auto-populated based on [[Special:WhatLinksHere/One-time pad]]. Needs checking by a human.724 bytes (100 words) - 14:31, 22 March 2024
- {{r|One-time pad}}856 bytes (107 words) - 18:36, 11 January 2010
- {{r|One-time pad}}633 bytes (87 words) - 20:23, 11 January 2010
- ...lectronic version. The receiver has an identical pad to use in decryption. One-time pad is often abbreviated '''OTP''', which unfortunately also occurs as the abbr The great advantage of a one-time pad is that, properly used, it is provably secure against all [[passive attack]12 KB (1,878 words) - 05:48, 8 April 2024
- {{r|One-time pad}}828 bytes (106 words) - 14:41, 18 March 2024
- {{r|One-time pad}}1 KB (132 words) - 14:31, 22 March 2024
- ...thing that might be incriminating, such as a cipher machine or a book of [[one-time pad]] material.949 bytes (145 words) - 23:50, 12 May 2011
- ...om a smaller key. A system that generates its keying material is ''not'' a one-time pad; it is a stream cipher based on a random number generator. Secure [[stream ...resent. A proprietary, patent-pending, military-strength, million-bit-key, one-time pad built from encrypted prime cycle wheels is a sure warning sign to stay well6 KB (921 words) - 05:48, 8 April 2024
- {{r|One-time pad}}1 KB (173 words) - 14:49, 4 April 2024
- {{r|One-time pad}}2 KB (194 words) - 14:48, 4 April 2024
- {{rpl|One-time pad}}2 KB (243 words) - 17:48, 13 March 2024
- ...ne from [[cryptography#cryptanalysis|cryptanalysis]] because it used the [[one-time pad]] system, Soviet resource constraints apparently caused them to copy or reu5 KB (731 words) - 08:11, 4 May 2024
- :: I made it "In theory, any cipher '''except a [[one-time pad]]''' can be broken by a brute force attack", since stream ciphers are also6 KB (924 words) - 15:28, 2 October 2013
- ...with the plaintext bit by bit or character by character, somewhat like the one-time pad. In a stream cipher, the output stream is created based on an internal sta4 KB (546 words) - 05:48, 8 April 2024
- ...ee passive attacks that will ''in theory'' break any [[cipher]] except a [[one-time pad]]; variants of these work for either [[block cipher]]s or [[stream cipher]]3 KB (440 words) - 05:49, 8 April 2024
- A [[one-time pad]], which is provably secure against cryptanalysis, has a totally random key A one-time pad must absolutely, positively, be used only once. Even two uses, with differe12 KB (1,744 words) - 05:48, 8 April 2024
- This is an external article. See [[Talk:One-time pad/Permission]]. ::One-time pad decisionmaking, I suppose[[User:Howard C. Berkowitz|Howard C. Berkowitz]] 112 KB (1,894 words) - 22:57, 28 September 2012
- 4 KB (630 words) - 05:12, 7 June 2008
- [[One-time pad]]<br> : One-time pad was rejected for approval, at least partly because there was no expert revi12 KB (1,936 words) - 09:30, 7 June 2016
- A [[one-time pad]] is in effect the ultimate stream cipher. It requires a ''truly'' random k ...mproved, the security asymptotically approaches the provable security of a one-time pad. Of course it can never reach that, but with a good generator it may be clo24 KB (3,851 words) - 05:49, 8 April 2024
- ...with his WWII work at [[Bell Labs]], [[Claude Shannon]] proved that the [[one-time pad]] cipher is unbreakable, provided the key material is truly [[random number ...project that allowed cryptanalysis of Soviet espionage traffic, in which a one-time pad was used more than once.32 KB (4,913 words) - 14:38, 18 March 2024
- ...with his WWII work at [[Bell Labs]], [[Claude Shannon]] proved that the [[one-time pad]] cipher is unbreakable, provided the key material is truly [[random number ...project that allowed cryptanalysis of Soviet espionage traffic, in which a one-time pad was used more than once.32 KB (4,916 words) - 05:49, 8 April 2024
- A truly random one-time pad ''may'' be generated with a combination of measurement of a random physical ...y of historical interest, but typist patterns did cause weakness in some [[one-time pad]]s. It is hard to imagine why manual generation would be useful today.23 KB (3,650 words) - 05:49, 8 April 2024
- ...k:Sandy_Harris/Permission]]. Some of it I've already used here, e.g. see [[One-time pad]], but I'm busy with other stuff, don't have time to move it all in. Not al7 KB (1,208 words) - 07:39, 26 December 2015
- ...a key by brute force testing is theoretically possible, except against a [[one-time pad]], but the search time becomes practical only if the number of keys to be t11 KB (1,819 words) - 05:48, 8 April 2024
- |ISBN=0-521-79172-3}}</ref> With one notable exception - the [[one-time pad]] - these contingent proofs are the best available for cryptographic algori9 KB (1,312 words) - 05:49, 8 April 2024
- Another method, usable manually or on a computer, is a [[one-time pad]]. This works much like a stream cipher, but it does not need to generate a28 KB (4,396 words) - 06:22, 16 December 2008
- == one-time pad == :Sandy, I am unclear about what you're trying to do - and what is [[One-time pad]] is all about? Can you help me? And welcome to CZ, by the way! [[User:St54 KB (8,743 words) - 14:38, 18 March 2024
- ...ure. There are cited proofs that while it is not as clearly unbreakable as one-time pad, the computational complexity (not just "it produces really big numbers of ...ave real issues of getting the secure keys to the end users. Here and in [[one-time pad]] (OTP), it has been said that's it's totally impractical, which simply is53 KB (8,698 words) - 15:00, 20 March 2024
- ...with the plaintext bit by bit or character by character, somewhat like the one-time pad. In a stream cipher, the output stream is created based on an internal sta ...with his WWII work at [[Bell Labs]], [[Claude Shannon]] proved that the [[one-time pad]] cipher is unbreakable, provided the key material is truly [[random number51 KB (7,594 words) - 02:25, 1 April 2024
- ...with the plaintext bit by bit or character by character, somewhat like the one-time pad. In a stream cipher, the output stream is created based on an internal sta ...with his WWII work at [[Bell Labs]], [[Claude Shannon]] proved that the [[one-time pad]] cipher is unbreakable, provided the key material is truly [[random number52 KB (7,723 words) - 02:25, 1 April 2024
- ...ecret — is not usually a good approach. Nor, in most cases, are a [[one-time pad]] which needs a key as large as the whole set of messages it will protect, Another method, usable manually or on a computer, is a [[one-time pad]]. This works much like a stream cipher, but it does not need to generate a52 KB (8,332 words) - 05:49, 8 April 2024
- ...traffic. While the Soviets had originally used theoretically unbreakable [[one-time pad]]s for the traffic, some of their operations violated communications securi25 KB (3,805 words) - 22:34, 14 June 2009
- In theory, any cipher except a [[one-time pad]] can be broken by a [[brute force attack]]; the enemy just has to try keys53 KB (8,371 words) - 05:48, 8 April 2024
- == One-time pad ==77 KB (12,523 words) - 03:52, 8 March 2024
- ...e at least stubs for most of the articles they point to. Examples so far [[One-time pad]], [[Brute force attack]], [[random number]], ... [[User:Sandy Harris|Sandy69 KB (10,750 words) - 09:02, 4 May 2024
- ...ical role in [[cryptography]], where in particular it allows unbreakable [[one-time pad]]s to be efficiently constructed and used.<ref>Gehani A ''et al.'' [http://53 KB (8,436 words) - 00:53, 2 April 2008
- ...s a reference to Knuth on random numbers, or the von Neumann quote, in the one-time pad paragraph of [[Cipher]] "the relevant place"? Granted, they are fine, even I also put a link to the [[Random numbers]] article in [[One-time pad]]. [[User:Sandy Harris|Sandy Harris]] 23:04, 2 August 2008 (CDT)119 KB (20,018 words) - 18:02, 1 April 2024
- ...[passive attack]], [[active attack]] and some of their children. I think [[one-time pad]] is OK as far as it goes, but it likely needs additions on operational con213 KB (35,248 words) - 12:35, 7 May 2024
- * [[One-time pad]]54 KB (5,811 words) - 12:45, 12 May 2024