How to Protect DES Against Exhaustive Key Search
type: Item
instance of: scholarly article
title: How to Protect DES Against Exhaustive Key Search
zbMATH Open document ID: 1329.94067
DOI: 10.1007/3-540-68697-5_20
author: Joe Kilian
author: Phillip Rogaway
published in: Advances in Cryptology — CRYPTO ’96
publication date: 2015-11-11T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6507383
MaRDI profile type: Publication
full work available at URL: 3-540-68697-5 20
OpenAlex ID: W1801417685
Recommended article: How to protect DES against exhaustive key search (an analysis of DESX).
Recommended article: Q4536813
Recommended article: Public key encryption with keyword search secure against keyword guessing attacks without random oracle
Recommended article: Q5698932
Recommended article: An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks
Recommended article: Search for Related-Key Differential Characteristics in DES-Like Ciphers
Recommended article: Protecting against key-exposure: strongly key-insulated encryption with optimal threshold
Recommended article: On the Security of 2-Key Triple DES
Recommended article: Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited
Recommended article: Protecting Triple-DES Against DPA
description: scientific article