Filters








1,047 Hits in 5.4 sec

On the success probabilities of differential attacks on present

SULAK Fatih; ŞEKER
2016 Communications Faculty Of Science University of Ankara  
We give a detailed information of differential cryptanalysis and multiple differential cryptanalysis on Present. Also, the underlying theory of statistical cryptanalysis are presented.  ...  The main aim of this work is to contribute to the theory of statistical cryptanalysis. Therefore, we give a general framework of statistical cryptanalysis and success probabilities.  ...  It is a statistical cryptanalysis method and it uses plaintext-ciphertext pairs with input and output differences such that, for an input difference, a specific output difference is observed with high  ... 
doi:10.1501/commua1-2_0000000090 fatcat:gwmilyuajnfgha6c3hbz6oonya

Quantum Differential Cryptanalysis [article]

Qing Zhou, Songfeng Lu, Zhigang Zhang, Jie Sun
2019 arXiv   pre-print
In this paper, we propose a quantum version of the differential cryptanalysis which offers a quadratic speedup over the existing classical one and show the quantum circuit implementing it.  ...  Any cipher which is vulnerable to the classical differential cryptanalysis based on counting procedures can be cracked more quickly under this quantum differential attack.  ...  It follows that the estimated number of right pairs of incorrect subkeys is close to zero and the quantum differential cryptanalysis is able to find the correct subkey with high probability.  ... 
arXiv:1811.09931v2 fatcat:wnbthoi7tfdphaod76lvroaq44

Quantum differential cryptanalysis

Qing Zhou, Songfeng Lu, Zhigang Zhang, Jie Sun
2015 Quantum Information Processing  
In this paper, we propose a quantum version of the differential cryptanalysis which offers a quadratic speedup over the existing classical one and show the quantum circuit implementing it.  ...  Any cipher which is vulnerable to the classical differential cryptanalysis based on counting procedures can be cracked more quickly under this quantum differential attack.  ...  It follows that the estimated number of right pairs of incorrect subkeys is close to zero and the quantum differential cryptanalysis is able to find the correct subkey with high probability.  ... 
doi:10.1007/s11128-015-0983-3 fatcat:a6uipgzonbf6fln36xrxvvricq

Analysis of DES Double Key Mode [chapter]

G. Cartert, A. Clarkt, E. Dawsont, L. Nielsent
1995 IFIP Advances in Information and Communication Technology  
Initially, we give some background on the development of the cipher, and then proceed to cryptanalyse it using differential cryptanalysis and a combination of linear and differential cryptanalysis.  ...  The remaining twenty were again found by exhaustive search. No more than two hundred plaintext-ciphertext pairs were required. See Table 5 for a summary.  ...  It appears that in all versions, differential cryptanalysis is better than a combination of diffential-linear cryptanalysis both in terms of the number of pairs required and bits found.  ... 
doi:10.1007/978-0-387-34873-5_10 fatcat:bkcz23y75ffqhp64kneth56eam

Differential-algebraic cryptanalysis of reduced-round of Serpent-256

MeiQin Wang, XiaoYun Wang, Lucas C.K. Hui
2010 Science China Information Sciences  
The idea of differential-algebraic cryptanalysis is to find a differential with high probability and build the multivariable system equations for the last few rounds.  ...  We use the differential-algebraic cryptanalysis to break 8-round Serpent-256.  ...  The pair (∆X, ∆Y ) is called a differential. Usually the differential cryptanalysis is a chosen plaintext attack, sometimes it is a chosen ciphertext attack.  ... 
doi:10.1007/s11432-010-0048-2 fatcat:lgw76gubcbavdgyjtbsc4evdna

Algebraic Techniques in Differential Cryptanalysis Revisited [chapter]

Meiqin Wang, Yue Sun, Nicky Mouha, Bart Preneel
2011 Lecture Notes in Computer Science  
For Attack A, they explain that the time complexity is difficult to determine. The goal of Attacks B and C is to filter out wrong pairs and then recover the key.  ...  In this paper, we show that Attack C does not provide an advantage over differential cryptanalysis for typical block ciphers, because it cannot be used to filter out any wrong pairs that satisfy the ciphertext  ...  The authors would like thank the anonymous reviewers for their detailed comments and suggestions.  ... 
doi:10.1007/978-3-642-22497-3_9 fatcat:2zo7odfg6bebrd6lcldffvj3e4

Security analysis of an encryption scheme based on nonpositional polynomial notations

Nursulu Kapalova, Dilmukhanbet Dyusenbayev
2016 Open Engineering  
To evaluate if the algorithms developed on the basis of NPNs are secure, mathematical models of cryptanalysis involving algebraic, linear and differential methods have been designed.  ...  The aim of the research was to conduct a cryptographic analysis of an encryption scheme developed on the basis of nonpositional polynomial notations to estimate the algorithm strength.  ...  Acknowledgement: Works on development, analysis and implementation of domestic means of cryptographic information security for the Republic of Kazakhstan are actual as Kazakhstan is actively integrated  ... 
doi:10.1515/eng-2016-0034 fatcat:pihjif63yne47msa5z2i6g6nvy

Improving Differential-Neural Distinguisher Model For DES, Chaskey, and PRESENT [article]

