Se ha denunciado esta presentación.
Se está descargando tu SlideShare. ×

Randomized ciphers

Más Contenido Relacionado

Audiolibros relacionados

Gratis con una prueba de 30 días de Scribd

Ver todo

Randomized ciphers

  1. 1. Randomized Ciphers Security in Pure Process Abstraction By Michael Kangethe
  2. 2. Problems with Current Ciphers • Static: – Once Weakness is found(Broken), Cipher and all implemented Cryptosystems become useless – Once process is known one needs to find the Key, – Security is based on: • Key Size • Complexity of Process MEANS CURRENT SOFTWARE/HARDWARE IMPLEMENTATION OF CIPHERS
  3. 3. Proposed Cipher Models • Encryption • Decryption 𝐶 𝐾 = 𝑙𝑖 𝑛 𝑅𝑖 𝑓 𝑃 𝐾 𝑃 = 𝑙𝑖 𝑛 𝑆𝑖 𝑓 𝑃 −1 𝐾 • C : Ciphertext • R : Random Generator • f(P): Cipher Primitive • K : Key • S : Selector at instance I • f(p)-1: Reverse Primitive
  4. 4. Randomized Ciphers Encryption Random Cipher Selector (Counter) S XOR T R SW KEY DATA DATA KEY Trigger
  5. 5. Randomized Ciphers Decryption Cipher Selector (Counter) S XOR T R SW DATA DATA Trigger KEY
  6. 6. Benefits  Inherently Random  Reusable  Abstraction  Users Current Cipher Primitives  Possible to replicate other Ciphers without changing code or hardware

×