Recent searches

No recent searches

Search options

Only available when logged in.
mastodon.ie is one of the many independent Mastodon servers you can use to participate in the fediverse.
Irish Mastodon - run from Ireland, we welcome all who respect the community rules and members.

Administered by:

Server stats:

1.6K
active users

mastodon.ie: AboutProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.4.1

#cryptanalysis

0 posts0 participants0 posts today
The New Oil

The #NSA’s “Fifty Years of Mathematical #Cryptanalysis (1937–1987)”

schneier.com/blog/archives/202

Schneier on Security · The NSA's "Fifty Years of Mathematical Cryptanalysis (1937–1987)" - Schneier on SecurityIn response to a FOIA request, the NSA released “Fifty Years of Mathematical Cryptanalysis (1937-1987),” by Glenn F. Stahly, with a lot of redactions. Weirdly, this is the second time the NSA has declassified the document. John Young got a copy in 2019. This one has a few less redactions. And nothing that was provided in 2019 was redacted here. If you find anything interesting in the document, please tell us about it in the comments.
#cybersecurity#cryptography
Pyrzout :vm:

The NSA’s “Fifty Years of Mathematical Cryptanalysis (1937–1987)” schneier.com/blog/archives/202 #Uncategorized #cryptanalysis #mathematics #reports #NSA

Schneier on Security · The NSA's "Fifty Years of Mathematical Cryptanalysis (1937–1987)" - Schneier on SecurityIn response to a FOIA request, the NSA released “Fifty Years of Mathematical Cryptanalysis (1937-1987),” by Glenn F. Stahly, with a lot of redactions. Weirdly, this is the second time the NSA has declassified the document. John Young got a copy in 2019. This one has a few less redactions. And nothing that was provided in 2019 was redacted here. If you find anything interesting in the document, please tell us about it in the comments.
Schneier on Security RSS

The NSA’s “Fifty Years of Mathematical Cryptanalysis (1937–1987)”

“Fifty Years of Mathematical Cryptanalysis (1937-1987),” by Glenn F. Stahly, was just declassified—with a lot of redactions—by the NSA.
I... schneier.com/blog/archives/202

Schneier on Security · The NSA's "Fifty Years of Mathematical Cryptanalysis (1937–1987)" - Schneier on SecurityIn response to a FOIA request, the NSA released “Fifty Years of Mathematical Cryptanalysis (1937-1987),” by Glenn F. Stahly, with a lot of redactions. Weirdly, this is the second time the NSA has declassified the document. John Young got a copy in 2019. This one has a few less redactions. And nothing that was provided in 2019 was redacted here. If you find anything interesting in the document, please tell us about it in the comments.
#Uncategorized#cryptanalysis#mathematics
Schneier on Security RSS

Improvements in Brute Force Attacks

New paper: “GPU Assisted Brute Force Cryptanalysis of GPRS, GSM, RFID, and TETRA: Brute Force Cryptanalysis of KASUMI, SPECK, and TEA3.”
... schneier.com/blog/archives/202

Schneier on Security · Improvements in Brute Force Attacks - Schneier on SecurityNew paper: “GPU Assisted Brute Force Cryptanalysis of GPRS, GSM, RFID, and TETRA: Brute Force Cryptanalysis of KASUMI, SPECK, and TEA3.” Abstract: Key lengths in symmetric cryptography are determined with respect to the brute force attacks with current technology. While nowadays at least 128-bit keys are recommended, there are many standards and real-world applications that use shorter keys. In order to estimate the actual threat imposed by using those short keys, precise estimates for attacks are crucial. In this work we provide optimized implementations of several widely used algorithms on GPUs, leading to interesting insights on the cost of brute force attacks on several real-word applications...
#academicpapers#Uncategorized#cryptanalysis
Pyrzout :vm:

Improvements in Brute Force Attacks schneier.com/blog/archives/202 #academicpapers #Uncategorized #cryptanalysis #keys

