Linear Cryptanalysis of FF3-1 and FEA

Beyne, Tim

doi:10.1007/978-3-030-84242-0_3

Cited by 6 publications

(6 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The cryptanalysis of standardised FPE algorithms showed that the attacks on the FPE algorithms using differential distinguishers are more complex and require more data for the FF3-1 algorithm compared to the FEA standards [28]. In addition, linear cryptanalysis of the FPE algorithms [29] revealed that attacks on FF3-1 are more time-consuming compared to other algorithms in terms of encryption operations, thereby highlighting its enhanced security. Finally, the FF3-1 algorithm's ability to encrypt binary words ranging from 20 to 192 bits in length made it particularly suitable for encrypting specific protocol fields in our system.…”

Section: Format-preserving Encryptionmentioning

confidence: 99%

“…FPE specifications, although relatively young compared to the well-known block cipher symmetric cryptographic algorithms, have attracted attention from cryptanalysts. These experts have identified potential vulnerabilities in FPE schemes, particularly highlighting a decrease in the complexity of attacks, especially for shorter plaintext lengths and under specific circumstances, such as when the adversary has knowledge of the tweak parameter [29,30]. In the context of LISPP, these issues are effectively mitigated, as the plaintext lengths utilised exceed those susceptible to such vulnerabilities, and the tweak parameter never leaves the network element, ensuring its confidentiality.…”

Section: Format-preserving Encryptionmentioning

confidence: 99%

“…However, such an intervention comes with a potential decrease in algorithm security. Recent cryptanalytic papers showed that the complexity of the attack on FPE [29] depends on the number of Feistel rounds, which means that lowering the number of Feistel rounds will decrease attack complexity, which is not a viable option.…”

Section: Lower Number Of Aes Roundsmentioning

confidence: 99%

See 2 more Smart Citations

Network Layer Privacy Protection Using Format-Preserving Encryption

Mićović,

Radenković,

Vuletić

2023

Electronics

View full text Add to dashboard Cite

Format-Preserving Encryption (FPE) algorithms are symmetric cryptographic algorithms that encrypt an arbitrary-length plaintext into a ciphertext of the same size. Standardisation bodies recognised the first FPE algorithms (FEA-1, FEA-2, FF1 and FF3-1) in the last decade, and they have not been used for network layer privacy protection so far. However, their ability to encrypt arbitrary-length plaintext makes them suitable for encrypting selected packet header fields and replacing their original value with ciphertext of the same size without storing excessive information on the network element. If the encrypted fields carry personally identifiable information, it is possible to protect the privacy of the endpoints in the communication. This paper presents our research on using FPE for network layer privacy protection and describes LISPP, a lightweight, stateless network layer privacy protection system. The system was developed for programmable smart network interface cards (NIC) and thoroughly tested in a real network environment. We have created several implementations ranging from pure P4 to a mix of P4 and C implementations, exploring their performance and the suitability of target-independent P4 language for such processor-intensive applications. Finally, LISPP achieved line rate TCP throughput, up to 4.5 million packets per second, with the penalty of only 30 to 60 microseconds of additional one-way delay, proving that it is adequate for use in production networks. The most efficient implementation was with the FF3-1 algorithm developed in C and carefully adapted to the specific hardware configuration of the NIC.

show abstract

Section: Format-preserving Encryptionmentioning

confidence: 99%

Section: Format-preserving Encryptionmentioning

confidence: 99%

See 1 more Smart Citation

Network Layer Privacy Protection Using Format-Preserving Encryption

Mićović,

Radenković,

Vuletić

2023

Electronics

View full text Add to dashboard Cite

show abstract

“…Theorem 1 (Theorem 4.1. [Bey21]). Let z be a random variable on F d 2 , V ⊆ F d 2 a vector space and V ⊥ an orthogonal complement of the subspace V .…”

Section: Preliminariesmentioning

confidence: 99%

“…To determine the correlation of the iterative trail in Figure 2, we use the following result due to Daemen and Rijmen [DR07]. The formulation in Theorem 2 is due to [Bey21]. Theorem 2 (Theorem 3.1.…”

Section: Generic Multidimensional Linear Distinguishersmentioning

confidence: 99%

Multidimensional Linear Cryptanalysis of Feistel Ciphers

Aşkın Özdemir,

Beyne,

Rijmen

2023

ToSC

View full text Add to dashboard Cite

This paper presents new generic attacks on Feistel ciphers that incorporate the key addition at the input of the non-invertible round function only. This feature leads to a specific vulnerability that can be exploited using multidimensional linear cryptanalysis. More specifically, our approach involves using key-independent linear trails so that the distribution of a combination of the plaintext and ciphertext can be computed. This makes it possible to use the likelihood-ratio test as opposed to the χ2 test. We provide theoretical estimates of the cost of our generic attacks and verify these experimentally by applying the attacks to CAST-128 and LOKI91. The theoretical and experimental findings demonstrate that the proposed attacks lead to significant reductions in data-complexity in several interesting cases.

show abstract

A Geometric Approach to Linear Cryptanalysis

Beyne

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Linear Cryptanalysis of FF3-1 and FEA

Cited by 6 publications

References 23 publications

Network Layer Privacy Protection Using Format-Preserving Encryption

Network Layer Privacy Protection Using Format-Preserving Encryption

Multidimensional Linear Cryptanalysis of Feistel Ciphers

A Geometric Approach to Linear Cryptanalysis

Contact Info

Product

Resources

About