How does file encryption?

By default, encryption service, available with Windows XP, run automatically when you boot the operating system, so no additional inclusion is required. But in order to encrypt a particular file or folder, you must do the following: right click on the file / folder, choose Properties from the menu and click the pop-up window (tab General) Advanced button. After opening a new tab, note where the item “Encrypt contents to secure data”. Custom kitchens in Toronto. A small note: encrypt allowed only those files and folders that reside on drives formatted with the NTFS file system; it must be remembered that only encrypted uncompressed data (if encrypt a compressed file or folder, they will be decompressed); not allowed to encrypt files that are marked as System, as well as possible and encrypt the system directory (by default, this folder is c: / windows). And again, do not be surprised that looks after encrypt a file or folder, nothing will change – the owner of the encrypted data can treat them the same way as with unencrypted, but for everyone else who logs in under a different login, encrypted data will be inaccessible …

Device Encryption in Windows 8.1 and BitLocker Drive Encryption

Device Encryption is a new consumer-oriented security feature of Windows 8.1 that automatically encrypts the Operating System (OS) drive and all fixed data drives. Rather than requiring the user or administrator to enable and configure the encryption, the platform’s drives are encrypted out-of-the-box. The encryption is invisible during normal use: users can log in and use the system just as they would use an unencrypted system. If someone stole the system however he wouldn’t be able to get at any of the data without knowing the user account’s password. This is because the device encryption key is protected by a secret derived from the user account’s password. You can check the Device Encryption status of your Windows 8.1 system at the bottom of the “PC Info” section in the device settings.

Device Encryption is available in every Windows 8.1 edition – not just the enterprise editions, but also the consumer ones – and can be used on both x86 and x-64 platforms. To support Device Encryption, your Windows 8.1 platform must have a version 2.0 (v2.0) Trusted Platform Module – as specified in the Windows Hardware Certification Kit (HCK) requirements for TPM and SecureBoot on ConnectedStandby systems Your system must also support connected standby – a new power state that with very low power consumption that also maintains Internet connectivity.

Under the hood Device Encryption uses BitLocker and 128-bit AES symmetric encryption.

What is Bruce Schneier Algorithm?

The Schneier method is a software based data sanitization method used in some file shredder and data destruction programs to overwrite existing information on a hard drive or other storage device.

The Schneier data sanitization method is often implemented in the following way:

Pass 1: Writes a one
Pass 2: Writes a zero
Pass 3: Writes a stream of random characters
Pass 4: Writes a stream of random characters
Pass 5: Writes a stream of random characters
Pass 6: Writes a stream of random characters
Pass 7: Writes a stream of random characters
Erasing a hard drive using the Schneier data sanitization method will prevent all software based file recovery methods from finding information on the drive and is also likely to prevent most hardware based recovery methods from extracting information.

The Schneier method was created by Bruce Schneier and appeared in his book Applied Cryptography: Protocols, Algorithms, and Source Code in C (ISBN 978-0471128458).

Most data destruction programs support multiple data sanitization methods in addition to the Schneier method.

AES Performance

High speed and low RAM requirements were criteria of the AES selection process. Thus AES performs well on a wide variety of hardware, from 8-bit smart cards to high-performance computers.

On a Pentium Pro, AES encryption requires 18 clock cycles per byte, equivalent to a throughput of about 11 MB/s for a 200 MHz processor. On a 1.7 GHz Pentium M throughput is about 60 MB/s.

On Intel Core i3/i5/i7 and AMD APU and FX CPUs supporting AES-NI instruction set extensions, throughput can be over 700 MB/s per thread.

AES algorithm description

The Advanced Encryption Standard (AES), also known as Rijndael (its original name), is a specification for the encryption of electronic data established by the U.S. National Institute of Standards and Technology (NIST) in 2001.

AES is based on the Rijndael cipher developed by two Belgian cryptographers, Joan Daemen and Vincent Rijmen, who submitted a proposal to NIST during the AES selection process. Rijndael is a family of ciphers with different key and block sizes.

For AES, NIST selected three members of the Rijndael family, each with a block size of 128 bits, but three different key lengths: 128, 192 and 256 bits.

AES has been adopted by the U.S. government and is now used worldwide. It supersedes the Data Encryption Standard (DES), which was published in 1977. The algorithm described by AES is a symmetric-key algorithm, meaning the same key is used for both encrypting and decrypting the data.