Schneier on Security · Improvements in Brute Force Attacks - Schneier on SecurityNew paper: “GPU Assisted Brute Force Cryptanalysis of GPRS, GSM, RFID, and TETRA: Brute Force Cryptanalysis of KASUMI, SPECK, and TEA3.” Abstract: Key lengths in symmetric cryptography are determined with respect to the brute force attacks with current technology. While nowadays at least 128-bit keys are recommended, there are many standards and real-world applications that use shorter keys. In order to estimate the actual threat imposed by using those short keys, precise estimates for attacks are crucial. In this work we provide optimized implementations of several widely used algorithms on GPUs, leading to interesting insights on the cost of brute force attacks on several real-word applications...
Schneier on Security RSS

Implementing Cryptography in AI Systems

Interesting research: “How to Securely Implement Cryptography in Deep Neural Networks.”
Abstract: The wide adoption of deep neural networks (DNNs) raises the ques... schneier.com/blog/archives/202

Schneier on Security · Implementing Cryptography in AI Systems - Schneier on SecurityInteresting research: “How to Securely Implement Cryptography in Deep Neural Networks.” Abstract: The wide adoption of deep neural networks (DNNs) raises the question of how can we equip them with a desired cryptographic functionality (e.g, to decrypt an encrypted input, to verify that this input is authorized, or to hide a secure watermark in the output). The problem is that cryptographic primitives are typically designed to run on digital computers that use Boolean gates to map sequences of bits to sequences of bits, whereas DNNs are a special type of analog computer that uses linear mappings and ReLUs to map vectors of real numbers to vectors of real numbers. This discrepancy between the discrete and continuous computational models raises the question of what is the best way to implement standard cryptographic primitives as DNNs, and whether DNN implementations of secure cryptosystems remain secure in the new setting, in which an attacker can ask the DNN to process a message whose “bits” are arbitrary real numbers...
#academicpapers#Uncategorized#cryptanalysis
Pyrzout :vm:

Implementing Cryptography in AI Systems schneier.com/blog/archives/202 #academicpapers #Uncategorized #cryptanalysis #cryptography #AI

Schneier on Security · Implementing Cryptography in AI Systems - Schneier on SecurityInteresting research: “How to Securely Implement Cryptography in Deep Neural Networks.” Abstract: The wide adoption of deep neural networks (DNNs) raises the question of how can we equip them with a desired cryptographic functionality (e.g, to decrypt an encrypted input, to verify that this input is authorized, or to hide a secure watermark in the output). The problem is that cryptographic primitives are typically designed to run on digital computers that use Boolean gates to map sequences of bits to sequences of bits, whereas DNNs are a special type of analog computer that uses linear mappings and ReLUs to map vectors of real numbers to vectors of real numbers. This discrepancy between the discrete and continuous computational models raises the question of what is the best way to implement standard cryptographic primitives as DNNs, and whether DNN implementations of secure cryptosystems remain secure in the new setting, in which an attacker can ask the DNN to process a message whose “bits” are arbitrary real numbers...
*
OCTADE
'period'
'cipher period'
'periodic range'
'periodic limit'
'periodicity'

This is not to be confused with 'cryptoperiod' or 'key period' or 'key time domain' which refers to the time a key is valid.

The 'period' refers to the length of the cipher stream or generator stream before it repeats from the initial keying or initialization state. Some ciphers may be considered unsafe before reaching this generator period for other reasons, such as mode mixing.

For example we might say the generator period is 2^155337 which means after generating that much data the stream would cycle back to its initial values. If the amount of data fed into the cipher stream exceeds the period then security is compromised (theoretically, in practice it might be unnoticed by an attacker).

Last I checked AES has a period of something like 2^39 - 256 for the same key. Your key schedule should be automatically handling that anyway to a much smaller limit.

The cipher period limitation may be referred to as:

'maximum safe ciphertext length' or 'maximum safe message size'

#cryptography #cipher #cryptanalysis #cryptology #crypto #math #encryption
TrendingLive feeds
About