Fast Software Encryption
Ross Anderson
- 01 Jan 1994
56
About: The article was published on 01 Jan 1994. The article focuses on the topics: On-the-fly encryption & Disk encryption.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
BEAST: a fast block cipher for arbitrary blocksizes
Stefan Lucks
- 24 Sep 1997
TL;DR: The BEAST cipher as mentioned in this paper is a new blockcipher for arbitrary size blocks, which is a Luby-Rackoff cipher and fast when the blocks are large, and it is provably secure if these building blocks are secure.
27
Symmetric Key Encryption Based on Rotation-Translation Equation
TL;DR: The goal in this work is to improve an existing encryption algorithm by using a faster convergent iterative method, providing secure convergence of the corresponding numerical scheme, and improved security by a using rotation–translation formula.
25
Computing AES related-key differential characteristics with constraint programming
TL;DR: Improvements in existing Constraint Programming (CP) approaches for computing optimal related-key differential characteristics are improved: new constraints that detect inconsistencies sooner, and a new decomposition of the problem in two steps are introduced.
25
A digital rights management system for digital broadcasting based on home servers
TL;DR: A digital rights management (DRM) system for digital broadcasting based on home servers (DBHS) using receivers with large-capacity storage devices is presented, suitable for broadcasting, and allows both rights protection and advanced access to content held on home storage devices.
23
Further analysis of bent functions from C and D which are provably outside or inside M
TL;DR: It is shown that the set of sufficient conditions given in Zhang et al. (2017) concerning the specification of bent functions in C and D which are provably outside M can be relaxed so that even those permutations whose component functions admit linear structures still can be used in the design.
20
References
Practically Secure Feistel Cyphers
Lars R. Knudsen
- 09 Dec 1993
TL;DR: This paper introduces a new concept, practical security against linear and differential attacks on Feistel ciphers, and gives examples of such Feistels resistant to differential attacks, linear attacks and other attacks.