In the United States, AES was announced by the NIST as U.S. FIPS PUB 197 (FIPS 197) on November 26, 2001. This announcement followed a five-year standardization process in which fifteen competing designs were presented and evaluated, before the Rijndael cipher was selected as the most suitable (see Advanced Encryption Standard process for more details).

AES became effective as a federal government standard on May 26, 2002 after approval by the Secretary of Commerce. AES is included in the ISO/IEC 18033-3 standard. AES is available in many different encryption packages, and is the first publicly accessible and open[vague] cipher approved by the National Security Agency (NSA) for top secret information when used in an NSA approved cryptographic module (see Security of AES, below).

The name Rijndael (Dutch pronunciation: [ˈrɛindaːl]) is a play on the names of the two inventors (Joan Daemen and Vincent Rijmen).

Until May 2009, the only successful published attacks against the full AES were side-channel attacks on some specific implementations. The National Security Agency (NSA) reviewed all the AES finalists, including Rijndael, and stated that all of them were secure enough for U.S. Government non-classified data. In June 2003, the U.S. Government announced that AES could be used to protect classified information:

The design and strength of all key lengths of the AES algorithm (i.e., 128, 192 and 256) are sufficient to protect classified information up to the SECRET level. TOP SECRET information will require use of either the 192 or 256 key lengths. The implementation of AES in products intended to protect national security systems and/or information must be reviewed and certified by NSA prior to their acquisition and use.

AES has 10 rounds for 128-bit keys, 12 rounds for 192-bit keys, and 14 rounds for 256-bit keys. By 2006, the best known attacks were on 7 rounds for 128-bit keys, 8 rounds for 192-bit keys, and 9 rounds for 256-bit keys.

Known attacks
For cryptographers, a cryptographic “break” is anything faster than a brute force—performing one trial decryption for each key (see Cryptanalysis). This includes results that are infeasible with current technology. The largest successful publicly known brute force attack against any block-cipher encryption was against a 64-bit RC5 key by distributed.net in 2006.[15]

AES has a fairly simple algebraic description.[16] In 2002, a theoretical attack, termed the “XSL attack”, was announced by Nicolas Courtois and Josef Pieprzyk, purporting to show a weakness in the AES algorithm due to its simple description. Since then, other papers have shown that the attack as originally presented is unworkable; see XSL attack on block ciphers.

During the AES process, developers of competing algorithms wrote of Rijndael, “…we are concerned about [its] use…in security-critical applications.”[18] However, in October 2000 at the end of the AES selection process, Bruce Schneier, a developer of the competing algorithm Twofish, wrote that while he thought successful academic attacks on Rijndael would be developed someday, he does not “believe that anyone will ever discover an attack that will allow someone to read Rijndael traffic.”

On July 1, 2009, Bruce Schneier blogged about a related-key attack on the 192-bit and 256-bit versions of AES, discovered by Alex Biryukov and Dmitry Khovratovich, which exploits AES’s somewhat simple key schedule and has a complexity of 2119. In December 2009 it was improved to 299.5. This is a follow-up to an attack discovered earlier in 2009 by Alex Biryukov, Dmitry Khovratovich, and Ivica Nikolić, with a complexity of 296 for one out of every 235 keys. However, related-key attacks are not of concern in any properly designed cryptographic protocol, as properly designed software will not use related-keys.

Another attack was blogged by Bruce Schneier on July 30, 2009 and released as a preprint[24] on August 3, 2009. This new attack, by Alex Biryukov, Orr Dunkelman, Nathan Keller, Dmitry Khovratovich, and Adi Shamir, is against AES-256 that uses only two related keys and 239 time to recover the complete 256-bit key of a 9-round version, or 245 time for a 10-round version with a stronger type of related subkey attack, or 270 time for an 11-round version. 256-bit AES uses 14 rounds, so these attacks aren’t effective against full AES.

In November 2009, the first known-key distinguishing attack against a reduced 8-round version of AES-128 was released as a preprint. This known-key distinguishing attack is an improvement of the rebound or the start-from-the-middle attacks for AES-like permutations, which view two consecutive rounds of permutation as the application of a so-called Super-Sbox. It works on the 8-round version of AES-128, with a time complexity of 248, and a memory complexity of 232. 128-bit AES uses 10 rounds, so this attack isn’t effective against full AES-128.

In July 2010 Vincent Rijmen published an ironic paper on “chosen-key-relations-in-the-middle” attacks on AES-128.

