The hidden volume can have its own separate file system and uses a different password, encryption algorithm and encryption key from that of the host volume, referred to as the "outer" volume. Which volume is actually mounted depends on the password provided; if the password to the outer volume is provided, the outer volume is mounted, and likewise for the inner volume.

more...

A common mistake made by amateur cryptographers is the assumption that because the method is secret, the cipher is secure. Hidden volumes are a steganographic feature that allows a second, "hidden", volume to be created within the free space of another "container" volume.

more...

Hardware designed for a particular purpose can often achieve better performance than software implementations. And disk encryption hardware can be made more transparent to software than encryption done in software. As soon as the key has been initialized, the hardware should in principle be completely transparent to the OS and thus work with any OS.

more...

However, some FDE solutions use multiple keys for encrypting different partitions. If an attacker gains access to the computer at run-time, he has access to all files. Conventional file and folder encryption instead allows different keys for different portions of the disk. Thus an attacker cannot extract information from still-encrypted files and folders.

more...

Hash functions are primarily used in hash tables, to quickly locate a data record (for example, a dictionary definition) given its search key (the headword). Specifically, the hash function is used to map the search key to the hash. The index gives the place where the corresponding record should be stored. Hash tables, in turn, are used to implement associative arrays and dynamic sets.

more...

Hash functions can also be used to locate table records whose key is similar, but not identical, to a given key; or pairs of records in a large file which have similar keys. For that purpose, one needs a hash function that maps similar keys to hash values that differ by at most m, where m is a small integer (say, 1 or 2). If one builds a table of T of all record numbers, using such a hash function, then similar records will end up in the same bucket, or in nearby buckets.

more...

Note that continuity is usually considered a fatal flaw for checksums, cryptographic hash functions, and other related concepts. Continuity is desirable for hash functions only in some applications, such as hash tables that use linear search.

more...

In ordinary applictions, this advantage may be too small to offset their much higher cost. [6] However, this method can provide uniformly distributed hashes even when the keys are chosen by a malicious agent. This feature may help protect services against denial of service attacks.

more...

Ciphertexts produced by classical ciphers (and some modern ones) always reveal statistical information about the plaintext, which can often be used to break them. After the discovery of frequency analysis by the Arab mathematician and polymath, Al-Kindi (also known as Alkindus), in the 9th century, nearly all such ciphers became more or less readily breakable by an informed attacker. Such classical ciphers still enjoy popularity today, though mostly as puzzles (see cryptogram).

more...

Essentially all ciphers remained vulnerable to cryptanalysis using this technique until the development of the polyalphabetic cipher, most clearly by Leon Battista Alberti around the year 1467, though there is some indication that it was known to earlier Arab mathematicians such as Al-Kindi.[6] Alberti's innovation was to use different ciphers (i.e., substitution alphabets) for various parts of a message (perhaps for each successive plaintext letter in the limit).

more...

The Data Encryption Standard (DES) and the Advanced Encryption Standard (AES) are block cipher designs which have been designated cryptography standards by the US government (though DES's designation was finally withdrawn after the AES was adopted).[11] Despite its deprecation as an official standard, DES (especially its still-approved and much more secure triple-DES variant) remains quite popular; it is used across a wide range of applications.

more...

Because of this, breaking a cryptosystem is not restricted to breaking the underlying cryptographic algorithms - usually it is far easier to break the system as a whole, eg, through the not uncommon misconceptions of users in respect to the cryptosystem.

more...

The main focuses of digital cash development are 1) being able to use it through a wider range of hardware such as secured credit cards; and 2) linked bank accounts that would generally be used over an internet means, for exchange with a secure micropayment system such as in large corporations (PayPal).

more...

The transfer of digital currencies raises local issues such as how to levy taxes or the possible ease of money laundering. There are also potential macroeconomic effects such as exchange rate instabilities and shortage of money supplies (total amount of digital cash versus total amount of real cash available, basically the possibility that digital cash could exceed the real cash available). These issues may only be addressable by some type of cyberspace regulations or laws that regulate the transactions and watch for signs of trouble.

more...

Some remailers change both types of address in messages they forward, and the list of forwarding nodes in email messages as well, as the message passes through; in effect, they substitute 'fake source addresses' for the originals.

more...

One disadvantage of symmetric-key algorithms is the requirement of a shared secret key, with one copy at each end. In order to ensure secure communications between everyone in a population of n people a total of n(n − 1)/2 keys are needed, which is the total number of possible communication channels.

more...

DES is now considered to be insecure for many applications. This is chiefly due to the 56-bit key size being too small; in January, 1999, distributed.net and the Electronic Frontier Foundation collaborated to publicly break a DES key in 22 hours and 15 minutes (see chronology).

more...

There are also some analytical results which demonstrate theoretical weaknesses in the cipher, although they are unfeasible to mount in practice. The algorithm is believed to be practically secure in the form of Triple DES, although there are theoretical attacks. In recent years, the cipher has been superseded by the Advanced Encryption Standard (AES).

more...

NSA did not tamper with the design of the algorithm in any way. IBM invented and designed the algorithm, made all pertinent decisions regarding it, and concurred that the agreed upon key size was more than adequate for all commercial applications for which the DES was intended.

more...

There are three attacks known that can break the full sixteen rounds of DES with less complexity than a brute-force search: differential cryptanalysis (DC), linear cryptanalysis (LC), and Davies' attack. However, the attacks are theoretical and are unfeasible to mount in practice; these types of attack are sometimes termed certificational weaknesses.

more...