Linked from

The 42 pages that link to Cryptography, each with the reason it gives.

• Information theoryRelated: Entropy and conditional uncertainty help assess secrecy and randomness.

• Claude ShannonRelated: Shannon’s secrecy-system analysis gave cryptography a rigorous information-theoretic foundation.

• Chaos theoryRelated: Chaotic maps have been explored as sources of key generation and signal scrambling.

• BitRelated: Cryptographic systems encode and transform data represented as bits.

• Computational complexity theoryRelated: Many cryptographic systems rely on problems believed to resist efficient solution.

• CybersecurityRelated: It protects confidentiality, integrity, and authentication when data is stored or transmitted.

• Abstract algebraRelated: Finite groups and fields underpin widely used public-key and elliptic-curve systems.

• Computer securityRelated: Encryption and authentication protect data in storage, transit, and use.

• Random number generationRelated: Cryptographic systems rely on unpredictable keys, nonces, and other values.

• Commutative ringRelated: Finite commutative rings support arithmetic used in some cryptographic constructions.

• Information securityRelated: Cryptographic tools protect confidentiality, integrity, and authenticity across exposed channels.

• MathematicsRelated: Number theory and algebra underpin widely used public-key cryptographic systems.

• Pseudorandom number generatorRelated: Cryptographic protocols depend on unpredictable values, so ordinary generators can create serious vulnerabilities.

• Trial divisionRelated: Large cryptographic integers make trial division impractical, motivating reliance on hard factorization problems.

• National Security AgencyRelated: The NSA develops and evaluates cryptographic protections for national security systems.

• Inverse elementRelated: Several cryptographic operations rely on inverses in finite groups or modular arithmetic.

• WikiLeaksRelated: Secure communication can help sources transmit material without exposing its contents.

• OpenCLRelated: Some cryptographic workloads contain parallel operations suited to OpenCL devices.

• AnagramRelated: Simple letter rearrangements can disguise text, though anagrams alone provide no reliable security.

• Solovay–Strassen primality testRelated: Randomized primality tests help screen the large prime candidates used in public-key systems.

• Discrete mathematicsRelated: Number theory and finite structures support many cryptographic protocols.

• Theoretical computer scienceRelated: Its security claims often depend on assumptions about computational hardness.

• MathematicianRelated: Number theory and algebra underpin many modern cryptographic systems.

• Theory of computationRelated: Many cryptographic guarantees rely on computational problems believed to be infeasible to solve.

• Dan BrownRelated: Codes and concealed messages repeatedly structure the investigations in Brown's fiction.

• General-purpose computing on graphics processing unitsRelated: Some cryptographic workloads parallelize across independent inputs, though GPU suitability varies by algorithm.

• Hartmanis–Stearns conjectureRelated: Many cryptographic schemes rely on computational hardness, though P ≠ NP alone would not guarantee their security.