Login

Recent searches

No recent searches

Search options

Not available on mastodon.xyz.
mastodon.xyz is one of the many independent Mastodon servers you can use to participate in the fediverse.
A Mastodon instance, open to everyone, but mainly English and French speaking.

Administered by:

Server stats:

812
active users

mastodon.xyz: AboutProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.3.4

#cryptanalysis

0 posts0 participants0 posts today
Public
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
Public
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
Replied in thread
Public *
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
Public
Schneier on Security RSS

New Lattice Cryptanalytic Technique

A new paper presents a polynomial-time quantum algorithm for solving certain hard lattice problems. This could be a big deal for post-quantum cryptographic algorithms, since many of them base their se... schneier.com/blog/archives/202

www.schneier.comNew Lattice Cryptanalytic Technique - Schneier on Security
#quantumcryptography#Uncategorized#cryptanalysis
ExploreLive feeds
About