WhyNot?

Ductile disk encryption

Category: Software
Responses: 2 (1 in support, 0 neutral, 1 in opposition)
Number of views: 714
Tracking: Track this idea
Community Rating:Average AverageYour Rating:

There are two primary problems with disk encryption. The first is efficiency. Each data block stored on the disk needs to be encrypted independantly of the others to avoid the cost of decoding many blocks just to read one. The second is an attack by analysing the patterns of stored data. For instance, blocks consisting of the plaintext of just zeros will occur at various places. By analysing the patterns of encrypted data at attacker can guess the contents of some blocks, leading to a known plaintext attack, as well as deducing some of the use of the disk.

In addition, the history of cryptography is one of increasingly good cryptanalytic attacks on algorithms, allowing (for instance) known plaintext attacks which are sufficiently more efficient than brute force that such attacks become practical. It's just a matter of time. I'll assume that known plaintext attacks are feasible but brute force is not.

To protect against this, the encryption key for the partition must be varied using the block number to give a different encryption key for each block; and the relationship between the block key and the partition key must resist an attacker who deduces or guesses the key to a block, so that the partition key is secure.

The idea is to safely generate a block key (B) from the partition key (P) and the block number (N). The attacker, of course, knows N.

Given K<D> is the encryption of data D with key K:

B = (P<N>) < (N<P>) >

If the attacker knows B for some N, then N<K>=B is trivial to solve, and K<N>=B in a feasible known plaintext attack. However, if P is unknown, then N<P> is unknown, so K< N<P> > is not a known plaintext attack. P< N<P> > may be good enough, but just in case it may be reducible to K<N>, I prefer the form above. However, this is just my paranoia; YPMV.

This requires an extra 3 encrypt/decrypt operations per block. If the disk block is 1KB and the cypher block size is 256bits (32bytes) then the normal encrypt/decrypt overhead is 32 encryption operations, so the extra overhead in just undor 10%. That seems reasonable for a fairly ductile solution.

nihil, Jul 22 2005

What do you think of this idea or comment?
(You can change your vote at any time)

agree I agree no opinion No opinion disagree I disagree

Users who liked this idea also liked:

Other ideas in category (Software):

Salty encryption (1 votes) Average
mute a web page (11 votes) Strong
Distributed set with bittorren (1 votes) Average
Text VoIP (1 votes) Average
Economics Simulation (9 votes) Strong
Invention Management Software (3 votes) Average
Attachment Notation (137 votes) Very strong
Fight Recognition Software (3 votes) Average
Make Photo Slideshow yourself (2 votes) Average
Studying leaf patterns (3 votes) Average
Encryption (3 votes) Weak
Searching for images (6 votes) Average
Compiler Security Optimization (4 votes) Average
Vector Datatype (3 votes) Weak
LIP-C (1 votes) Average
Spell checker collector (2 votes) Average
Cascading search (3 votes) Average
Software Formula for 2000 Years (3 votes) Weak
Triangular Pixels (4 votes) Average
Forwarding sent email message (5 votes) Average
Organise the Start menu (6 votes) Average
Simple Shared Key Setup (1 votes) Average
DDR-style piano software (4 votes) Average
root means suid (2 votes) Average
Scorchware (2 votes) Average
Six Degrees of Computation (2 votes) Average
X-drive ==> 2 physical drives (3 votes) Average
Fast parallel secure hashing (1 votes) Average
Standardized EULA (2 votes) Average
Description field for email (3 votes) Average
Honeypot feedback/automation (1 votes) Average
Audio bass and treble (3 votes) Average
Extension that highlights tags (1 votes) Average
Upper-lower case (2 votes) Average
New image file format (2 votes) Average
dual scroll bars (6 votes) Average
Tabbed Working (3 votes) Average
Temporary file highlight (5 votes) Strong
Better Search Engine Links (2 votes) Average
Smarter Programming (5 votes) Strong
Linux Distro for Business (2 votes) Average
File multiple rev eliminator (3 votes) Average
Mech. Design Software (2 votes) Average
Checking email addresses (3 votes) Average
Why Powerpoint? Be nonlinear (6 votes) Strong
Chat with iTunes Listeners (3 votes) Average
Ebay database (2 votes) Average
Encrypts the whole OS (2 votes) Average
Wind offset for car (3 votes) Weak
Collaborative License Rating (4 votes) Average
Multiscopic image modeler (2 votes) Average
Simple fix for posting here (1 votes) Average
Torrent-based podcasting (2 votes) Average
Browser Preloads Next Page (4 votes) Average
Officepets (3 votes) Average
Self Authentication & Decryptn (1 votes) Average
Ductile disk encryption (2 votes) Average
Printing Cost per Page (2 votes) Average
Community Font Classification (1 votes) Average
Ubiquitous virtual honeypots (7 votes) Strong
MS Outlook spouses (1 votes) Average
MS Outlook Contacts updates (1 votes) Average
One card for the wallet (12 votes) Strong
Camera as A4 Scanner (6 votes) Strong
Ogg/PCM (3 votes) Average
Keyboard equivalents (1 votes) Average
OS for visually impaired (4 votes) Average
Window Size Limiter (1 votes) Average
Print Police (1 votes) Average
MS Outlook Highlighter (1 votes) Average
Eye-Tracking Video Drivers (2 votes) Average
Linipedea (3 votes) Weak
MS Word Bookmarks & Summaries (3 votes) Average
anti-virus T-cells (2 votes) Average
savable scroll bars (2 votes) Average
save changes dialog options (3 votes) Average
Viral Marketing in Open Source (7 votes) Weak
Microsoft CD Bug Fixes (4 votes) Average
Virtual Scanner Software (5 votes) Average
Better Shrink Wrapped License (3 votes) Average
Bayesian learning for (4 votes) Average
enclosures (2 votes) Average
Chat Prog & Problem Solving (2 votes) Average
No comments from other members.

Add your comment