Liu Zhang, Zilong Wang
2022 arXiv   pre-print
Chen and Yu improved prediction accuracy of differential-neural distinguisher considering derived features from multiple-ciphertext pairs instead of single-ciphertext pairs.  ...  By modifying the kernel size of initial convolutional layer to capture more dimensional information, the prediction accuracy of differential-neural distinguisher can be improved for for three reduced symmetric  ...  The key to classic differential cryptanalysis is to search for a differential distinguisher with a high probability.  ... 
arXiv:2204.06341v1 fatcat:jt2e3qlstjbgbjtpduccijnbmu

The effectiveness of the linear hull effect

Sean Murphy
2012 Journal of Mathematical Cryptology  
There is no linear hull effect in linear cryptanalysis.  ...  Acknowledgements We wish to thank the referees for their helpful comments about the paper.  ...  The number of plaintext-ciphertext pairs required to estimate this key bit to a required accuracy is proportional to −2 γ . This is the procedure given by Algorithm 1 of [9] .  ... 
doi:10.1515/jmc-2011-0025 fatcat:3cvca7c47rax5eepm7b5r3sbwu

From differential cryptanalysis to ciphertext-only attacks [chapter]

Alex Biryukov, Eyal Kushilevitz
1998 Lecture Notes in Computer Science  
We present a method for efficient conversion of differential (chosen plaintext) attacks into the more practical known plaintext and ciphertext-only attacks.  ...  Our observation may save up to a factor of 22~ in data over the known methods, assuming that plaintext is ASCII encoded English (or some other types of highly redundant data).  ...  Acknowledgments We would like to thank the Project Gutenberg [7] , which was our source for printed texts in English and Eli Biham for helpful discussions.  ... 
doi:10.1007/bfb0055721 fatcat:2kp6je6qpnhxnpj3ksbvgsvnqq

A Deeper Look at Machine Learning-Based Cryptanalysis [article]

Adrien Benamira, David Gérault, Thomas Peyrin, Quan Quan Tan
2021 IACR Cryptology ePrint Archive  
We would like to thank Aron Gohr for pointing out that the differential characteristics mentioned in the attacks of Dinur's [6] have been extended by one free round, thus, our previous suggestion of  ...  Acknowledgements The authors are grateful to the anonymous reviewers for their insightful comments that improved the quality of the paper.  ...  For each of the differences δ: (a) Generate 10 4 random 32-bit numbers and apply the difference, δ to get 10 4 different ciphertext pairs.  ... 
dblp:journals/iacr/BenamiraGPT21 fatcat:mdlgaht6l5egjkqv3judd7bnxq

Multiple Differential Cryptanalysis: Theory and Practice [chapter]

Céline Blondeau, Benoît Gérard
2011 Lecture Notes in Computer Science  
Differential cryptanalysis is a well-known statistical attack on block ciphers. We present here a generalisation of this attack called multiple differential cryptanalysis.  ...  Finally, we propose a multiple differential cryptanalysis on 18-round PRESENT for both 80-bit and 128-bit master keys.  ...  Design of the toy cryptanalysis. To empirically estimate the success probability of the attack, we have to experiment this multiple differential attack a large number of times.  ... 
doi:10.1007/978-3-642-21702-9_3 fatcat:dihaqcnz65eefg5lximyyedrtu

A new representation of S-boxes for algebraic differential cryptanalysis

Alena Bednáriková, Pavol Zajac
2021 Rad Hrvatske akademije znanosti i umjetnosti Matematičke znanosti  
If we have access to a large number of P-C pairs, algebraic cryptanalysis can be combined with differential techniques.  ...  Our experiments show that the advantage depends on the overall number of P-C pairs available and whether the chosen differential characteristic is correctly estimated.  ...  If we have a large number of P-C pairs available, we should consider statistical methods to extract the extra information provided by this amount of available data. Differential cryptanalysis.  ... 
doi:10.21857/yvjrdcl0ey fatcat:nr2lce6jlrdezmh552ylhkyr5e

Algebraic Cryptanalysis of Curry and Flurry Using Correlated Messages [chapter]

Jean-Charles Faugère, Ludovic Perret
2010 Lecture Notes in Computer Science  
Roughly, the idea is to generate an algebraic system from the knowledge of several well chosen correlated message/ciphertext pairs.  ...  From extensive experiments, we estimate that our approach -that we will call "algebraic-high order differential" cryptanalysis -is polynomial when the Sbox is a power function.  ...  Algebraic-High Order Differential Style Cryptanalysis The difficulty is to find a suitable way to incorporate the additional knowledge of several message/ciphertext pairs.  ... 
doi:10.1007/978-3-642-16342-5_19 fatcat:5jmvi4ol3zefnnr4jgvjpsw5ai

The design of substitution-permutation networks resistant to differential and linear cryptanalysis

H. M. Heys, S. E. Tavares
1994 Proceedings of the 2nd ACM Conference on Computer and communications security - CCS '94  
In particular, we develop upper bounds on the differential characteristic probability and on the probability of a linear approximation as a function of the number of rounds of substitutions.  ...  We investigate the resistance of these cryptographic networks to two important attacks: differential cryptanalysis and linear cryptanalysis.  ...  Similarly, differential cryptanalysis of a basic SPN can be used to determine the key bits XORed to the output of the last round of S-boxes by using knowledge of the two ciphertext values (and their dilference  ... 
doi:10.1145/191177.191206 dblp:conf/ccs/HeysT94 fatcat:bl247vabkveo3cn6ajj5poci4u
« Previous Showing results 1 — 15 out of 1,047 results