9-16 of 55 results
Open links in new tab
  1. Discrete logarithm - Wikipedia

    Discrete logarithm Discrete logarithm modulo 5, with base 2. In mathematics, for given real numbers and , the logarithm is a number such that . The discrete logarithm generalizes this …

  2. Digital Signature Algorithm - Wikipedia

    The Digital Signature Algorithm (DSA) is a public-key cryptosystem and Federal Information Processing Standard for digital signatures, based on the mathematical concept of modular …

  3. Symmetric-key algorithm - Wikipedia

    Symmetric-key algorithms[a] are algorithms for cryptography that use the same cryptographic keys for both the encryption of plaintext and the decryption of ciphertext.

  4. Cryptography - Wikipedia

    Modern cryptography is heavily based on mathematical theory and computer science practice; cryptographic algorithms are designed around computational hardness assumptions, making …

  5. Lattice-based cryptography - Wikipedia

    Security Lattice-based cryptographic constructions hold a great promise for public-key post-quantum cryptography. [38] Indeed, the main alternative forms of public-key cryptography are …

  6. RSA cryptosystem - Wikipedia

    The RSA algorithm involves four steps: key generation, key distribution, public-key operation (used for encryption or verifying a signature), and private key operation (used for decryption or …

  7. Zero-knowledge proof - Wikipedia

    The red card proof One example of a math-free zero knowledge proof is if Peggy wants to prove to Victor that she has drawn a red card from a standard deck of 52 playing cards, without …

  8. Post-quantum cryptography - Wikipedia

    Post-quantum cryptography (PQC), sometimes referred to as quantum-proof, quantum-safe, or quantum-resistant, is the development of cryptographic algorithms (usually public-key …