Jean-Philippe Aumasson
Goodreads Author
Born
in Paris, France
Website
Twitter
Genre
Influences
Member Since
April 2024
More books by Jean-Philippe Aumasson…
Jean-Philippe’s Recent Updates
|
Jean-Philippe Aumasson
rated a book it was amazing
Serious Cryptography: A Practical Introduction to Modern Encryption
by Jean-Philippe Aumasson (Goodreads Author) |
|
|
Jean-Philippe Aumasson
rated a book it was amazing
|
|
|
Jean-Philippe Aumasson
rated a book it was amazing
|
|
|
Jean-Philippe Aumasson
rated a book it was amazing
Crypto Dictionary: 500 Tasty Tidbits for the Curious Cryptographer
by Jean-Philippe Aumasson (Goodreads Author) |
|
|
Jean-Philippe Aumasson
rated a book it was amazing
The Hash Function BLAKE (Information Security and Cryptography)
by Jean-Philippe Aumasson (Goodreads Author) |
|
|
Jean-Philippe Aumasson
rated a book it was amazing
|
|
|
Jean-Philippe Aumasson
rated a book it was amazing
|
|
|
Jean-Philippe Aumasson
rated a book it was amazing
|
|
|
Jean-Philippe Aumasson
rated a book it was amazing
|
|
|
Jean-Philippe Aumasson
rated a book it was amazing
The Hash Function BLAKE (Information Security and Cryptography)
by Jean-Philippe Aumasson (Goodreads Author) |
|
“The most common failure seen with stream ciphers is an amateur mistake: it occurs when a nonce is reused more than once with the same key. This produces identical keystreams, allowing you to break the encryption by XORing two ciphertexts together. The keystream then vanishes, and you’re left with the XOR of the two plaintexts.
For example, older versions of Microsoft Word and Excel used a unique nonce for each document, but the nonce wasn’t changed once the document was modified. As a result, the clear and encrypted text of an older version of a document could be used to decrypt later encrypted versions.”
― Serious Cryptography: A Practical Introduction to Modern Encryption
For example, older versions of Microsoft Word and Excel used a unique nonce for each document, but the nonce wasn’t changed once the document was modified. As a result, the clear and encrypted text of an older version of a document could be used to decrypt later encrypted versions.”
― Serious Cryptography: A Practical Introduction to Modern Encryption
“Each operation contributes to AES’s security in a specific way:
* Without KeyExpansion, all rounds would use the same key, K, and AES would be vulnerable to slide attacks.
* Without AddRoundKey, encryption wouldn’t depend on the key; hence, anyone could decrypt any ciphertext without the key.
* SubBytes brings nonlinear operations, which add cryptographic strength. Without it, AES would just be a large system of linear equations that is solvable using high-school algebra.
* Without ShiftRows, changes in a given column would never affect the other columns, meaning you could break AES by building four 232 element codebooks for each column. (Remember that in a secure block cipher, flipping a bit in the input should affect all the output bits.)
* Without MixColumns, changes in a byte would not affect any other bytes of the state. A chosen-plaintext attacker could then decrypt any ciphertext after storing 16 lookup tables of 256 bytes each that hold the encrypted values of each possible value of a byte.”
― Serious Cryptography: A Practical Introduction to Modern Encryption
* Without KeyExpansion, all rounds would use the same key, K, and AES would be vulnerable to slide attacks.
* Without AddRoundKey, encryption wouldn’t depend on the key; hence, anyone could decrypt any ciphertext without the key.
* SubBytes brings nonlinear operations, which add cryptographic strength. Without it, AES would just be a large system of linear equations that is solvable using high-school algebra.
* Without ShiftRows, changes in a given column would never affect the other columns, meaning you could break AES by building four 232 element codebooks for each column. (Remember that in a secure block cipher, flipping a bit in the input should affect all the output bits.)
* Without MixColumns, changes in a byte would not affect any other bytes of the state. A chosen-plaintext attacker could then decrypt any ciphertext after storing 16 lookup tables of 256 bytes each that hold the encrypted values of each possible value of a byte.”
― Serious Cryptography: A Practical Introduction to Modern Encryption
“Although quantum computers can in principle be built, we don’t know how hard it will be or when that might happen, if at all. And so far, it looks really hard. As of early 2017, the record holder is a machine that is able to keep 14 (fourteen!) qubits stable for only a few milliseconds, whereas we’d need to keep millions of qubits stable for weeks in order to break any crypto.”
― Serious Cryptography: A Practical Introduction to Modern Encryption
― Serious Cryptography: A Practical Introduction to Modern Encryption
Topics Mentioning This Author
| topics | posts | views | last activity | |
|---|---|---|---|---|
EVERYONE Has Read...:
2024 EHRTBM House Cup Challenge - Ruby House
|
490 | 357 | Jan 06, 2025 02:48AM | |
| Crazy Challenge C...: Countries of the World #5 - Turkmenistan | 59 | 49 | Jan 22, 2025 10:23AM | |
| Turn of a Page: Richard's Holiday Screening Room (COMPLETE!) | 89 | 30 | Jan 23, 2025 06:12PM | |
| A Million More Pages: 2024 Holiday Feast | 45 | 56 | Feb 15, 2025 08:04PM | |
| LOTSA SPELL CHALL...: December 2024: Celebrating 200 Years of RSPCA / CHRISTMAS | 53 | 16 | Feb 17, 2025 02:44AM | |
| Hooked on Books : Richard's 2024 Challenge Tracker | 361 | 147 | Jun 12, 2025 08:45AM |























