Notes - MCS
Applied Cryptography
Notes - MCS
Applied Cryptography
  • Applied Cryptography
  • Classical (Symmetric) Cryptography
    • Terminology
    • The Players
    • Use Cases
    • Information-Theoretic Security
    • Computational Security
    • Cryptanalysis
    • Practical Approaches
    • Cryptographic Robustness
    • Ciphers
      • Mono-Alphabetic
      • Polylphabetic
    • Rotor Machines
    • Stream Ciphers
  • Modern Symmetric Cryptography
    • Types
    • Symmetric Ciphers
    • Symmetric Block Ciphers
    • Feistel Networks
    • DES (Data Encryption Standard)
    • AES (Advanced Encryption Standard)
    • Stream Ciphers
    • Uniform Random Access
    • Linear Feedback Shift Register (LFSR)
  • Cipher Modes
    • Deployment of (Symmetric) Block Ciphers
    • Stream Cipher Modes
    • Security Reinforcement
  • Cryptographic Hashing
    • Digest functions
    • Rainbow Tables
    • Message Authentication Codes (MAC)
    • Authenticated Encryption
    • Encryption + Authentication
  • RSA & Related Subjects
    • Modular Arithmetic
    • Fast Modular Multiplication
    • The Extended Euclid's Algorithm
    • Linear Maps
    • Fermat's Little Theorem
    • Chinese Remainder Theorem
    • Fermat's Little Theorem
    • Modular Exponentiation
    • Multiplicative Order
    • The Discrete Logarithm Problem
    • Primality tests
    • The Diffie-Hellman Key Exchange Protocol
    • ElGamal Public Key Cryptosystem
    • The Rivest-Shamir-Adleman Cryptosystem
    • Finite Fields
    • Elliptic Curves
    • Diffie-Hellman using elliptic curves
    • Can we do RSA-like things with elliptic curves?
    • The discrete logarithm problem for elliptic curves
    • Secret sharing
    • Quadratic Residues
    • Zero-Knowledge proofs
      • One of two oblivious transfer
      • Coin flipping
      • Zero-knowledge proofs of identity
    • Homomorphic encryption
  • Asymmetric Key Management
    • Design Principles
    • Exploitation of private keys
    • Distribution of public keys
    • Public key (digital) certificates
    • Key pair usage
    • Certification Authorities (CA)
    • Certification Hierarchies
    • Refreshing of asymmetric key pairs
    • Certificate revocation lists (CRL)
    • Validity of signatures
    • Distribution of public key certificates
    • Time Stamping Authority (TSA)
    • PKI (Public Key Infrastructure)
  • Digital Signatures
    • Fundamental Approach
    • Signature Schemes
    • Key Elements
    • The document to sign
    • The signature date
    • The identity of the signatory
    • Optional elements of a digital signature
    • Algorithms
    • RSA signatures
    • ASN.1 digest algorithm prefixes
    • Digital Signature Standard (DSS)
    • Blind Signatures
    • Chaum Blind Signatures
    • Qualified electronic signature
      • Signature devices
    • PKCS #11
    • Microsoft Cryptographic API (CAPI)
    • Long-Term Validation (LTV)
    • LTV Advanced Electronic Signatures (AdES)
Powered by GitBook
On this page
  • Message recovery scheme
  • Signing
  • Verification
  • Message appendix scheme
  • Signing
  • Verification
  1. Digital Signatures

Algorithms

Last updated 1 year ago

Message recovery scheme

  • Asymmetric encryption and decryption.

  • Only for RSA.

Signing

Ax(doc)=info+E(Kx−1,doc)A_x(doc) = info + E(K_x^{-1}, doc)Ax​(doc)=info+E(Kx−1​,doc)

Verification

  • infoinfoinfo -> KxK_xKx​

  • D(Kx,Ax(doc))D(K_x,A_x(doc))D(Kx​,Ax​(doc))

  • Check the integrity of docdocdoc.

Message appendix scheme

  • Digest functions.

  • Asymmetric signature and validation.

  • RSA, ElGamal (DSA), EC.

Signing

Verification

Ax(doc)=info+E(Kx−1,h(doc+info))A_x(doc) = info + E(K_x^{-1}, h(doc+info))Ax​(doc)=info+E(Kx−1​,h(doc+info))

Ax(doc)=info+S(Kx−1,h(doc+info))A_x(doc) = info + S(K_x^{-1}, h(doc+info))Ax​(doc)=info+S(Kx−1​,h(doc+info))

infoinfoinfo -> KxK_xKx​

D(Kx,Ax(doc))≡h(doc+info)D(K_x,A_x(doc)) \equiv h(doc + info)D(Kx​,Ax​(doc))≡h(doc+info)

V(Kx,Ax(doc)),h(doc+info)=TrueV(K_x,A_x(doc)), h(doc + info) = TrueV(Kx​,Ax​(doc)),h(doc+info)=True