The first key-recovery attacks on full AES were due to Andrey Bogdanov, Dmitry Khovratovich, and Christian Rechberger, and were published in 2011. The attack is a biclique attack and is faster than brute force by a factor of about four. It requires 2126.2 operations to recover an AES-128 key. For AES-192 and AES-256, 2190.2 and 2254.6 operations are needed, respectively. This result has been further improved to 2126.0 for AES-128, 2189.9 for AES-192 and 2254.3 for AES-256, which are the current best results in key recovery attack against AES.

This is a very small gain, as a 126-bit key (instead of 128-bits) would still take billions of years to brute force on current and foreseeable hardware. Also, the authors calculate the best attack using their technique on AES with a 128 bit key requires storing 288 bits of data (which later has been improved to 256 ). That works out to about 38 trillion terabytes of data, which is more than all the data stored on all the computers on the planet. As such this is a theoretical attack that has no practical implication on AES security.

According to the Snowden documents, the NSA is doing research on whether a cryptographic attack based on tau statistic may help to break AES.

As for now, there are no known practical attacks that would allow anyone to read correctly implemented AES encrypted data.

What is Windows Crypto API?

The Cryptographic Application Programming Interface (also known variously as CryptoAPIMicrosoft Cryptography APIMS-CAPI or simply CAPI) is an application programming interface included with Microsoft Windows operating systems that provides services to enable developers to secure Windows-based applications usingcryptography. It is a set of dynamically linked libraries that provides an abstraction layer which isolates programmers from the code used to encrypt the data. The Crypto API was first introduced in Windows NT 4.0 and enhanced in subsequent versions.

CryptoAPI supports both public-key and symmetric key cryptography, though persistent symmetric keys are not supported. It includes functionality for encrypting and decrypting data and for authentication using digital certificates. It also includes a cryptographically secure pseudorandom number generator function CryptGenRandom.

CryptoAPI works with a number of CSPs (Cryptographic Service Providers) installed on the machine. CSPs are the modules that do the actual work of encoding and decoding data by performing the cryptographic functions. Vendors of HSMs may supply a CSP which works with their hardware.

Time and energy required to brute-force a AES-256 encryption key

Possible number of key combinations with respect to key size:

Time to crack Cryptographic Key versus Key size

As shown above, even with a supercomputer, it would take 1 billion billion years to crack the 128-bit AES key using brute force attack. This is more than the age of the universe (13.75 billion years). If one were to assume that a computing system existed that could recover a DES key in a second, it would still take that same machine approximately 149 trillion years to crack a 128-bit AES key.

There are more interesting examples. The following snippet is a snapshot of one the technical papers from Seagate titled “128-bit versus 256-bit AES encryption” to explain why 128-bit AES is sufficient to meet future needs.

  • Every person on the planet owns 10 computers.
  • There are 7 billion people on the planet.
  • Each of these computers can test 1 billion key combinations per second.
  • On average, you can crack the key after testing 50% of the possibilities.

Then the earth’s population can crack one encryption key in 77,000,000,000,000,000,000,000,000 years!

The bottom line is that if AES could be compromised, the world would come to a standstill. The difference between cracking the AES-128 algorithm and AES-256 algorithm is considered minimal. Whatever breakthrough might crack 128-bit will probably also crack 256-bit.

What is the best encryption algorithm

It is AES with key 256 bit.

AES is a standard of using the Rijndael cipher, and is the most widely-accepted encryption algorithm. It is not necessarily the most secure mathematically. The only known attacks on it right now are side-channel attacks, but that’s the fault of the implementation or platform you are encrypting on.

The Rijndael cipher was chosen because it seems to be the most performant algorithm in a variety of different systems of all bit sizes tested, and it is also extraordinarily secure. If you have control over your systems, replacing government-standard DES encryption with AES will be a great step.

Other highly-secure ciphers are Twofish, Serpent and RC6.

The following ciphers are outdated and either deprecated in favor of a newer cipher, or are a travesty of computer science: DES, Triple DES, Blowfish, and MARS.

The Advanced Encryption Standard (AES) is the algorithm trusted as the standard by the U.S. Government and numerous organizations.
Although it is extremely efficient in 128-bit form, AES also uses keys of 192 and 256 bits for heavy duty encryption purposes.
AES is largely considered impervious to all attacks, with the exception of brute force, which attempts to decipher messages using all possible combinations in the 128, 192, or 256-bit cipher. Still, security experts believe that AES will eventually be hailed the de facto standard for encrypting data in the private sector.