Contribute to Cryptology City

Cryptology City is a large project and requires many people to work together to create something useful. One reason that it is so difficult to systematize cryptology is that there are a variety of definitions, notations, variations, and colliding terms throughout a lot of the literature. It's very easy to get confused or lost in the details.

This flexibility is often useful! It allows authors to tailor their presentation for their paper, but here we want to try to bring everything under similar(ish) notation and standards where possible. This page should hopefully serve as a guide for contributors who are not sure what to include in their contributions or how to format them.

For people are more interested in the broader direction of the website or would like to help beyond adding to the knowledge base, I have also started a Keybase team to discuss the project in more detail. Feel free to join me there!

For those who are more keen to pattern match, here are some prototypical examples of Cryptology City pages.

Primitives:

• Pseudorandom Function (PRF)
• One-way Function (OWF)
• Public Key Encryption (PKE)
• Oblivious RAM (ORAM)

Assumptions:

• Decision Diffie-Hellman (DDH)
• RSA Assumption
• Computational Diffie-Hellman (CDH)
• Discrete Logarithm (DLOG)
• Learning with Errors (LWE)