In the event the hidden volume user is forced to reveal their password, he can divulge the password to the outer volume (not disclosing the fact that he actually has a hidden volume within), and sensitive data within the hidden volume are not compromised; provided certain additional precautions are taken in overwriting the free areas of the "host" disk.

more...

This is particularly important for sensitive data like credit card numbers. The purpose of encryption is to prevent third parties from recovering the original information. Once a hidden volume has been created inside another volume, the user will store important-looking information (but which the user does not actually mind revealing) on the outer volume, whereas sensitive information is stored within the hidden volume.

more...

Secure and safe recovery mechanisms are essential to the large-scale deployment of any FDE solutions in an enterprise. The solution must provide an easy but secure way to recover passwords (most importantly data) in case the user leaves the company without notice or forgets the password.

more...

An Emergency Recovery Information (ERI) file provides an alternative for recovery if a challenge response mechanism is unfeasible due to the cost of helpdesk operatives for small companies or implementation challenges.

more...

Most full disk encryption schemes are vulnerable to a cold boot attack, whereby encryption keys can be stolen by cold-booting a machine already running an operating system, then dumping the contents of memory before the data disappears. The attack relies on the data remanence property of computer memory, whereby data bits can take up to several minutes to degrade after power has been removed.

more...

In general, a hashing function may map several different keys to the same index. Therefore, each slot of a hash table is associated with (implicitly or explicitly) a set of records, rather than a single record. For this reason, each slot of a hash table is often called a bucket, and hash values are also called bucket indices.

more...

The meaning of 'small enough' depends on how much memory is available for the hash table. A typical PC (as of 2008) might have a gigabyte of available memory, meaning that hash values of up to 30 bits could be accommodated. However, there are many applications that can get by with much less.

more...

A perfect function for a given set of n keys, suitable for use in a hash table, can be found in time proportional to n, can be represented in less than 3*n bits, and can be evaluated in a constant number of operations. There are generators that will emit optimized executable code to evaluate a perfect hash for a given input set.

more...

In computer science, geometric hashing is a method for efficiently finding two-dimensional objects represented by discrete points that have undergone an affine transformation. (Extensions exist to some other object representations and transformations.)

more...

In cryptography, a password-authenticated key agreement method is an interactive method for two or more parties to establish cryptographic keys based on one or more party's knowledge of a password. Password-authenticated key agreement.

more...

The potential effects of quantum computing are already being considered by some cryptographic system designers; the announced imminence of small implementations of these machines may be making the need for this preemptive caution less than merely speculative.

more...

The modern study of symmetric-key ciphers relates mainly to the study of block ciphers and stream ciphers and to their applications. A block cipher is, in a sense, a modern embodiment of Alberti's polyalphabetic cipher: block ciphers take as input a block of plaintext and a key, and output a block of ciphertext of the same size.

more...

The number of keys required increases as the square of the number of network members, which very quickly requires complex key management schemes to keep them all straight and secret. The difficulty of securely establishing a secret key between two communicating parties, when a secure channel doesn't already exist between them, also presents a chicken-and-egg problem which is a considerable practical obstacle for cryptography users in the real world.

more...

Typically, this involves use of computer networks, the internet and digital stored value systems. Electronic Funds Transfer (EFT) and direct deposit are examples of electronic money. Also, it is a collective term for financial cryptography and technologies enabling it.

more...

In the case of Octopus Card in Hong Kong, deposits work similarly to banks'. After Octopus Card Limited receives money for deposit from users, the money is deposited into banks, which is similar to debit-card-issuing banks redepositing money at central banks.

more...

Events such as the GURPS Cyberpunk raid lent weight to the idea that private individuals needed to take steps themselves to protect their privacy. In its heyday, the list discussed the public policy issues related to cryptography, as well as more practical nuts-and-bolts mathematical, computational, technological, and cryptographic matters themselves.

more...

The term cypherpunk, derived from cipher and punk, was coined by Jude Milhon as a pun to describe cyberpunks who used cryptography. [1] In November 2006, the word was proposed for inclusion in the Oxford English Dictionary[2]. The Cypherpunks included several notable computer industry figures

more...

A cipher (or cypher) is a pair of algorithms which create the encryption and the reversing decryption. The detailed operation of a cipher is controlled both by the algorithm and in each instance by a key. This is a secret parameter (ideally known only to the communicants) for a specific message exchange context.

more...

At the time Blowfish was released, many other designs were proprietary, encumbered by patents or were commercial/government secrets. Schneier has stated that, "Blowfish is unpatented, and will remain so in all countries. The algorithm is hereby placed in the public domain, and can be freely used by anyone."

more...

It's likely that advances in CPU architecture (out of order execution becoming mainstream) speed up AES more than Blowfish. For example, Intel's in-order Atom CPU runs Blowfish twice as fast as AES-128.[6] There may be room for more optimization of Blowfish, but the Rijndael has received more attention since it was chosen for AES.

more...