Talk:Cryptography
| This is the talk page for discussing improvements to the Cryptography article. This is not a forum for general discussion of the subject of the article. |
Article policies
|
| Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
| Archives: 1, 2, 3, 4, 5, 6Auto-archiving period: 6 months |
"Distinguish between the essential aspects and variations of"Science", "Engineering", "Philosophy", Application" and "Management" of cryptography because the language, contexts and perspectives are complicated and different.. Roy D. Follendore III (talk) 14:15, 16 August 2019 (UTC) Priority 1 (top)
|
| Text and/or other creative content from this version of Cryptography was copied or moved into Cryptography law with this edit. The former page's history now serves to provide attribution for that content in the latter page, and it must not be deleted as long as the latter page exists. |
| Cryptography 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. | ||||||||||||||||
| This article appeared on Wikipedia's Main Page as Today's featured article on July 22, 2006. | ||||||||||||||||
| ||||||||||||||||
| Current status: Former featured article | ||||||||||||||||
| This It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Add mention of quantum cryptography
[edit]It seems odd that the main Wikipedia article on cryptography contains no description or link for quantum cryptography. Especially as the article contains several mentions of post-quantum cryptography (one of which was recently added), and a number of the existing references include quantum cryptography in their titles.
I'm not qualified to add such a section. So I leave this suggestion here. -- M.boli (talk) 21:24, 30 July 2025 (UTC)
ZOSCII (Zero-Overhead Secure Code Information Interchange)
[edit]I believe ZOSCII deserves inclusion in this article or potentially its own article. It provides what appears to be information-theoretic security.
Overview
[edit]ZOSCII is an Open Sourced encoding system (not encryption). It is an alternative scheme which provides Post Quantum Computer level security and the mechanism relies on address-based indirection, distinguishing it from conventional lattice-based or code-based PQC methods, while still satisfying the requirement for quantum resistance.
Why This Matters for Wikipedia
[edit]Verifiable Challenge: There is a public challenge at zosciicoin.com with cryptocurrency that has remained unclaimed for 3+ months (as of October 2025), providing empirical evidence of the system's resistance to attack.
Expert Commentary: The system has been dismissed by cryptography experts (notably Bruce Schneier called it "snake-oil of the highest degree" in private correspondence), yet no one has successfully broken it. This controversy itself is encyclopedic.
Fundamental Difference: ZOSCII operates on information-theoretic principles similar to one-time pads but with address-based indirection. This contrasts with traditional PQC, which often relies on computational hardness problems (like the shortest vector problem in lattices) that are believed to be difficult even for quantum computers.
Technical Mechanism
[edit]The system works by: 1. Using a shared 64KB+ high-entropy file (LUT) as reference 2. Encoding each byte by selecting a random address where that byte value appears in the LUT 3. Output is simply a list of addresses with no mathematical transformation
Security properties:
- Without the LUT: addresses are meaningless random numbers
- With wrong LUT: produces different but equally plausible data
- No distinguishable pattern that indicates encoding occurred
- Multiple valid interpretations possible (plausible deniability)
Controversy and Criticism
[edit]Academic Reception: The system has been dismissed by traditional cryptographers as "not encryption" because it doesn't use mathematical transformations. Critics argue this represents "security through obscurity."
Counterargument: Proponents argue this criticism misses the point - the system claims to be "not encryption" but rather a novel, information-theoretic form of **Post-Quantum** security. The security derives from ambiguity, not obscurity. The address list provides zero Shannon information about the plaintext without the LUT.
Open Questions:
- Is this genuinely novel or a variant of existing information-theoretic approaches?
- **Is its non-mathematical approach a valid PQC model?**
Notability Concerns
[edit]I acknowledge potential WP:NOTABILITY concerns:
- Limited peer-reviewed academic publications
- Creator appears to work independently rather than through traditional academic channels
- Main sources are project website and GitHub repository
However, I argue notability exists due to:
- Public challenge with verifiable monetary stakes (empirical testing)
- Commentary from recognized experts (even if dismissive)
- Novel approach that challenges conventional cryptographic thinking
- Growing discussion in online security communities
Proposed Sections
[edit]If included, I suggest:
- Brief technical overview (without implementation details that could be WP:HOWTODOC)
- Comparison to traditional **cryptography** and **conventional Post-Quantum** approaches
- Expert commentary and controversy
- Public challenge and empirical results
- Criticism and counterarguments
Request for Input
[edit]Before creating an article or major section, I'd like community feedback on:
- Is this sufficiently notable for Wikipedia inclusion?
- Should it be its own article or subsection of Information-theoretic security?
- What reliable secondary sources exist beyond expert commentary and the public challenge?
- How do we handle the tension between expert dismissal and empirical results?
The core question: Does Wikipedia document only academically-accepted approaches, or also controversial systems with empirical evidence but limited peer review?
PrimalNinja (talk) 02:30, 6 October 2025 (UTC)
- Not worth of inclusion until there is coverage by secondary sources. Brandon (talk) 20:36, 5 October 2025 (UTC)
- Wikipedia pages with to-do lists
- Wikipedia former featured articles
- Featured articles that have appeared on the main page
- Featured articles that have appeared on the main page once
- C-Class level-3 vital articles
- Wikipedia level-3 vital articles in Technology
- C-Class vital articles in Technology
- C-Class mathematics articles
- Top-priority mathematics articles
- Featured articles on Mathematics Portal
- C-Class Computer science articles
- Top-importance Computer science articles
- WikiProject Computer science articles
- C-Class Computer security articles
- Top-importance Computer security articles
- C-Class Computer security articles of Top-importance
- C-Class Computing articles
- Top-importance Computing articles
- All Computing articles
- All Computer security articles
- C-Class Cryptography articles
- Top-importance Cryptography articles
- WikiProject Cryptography articles
- C-Class WikiProject Cryptocurrency articles
- Top-importance WikiProject Cryptocurrency articles
- WikiProject Cryptocurrency articles



