Former featured articleCryptography is a former featured article. Please see the links under Article milestones below for its original nomination page (for older articles, check the nomination archive) and why it was removed.
Main Page trophyThis article appeared on Wikipedia's Main Page as Today's featured article on July 22, 2006.
Article milestones
DateProcessResult
July 21, 2005Featured article candidateNot promoted
July 2, 2006Featured article candidatePromoted
May 26, 2011Featured article reviewDemoted
Current status: Former featured article

A method used by intelligence edit

A method used by cyberespionage is the modular variablocks method: "variable length of encryption blocks/cryptoblocks". In this system, we don't codify a standard length of bit-quanta, instead inside the key there is a code of the pattern block-change. It is safer to use a separate key in order to select (algorithmically) a variablock pattern. All users of this encryptive method should know beforehand the algorithms of the variable bit-quanta. Also if we have 30 different sizes of bit-quanta, we need 30 different encryptional vocabularies for the translation (they can be algorithmically related; if they are not related, the system is safer, but you have to use more keys). This system has some problems though. 1. you might have to use two or more keys, 2. if your message has noise you might lose the correct pattern of bit-length-variation, you can protect your message from noise by adding one more layer of anti-noise transcription, but that makes your message longer

If you design it carefully it works just fine, but you have to apply anti-noise encoding, otherwise you might lose track of the variable sections. Remember, variable sections means variable cryptographic dictionary. You must create great algorithms, otherwise it won't work well! It's a very old method, but great (if programmed well)!


simple English: Hell_i|s_empty_a|nd_all_t|he|_dev|i|ls_are_|here. (6-9-8-2-4-1-7-5-etc... modular variablock section, each number of digits per section corresponds to a different cryptodictionary, even the result can be of variable block length, but you then need more keys and more anti-noise layers)
We deliver some key components via different e-mails, some via-different telephones and some face to face at many meetings, also we deliver separately the order of usage. Lazy people deliver one finalized huge key, and everybody reads their messages.
If you rotate the same bit-widths in exact order, infiltrators might be able to find your partition pattern either your message. The whole point is to complicate the order, but that might cause problems to the sender if (s)he's a bad programmer. If you're Japanese it always works!
And the most important thing is that we add meaningless random digits at certain (pseudorandom-dedicated) partitions the algorithm dedicates for randomness. That also might cause some problems. If your noise is thoroughly random, the infringer might understand some bit-width partition sections. We use pseudorandom algorithms, in order the result is "natural". Do it well, or don't do it at all! It saves or betrays you!!! (we know which partitions have pseudorandom digits, and we simply delete these)
Each bit-width corresponds to many different bit-width encoded dictionaries. This method creates huge dictionaries with many languages that have different widths for the same input. You don't have to know all the codes beforehand. Algorithms do it for you. It still remains a big-data option, but it works fine if programmed well. This system has huge hidden entropy. We never repeal the whole pattern of our systemic entropy, because we use many "cryptolanguages" and we only know how we apply each one. And that code doesn't always work. A Russian girl fucks an agent. No crypt-anal-ysis needed.
Before we do that, we encrypt our message with other methods. Always use many layers of different methods of encryption.

Cryptographic Hash Functions edit

The article's description and categorization of cryptographic hash functions is currently incorrect. Cryptographic hash functions can be used in either symmetric or asymmetric encryption and are essentially kinds of keys. The 'symmetric' vs. 'asymmetric' distinction refers to how the keys are shared, if they're shared at all. CessnaMan1989 (talk) 17:31, 7 September 2021 (UTC)Reply

Added sections "Applications" and "Social issues" + split request edit

A few weeks year ago, technically (how time flies!), I added the sections "Applications" and "Social issues" to this article per User:Nageh's feedback on the 2011 featured article review. Though I was able to add a lot of stuff to the Applications section (and I'm we're hardly getting started!), the various applications of cryptography is a vast topic (as evidenced, for example, by the sheer size of Category:Applications of cryptography) and so deserves its own article. Therefore, I propose that this section be expanded and then split into another article titled Applications of cryptography.

I also added the section "Social issues". However, I have no idea[1] what to put in it, so I left it blank. (Presumably, it should have enough stuff that it would have to be a mere summary of another article titled Social issues of cryptography, but that's another story.) I would ask Nageh himself, but, alas, it seems that he left Wikipedia in 2013[2] due to excessive wikidrama. Duckmather (talk) 18:42, 2 January 2022 (UTC)Reply

Duckmather (talk) 18:42, 2 January 2022 (UTC)Reply

@Duckmather: What is in the applications section currently is a bit light for an article, I think, and does not seem not undue here. If you or someone else were to write more content in a separate article, then one could replace the content currently here with a summary of that article. Otherwise, I would say we should just keep expanding the section here and split it when it is actually too large to remain at the main article. Felix QW (talk) 19:19, 18 November 2023 (UTC)Reply
@Felix QW: Fine, I removed the split tag; thanks for your astute observation. Duckmather (talk) 05:36, 21 November 2023 (UTC)Reply

Viet Nam POW code edit

Did you guys know about this code? If not, you set up a square that has five letters in a row, then you set up five rows on it. Then you place certain letters in it that has dual sounds in it, such as C, G, Y in it to replace certain other letters in it. Here is a example:

   A B C D E
   F G H I L
   M N O P Q
   R T U V W
   X Z J K Y

From this, you tap(on a excellent sound conducting surface, like a pipe), for the letter Q, tap five times, wait for one sec.,tap three times. You repeat this, only you adjust what you are doing for each letter as you spell out your words. In this one, the letter C will be used for the letter S. This was created by shot down US POWs who ended up in the Hanoi Hilton, a Viet Nam prison camp. This was in a print issue of The Readers Digest. I can't source this at this time. Some of the issues referred to what happened in Viet Nam, during the Viet Nam War, and this cipher system was in these articles. There are variations of this system, all created to confuse the Vietnamese guards.

How is pre ISBN, pre Internet, print media sourced for Wikipedia? Thanks. Wikipedia is the best. 😘🥰 Nuclear Sergeant (talk) 09:35, 15 July 2023 (UTC)Reply

There's an article about this at Tap code. JaggedHamster (talk) 18:53, 16 July 2023 (UTC)Reply

Security lines edit

Do we have to have a working phone to do this is it all done through the network as long as you have a Wi-Fi network or some sort to use it and what is the encryption technology 256 or what 71.219.144.28 (talk) 19:27, 29 September 2023 (UTC)Reply

Wiki Education assignment: INFO 505 - Foundations of Information Science edit

  This article was the subject of a Wiki Education Foundation-supported course assignment, between 22 August 2023 and 11 December 2023. Further details are available on the course page. Student editor(s): Mayoosan (article contribs). Peer reviewers: Chillimune.

— Assignment last updated by Chillimune (talk) 01:58, 12 December 2023 (UTC)Reply

  1. ^ Because I am That Kind of Person™, I asked GPT-J (on default creativity settings) to imagine the contents of the (as of now hypothetical) Wikipedia article titled Social issues of cryptography. In response, I got an essay with a brilliant lead sentence ("The social issues of cryptography are the study of cryptographic technology and its interactions with society.") but which then degrades into an inane discussion of public policy and various applications of cryptography (it starts going into a tangent about electronic voting, which is where I cut generation off). I tried this several times with different models and creativity settings and got similar results each time. Absolutely useless. [original research]
  2. ^ At least, in the featured article review, User:Tijfo098 refers to Nageh with male pronouns.