propose initial format for uncloak

.gitignore

@@ -1,3 +1,6 @@
+#
+.obsidian*
+
 # Byte-compiled / optimized / DLL files
 __pycache__/
 *.py[cod]

.trash/sources/Source-1976-11 New directions in cryptography.md

@@ -0,0 +1,12 @@
+---
+publish: true
+category: source
+audience: research
+---
+# Source: New directions in Cryptography
+[Source](https://ieeexplore.ieee.org/document/1055638) 
+## Abstract
+Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper suggests ways to solve these currently open problems. It also discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
+
+## Editors' Note
+This paper introduced Asymmetric Key cryptography, unlocking, as the paper's title portends, an entirely new direction for cryptography to develop as a field.

.trash/sources/Source-MD5 vulnerable to collision attacks.md

@@ -0,0 +1,10 @@
+---
+publish: true
+category: source
+audience: research
+---
+# Source: New directions in Cryptography
+[Source](https://www.kb.cert.org/vuls/id/836068)
+## Abstract
+
+Weaknesses in the MD5 algorithm allow for collisions in output. As a result, attackers can generate cryptographic tokens or other data that illegitimately appear to be authentic.

README.md

@@ -0,0 +1,56 @@
+---
+publish: true
+---
+# Uncloak: A Community Maintained Cryptography Resource
+Welcome to Uncloak, a community-maintained knowledge wiki experiment, aiming to increase the accessibility of cryptography for developers, researchers, and everyone else. 
+
+Our approach to knowledge organization attempts to incorporate basic ideas about how knowledge is constructed by representing links between concepts as connections between nodes in a graph. We believe this approach may help to clarify how to approach cryptography as a field for readers of all levels, while aiming to maintain a high standard for what information is relevant for different audiences.
+
+The site will initially focus on generating content directed at cryptography learners and developers in cryptography engineering and zero knowledge, as we see these fields as most lacking in resources. Where there are already decent existing resources (wikipedia pages, blog posts, etc.), the site will aim to link to them, while we expand content in target areas where the need is greater. These stubs are great candidates for first-time-contributions.
+
+Work on site content began in November 2022; the site graph is sparse at the moment, but growing. If you see an area you might like to improve, we appreciate contributions to the site. Currently the best way to do so is by opening an issue or pull request on our [Github](https://github.com/thor314/uncloak).  If you're reading this from Github, the site is hosted at https://uncloak.org. Though the site is hosted via [Obsidian Publish](https://obsidian.md/publish), you don't need to use [Obsidian](https://obsidian.md/) to contribute to the site; all files are pure Markdown. We're currently working on resources for site contributors. 
+
+Our [Discord](https://discord.gg/TYwr4pMS2h) is a good place to ask questions and connect with other contributors. We also have a [Twitter](https://twitter.com/uncloakcrypto) account for site-related announcements. Questions for the site maintainer should be directed at thorck a-squiggle pm dot me.
+
+The Obsidian-Publish mobile site is unfortunately unable to display the desktop-only interactive graph.
+
+[[Topic-Cryptography|Click here, or on the graph, to continue to the site root node on cryptography]].
+
+## Tips for making best use of the site
+If you've ever rabbit-holed on Wikipedia and thought, "oh that went pretty well, but the relationship between those concepts is still a little unclear" then you basically already know what the site is about. This site aims to address the complaint that it can be difficult to know where a particular concept or tool fits in context. Hyperlinks between typical wiki pages demonstrate connections between concepts, but without much context. The graph is an attempt at generating that context.
+
+To see this in action, take a look at the path from [[Topic-Number Theory]] to the [[Algorithm-Extended Euclidean Algorithm]]. If you're viewing this from the website, you can see the path traverses [[Set-Integers]] and [[Algorithm-Euclidean Algorithm]]. The path between nodes and the system of node categorization is how the site attempts to put these concepts in context. 
+
+*Nit-pickers: yes, the extended euclidean algorithm can be applied to objects other than integers, and no, the structure of the graph is not final. Open a PR to propose updates to nodes and alternative organizing structures. Pedantry and nitpicking are welcome, we would appreciate your help.*
+
+Each page includes **forward-links** and **backlinks** (you can find backlinks at the bottom of the page in the section titled "Links to this page"). The prior paragraph contains 5 forward links; no other page in the wiki links to the README, so there are no backlinks for this page, but *every other node* in the wiki is linked to by at least one other node. 
+
+**A rule of thumb:** To navigate the graph structure, traveling *forward* links, especially those at the bottom of a page, generally direct the reader *toward the edges of the graph*, where knowledge may be more specific and technical. Traveling *backlinks* returns the reader toward the *central root*, and higher-level topic discussion.
+
+The site graph can sometimes be a bit messy; pages are also organized by folders, representing what primary topics the page falls under. Folders can be navigated in the left sidebar. The sidebar also contains a search bar, for readers who already have some idea of what information they're trying to find.
+
+Similar to Wikipedia, hovering over any site-internal link will produce a modal pop-up with the contents of that resource. This works recursively; you can produce nested pop-ups by hovering over links in the pop-up.
+
+The *global graph* feature on the website is buggier than the desktop *global graph*, sometimes refusing to render. If you clone the [Github](https://github.com/thor314/uncloak) and open the graph as an Obsidian vault (requires downloading Obsidian, which is free), you can even see the entire graph structure by calling the function `Graph view: Open Graph View`. 
+
+Optionally, for more on using Obsidian, consult the Uncloak Obsidian Usage guide (todo).
+
+## Contributor Guide
+For more on contributing, see [[Topic-Meta]].
+
+## How to give
+The site would not be possible without the support of grants and donations. The site maintainer works full time on improving site content, alongside volunteer contributors.
+
+If you would like to support the continued growth of the site, consider donating. Some addresses are managed through Kraken, which may include a minimum deposit. 
+
+We also participate in [Gitcoin Grants](https://gitcoin.co/grants/9478/uncloak-cryptography) rounds. The next round is anticipated to start in late November; we will make an announcement on the [Uncloak Twitter](https://twitter.com/uncloakcrypto) when the round is beginning.
+- [Patreon](https://www.patreon.com/uncloak/membership)
+- Paypal: @thorck (may be challenged for last 4 cell digits: 7582)
+- Venmo: @cryptograthor
+- Eth/Polygon/Optimism/Arbitrum/zkSync: 0xaE72f891Fc9914b13a90cbED799ee73359077bee
+- Bitcoin: 3JyCwpwpUkXRiiQQqQ2fq3omvLZF1Jtz4N (min deposit: 0.0001 BTC)
+- Cosmos: cosmos15lescyy00y6v8nz5ujxn4ry3wpltxklr30pd22 (min deposit: 1 ATOM)
+- Polkadot: 13Mpe6FR2Tm968QpH62WMTaafwpqePaJXpxwvXbitBu7xwyx (min deposit: 1 DOT)
+- Solana: 6SBQGqhfnazaEQQycvk2MSbNtgjwhTK8TgrujNxBgsW (min deposit: 0.01 SOL)
+- Monero: 8ARaWkq7BBm3EMoRxg635qA3V1VZLzwbaWGqNvCxyDf28SFpgH3prxUduhtSaKFFsDg69HFqNMGxxJJZJ5Zk4G7NVmuvePC (min deposit: 0.1 XMR)
+- Zcash: t1bMzCnGkCz5SYGmnpAnTn6SRECvuwdiv5X (min deposit: 0.00500 ZEC)

Topic-Cryptography.md

@@ -0,0 +1,22 @@
+---
+publish: true
+audience: all
+---
+#topic 
+# Topic: Cryptography
+## Intro
+**Cryptography** (also cryptology) is the practice and study of secure techniques for private communication, authentication, and computation in the presence of adversarial behavior. 
+
+Cryptography comes from the Greek root words *kryptos*, meaning hidden, and *graphikos*, meaning writing.
+
+## Subtopics
+- [[Topic-Hash Functions]]
+- [[Topic-Encryption]]
+- [[Topic-Cryptanalysis]]
+- [[Topic-Zero Knowledge]]
+- [[Topic-Cryptography Engineering]]
+- [[Topic-Cryptography Aphorisms]]
+- [[Topic-Cryptography Related Topics]]
+- [[Topic-Post Quantum Cryptography]]
+## Related
+- [Wikipedia Article](https://en.wikipedia.org/wiki/Cryptography)

aphorism/Aphorism-Don't Roll Your Own Crypto.md

@@ -0,0 +1,10 @@
+---
+publish: true
+audience: all
+---
+#aphorism 
+# Aphorism: Don't Roll Your Own Crypto
+## Intro
+
+
+## Related

aphorism/Aphorism-Kerckhoffs's Principle.md

@@ -0,0 +1,12 @@
+---
+publish: true
+audience: all
+---
+#aphorism
+# Aphorism: Kerckhoffs's Principle
+## Intro 
+A cryptosystem should be secure, even if everything about the system, except the key, is public knowledge.
+
+## Related 
+- [Wikipedia Article](https://en.wikipedia.org/wiki/Kerckhoffs%27s_principle)
+- [[Aphorism-Shannon's Maxim]]

aphorism/Aphorism-Shannon's Maxim.md

@@ -0,0 +1,11 @@
+---
+publish: true
+audience: all
+---
+#aphorism
+# Aphorism: Shannon's Maxim
+## Intro 
+"The enemy know's the system", or "one ought to design systems under the assumption that the enemy will immediately gain full familiarity with them." An algorithm's level of security can only stay the same or decrease with time, as improvements to attacks are discovered.
+
+## Related 
+[[Aphorism-Kerckhoffs's Principle]]

aphorism/Topic-Cryptography Aphorisms.md

@@ -0,0 +1,14 @@
+---
+publish: true
+audience: all
+---
+#topic 
+# Topic: Cryptography Aphorisms
+## Intro 
+
+## Objects
+- [[Aphorism-Don't Roll Your Own Crypto]]
+- [[Aphorism-Kerckhoffs's Principle]]
+- [[Aphorism-Shannon's Maxim]]
+
+## Subtopics

cryptanalysis/Attack Type-Brute Force.md

@@ -0,0 +1,11 @@
+---
+publish: true
+audience: all
+---
+#object/attack-type 
+
+# Attack Type: Brute Force
+
+
+## Related
+- [Wikipedia Article](https://en.wikipedia.org/wiki/Brute-force_attack)

cryptanalysis/Attack Type-Collision Attack.md

@@ -0,0 +1,10 @@
+---
+publish: true
+audience: all
+---
+#object/attack-type 
+# Attack Type: Collision Attack
+
+
+## Related:
+- [Wikipedia Article](https://en.wikipedia.org/wiki/Collision_attack)

cryptanalysis/Attack Type-Frequency Analysis.md

@@ -0,0 +1,10 @@
+---
+publish: true
+audience: all
+---
+#object/attack-type 
+# Attack Type: Frequency Analysis
+
+
+## Related:
+- [Wikipedia Article](https://en.wikipedia.org/wiki/frequency_analysis)

cryptanalysis/Attack Type-Length Extension Attack.md

@@ -0,0 +1,10 @@
+---
+publish: true
+audience: all
+---
+#object/attack-type 
+# Attack Type: Length Extension Attack
+
+
+## Related
+[Wikipedia Article](https://en.wikipedia.org/wiki/Length_extension_attack)

cryptanalysis/Attack Type-Rainbow Table.md

@@ -0,0 +1,10 @@
+---
+publish: true
+audience: all
+---
+#object/attack-type 
+# Attack Type: Rainbow Table 
+
+
+## Related
+- [Wikipedia Article](https://en.wikipedia.org/wiki/Rainbow_table)

cryptanalysis/Topic-Cryptanalysis.md

@@ -0,0 +1,19 @@
+---
+publish: true
+audience: all
+---
+#topic
+# Topic: Cryptanalysis
+## Intro 
+
+## Subtopics
+
+## Objects
+- [[Attack Type-Brute Force]]
+- [[Attack Type-Rainbow Table]]
+- [[Attack Type-Collision Attack]]
+- [[Attack Type-Frequency Analysis]]
+- [[Attack Type-Length Extension Attack]]
+
+## Related
+- [Wikipedia article](https://en.wikipedia.org/wiki/Cryptanalysis)

cryptography engineering/Topic-Cryptography Engineering.md

@@ -0,0 +1,12 @@
+---
+publish: true
+audience: all
+---
+#topic 
+# Topic: Cryptography Engineering
+## Intro
+
+## Subtopics
+
+## Related
+- Recommended Resource: [Cryptography Engineering: Design Principles and Practical Applications: Ferguson, Niels, Schneier, Bruce, Kohno, Tadayoshi](https://www.amazon.com/Cryptography-Engineering-Principles-Practical-Applications/dp/0470474246)

encryption/Topic-Encryption.md

@@ -0,0 +1,38 @@
+---
+publish: true
+audience: all
+---
+#topic 
+# Topic: Encryption
+## Intro
+**Encryption** and decryption is process of algorithmically hiding and unhiding information. Cryptography terms the original message the [plaintext](https://en.wikipedia.org/wiki/Plaintext), and the encrypted message [ciphertext](https://en.wikipedia.org/wiki/Ciphertext), [cipher](https://en.wikipedia.org/wiki/Cipher) being the historical word for a [[Topic-Symmetric Encryption|symmetric encryption algorithm]]. Encryption is often described in a message passing context between two parties, but includes the hiding of static information, as in the case of [Disk Encryption](https://en.wikipedia.org/wiki/Disk_encryption) .
+
+Encryption can be broadly categorized into two categories: symmetric encryption and [[Topic-Asymmetric Encryption|asymmetric encryption]] (public key encryption). Symmetric encryption algorithms require both the encrypter and decrypter to have access to the same information, a shared key. In asymmetric key cryptography, the receiving decrypter holds a secret key (known only to the decrypter), while the encrypter uses the receiving party's public key (which may be published online, or distributed in any way). 
+
+```mermaid
+sequenceDiagram
+participant Alice
+participant Bob
+Note over Alice, Bob: Symmetric Encryption
+Alice ->> Bob: ciphertext=Encrypt(message,key)
+Note right of Bob: m=Decrypt(c, k)
+
+Note over Alice, Bob: Asymmetric Encryption
+Alice ->> Bob: c=E'(m, Bob public key)
+Note right of Bob: message=D'(c, Bob secret key)
+```
+
+Symmetric key encryption is at least as old as Julius Caesar, who was said to use a rotation cipher, termed the [Caesar Cipher](https://en.wikipedia.org/wiki/Caesar_cipher), to conceal his messages from enemy soldiers circa 69 BCE[^1].
+
+Asymmetric Key encryption is a significantly more recent invention: it was simultaneously conceived of by [James H. Ellis](https://en.wikipedia.org/wiki/James_H._Ellis) of the British intelligence agency GCHQ between 1970-1974, and by [Whitfield Diffie](https://en.wikipedia.org/wiki/Whitfield_Diffie) and [Martin Hellman](https://en.wikipedia.org/wiki/Martin_Hellman) in their 1976 paper [New Directions in Cryptography](https://ieeexplore.ieee.org/document/1055638). The discovery by GCHQ was not disclosed until 1997[^2].
+
+## Subtopics
+- [[Topic-Symmetric Encryption]]
+- [[Topic-Asymmetric Encryption]]
+
+## Related
+- [Wikipedia Article](https://en.wikipedia.org/wiki/Encryption)
+
+## References
+[^1]: [Suetonius, Vita Divi Julii](http://thelatinlibrary.com/suetonius/suet.caesar.html#56)
+[^2]: [GCHQ: James Ellis](https://www.gchq.gov.uk/person/james-ellis)

encryption/asymmetric encryption/Topic-Asymmetric Encryption.md

@@ -0,0 +1,12 @@
+---
+publish: true
+audience: all
+---
+#topic
+# Topic: Asymmetric Encryption 
+## Intro
+
+## Subtopics
+
+## Related
+- [Wikpedia Article](https://en.wikipedia.org/wiki/Public-key_cryptography)

encryption/symmetric encryption/Topic-Symmetric Encryption.md

@@ -0,0 +1,15 @@
+---
+publish: true
+audience: all
+---
+#topic 
+# Topic: Symmetric Encryption
+## Intro
+
+## Subtopics
+- [[Topic-Historical Ciphers]]
+- [[Topic-Block Ciphers]]
+- [[Topic-Stream Ciphers]]
+
+## Related
+- [Wikipedia Article](https://en.wikipedia.org/wiki/Symmetric-key_algorithm)

encryption/symmetric encryption/block ciphers/Topic-Block Ciphers.md

@@ -0,0 +1,15 @@
+---
+publish: true
+audience: all
+---
+#topic
+# Topic: Block Ciphers
+## Intro
+
+
+## Objects
+- 
+## Subtopics
+
+## Related
+- [Wikipedia Article](https://en.wikipedia.org/wiki/https://en.wikipedia.org/wiki/Block_cipher)

encryption/symmetric encryption/historical ciphers/Algorithm-Caesar Cipher.md

@@ -0,0 +1,20 @@
+---
+publish: true
+audience: all
+date-origin: ~69 BCE
+date-broken: ?
+---
+#object/algorithm 
+# Algorithm: Caesar Cipher
+## Intro
+
+## Relation to Similar Algorithms
+
+## Attacks
+
+## Related
+- [Wikipedia Article](https://en.wikipedia.org/wiki/Caesar_cipher)
+- [[Attack Type-Brute Force]]
+- [[Attack Type-Frequency Analysis]]
+
+## References 

encryption/symmetric encryption/historical ciphers/Algorithm-Substitution Cipher.md

@@ -0,0 +1,20 @@
+---
+publish: true
+audience: all
+date-origin: ?
+date-broken: ?
+---
+#object/algorithm 
+# Algorithm: Substitution Cipher
+## Intro
+
+## Relation to Similar Algorithms
+
+## Attacks
+
+## Related
+- [Wikipedia Article](https://en.wikipedia.org/wiki/Substitution_cipher)
+- [[Attack Type-Brute Force]]
+- [[Attack Type-Frequency Analysis]]
+
+## References