Information and communication theory, circuits Topic
Mathematical cryptography
Summary
Mathematical cryptography is the study of methods that keep information secret and authentic in the presence of an adversary, and of the mathematics on which their security rests. A cryptosystem is a set of algorithms for key generation, encryption and decryption, and it is secure in the computational sense when no efficient adversary can learn useful information about the message from the ciphertext without the key. Cryptography protects communication, payments and stored data, and its security rests on problems that are believed to be hard, such as integer factorization, discrete logarithms and lattice problems. Shannon gave a mathematical theory of secrecy systems in 1949, and Diffie and Hellman in 1976 and Rivest, Shamir and Adleman in 1977 started public-key cryptography. This topic collects the mathematical cryptography pages of math2. Its sub-areas are listed below, in reading order. Coding theory, information theory and the theory of computation have their own topics.
Remarks
Sub-areas
- Basic notions and classical ciphers
- Perfect secrecy and information-theoretic security
- The framework of computational security
- One-way functions and hardness assumptions
- Pseudorandom generators, functions and permutations
- Symmetric encryption and block ciphers
- Cryptanalysis of symmetric primitives and cryptographic Boolean functions
- Hash functions and message authentication
- RSA and factoring-based cryptography
- Integer factorization algorithms
- The discrete logarithm and Diffie-Hellman problems
- Public-key encryption and key exchange
- Digital signatures
- Elliptic and hyperelliptic curve cryptography
- Pairing-based cryptography
- Lattice problems and their hardness
- Lattice-based cryptosystems
- Code-based cryptography
- Multivariate cryptography
- Isogeny-based cryptography
- Post-quantum cryptography and the quantum threat
- Commitments and zero-knowledge proofs
- Secret sharing and threshold cryptography
- Secure multiparty computation
- Homomorphic encryption, obfuscation and other advanced primitives
Everything in this topic
The members of this topic and each page that they need, 25 pages in all.
Show the path as a graph
- no evidence level
- Basic notions and classical ciphers topic member
- Code-based cryptography topic member
- Commitments and zero-knowledge proofs topic member
- Cryptanalysis of symmetric primitives and cryptographic Boolean functions topic member
- Digital signatures topic member
- Elliptic and hyperelliptic curve cryptography topic member
- Hash functions and message authentication topic member
- Homomorphic encryption, obfuscation and other advanced primitives topic member
- Integer factorization algorithms topic member
- Isogeny-based cryptography topic member
- Lattice problems and their hardness topic member
- Lattice-based cryptosystems topic member
- Multivariate cryptography topic member
- One-way functions and hardness assumptions topic member
- Pairing-based cryptography topic member
- Perfect secrecy and information-theoretic security topic member
- Post-quantum cryptography and the quantum threat topic member
- Pseudorandom generators, functions and permutations topic member
- Public-key encryption and key exchange topic member
- RSA and factoring-based cryptography topic member
- Secret sharing and threshold cryptography topic member
- Secure multiparty computation topic member
- Symmetric encryption and block ciphers topic member
- The discrete logarithm and Diffie-Hellman problems topic member
- The framework of computational security topic member
About this page
| Tag | BR222BKW7C |
|---|---|
| URI | m2://BR222BKW7C |
| Kind | topic |
| Writing | W0 stub |
| MSC | 94A60, 94A62, 11T71 |
| Changed | 17 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a same_as or a source (0 of 1)
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
History
Each change to this page, from its provenance log. A change by an agent names its run.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
What links here
Nodes in this topic
- One-way functions and hardness assumptions
- The framework of computational security
- Secure multiparty computation
- Post-quantum cryptography and the quantum threat
- Secret sharing and threshold cryptography
- Cryptanalysis of symmetric primitives and cryptographic Boolean functions
- Multivariate cryptography
- Homomorphic encryption, obfuscation and other advanced primitives
- Symmetric encryption and block ciphers
- Lattice-based cryptosystems
- Code-based cryptography
- RSA and factoring-based cryptography
- Commitments and zero-knowledge proofs
- Isogeny-based cryptography
- Hash functions and message authentication
- Basic notions and classical ciphers
- Pairing-based cryptography
- The discrete logarithm and Diffie-Hellman problems
- Integer factorization algorithms
- Elliptic and hyperelliptic curve cryptography
- Digital signatures
- Lattice problems and their hardness
- Perfect secrecy and information-theoretic security
- Public-key encryption and key exchange
- Pseudorandom generators, functions and permutations