পদ্ধতির তুলনা করুন

	রৈখিক ক্রিপ্ট্যানালাইসিস	ডিফারেনশিয়াল ক্রিপ্ট্যানালাইসিস
ক্ষেত্র	ক্রিপ্টোগ্রাফি	ক্রিপ্টোগ্রাফি
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1993	1990
প্রবর্তক	Mitsuru Matsui	Eli Biham
ধরন	linear approximation attack	statistical attack on block ciphers
মৌলিক উৎস	Matsui, M. (1993). Linear cryptanalysis method for DES cipher. In Advances in Cryptology - EUROCRYPT 1993, LNCS 765, pp. 386-397.	Biham, E., & Shamir, A. (1990). Differential cryptanalysis of DES-like cryptosystems. In Advances in Cryptology - CRYPTO 1990, LNCS 537, pp. 2-21.
অপর নাম	linear attack, linear approximation, piling-up lemma	differential attack, differential path, differential probability
সম্পর্কিত	3	3
সারসংক্ষেপ	Linear cryptanalysis is a known-plaintext attack that exploits linear approximations of a cipher's non-linear transformations to recover secret key bits. Introduced by Mitsuru Matsui in 1993, linear cryptanalysis provides practical attacks on ciphers like DES with computational complexity less than brute force. The technique analyzes statistical biases in how linear combinations of plaintext and ciphertext bits relate to key bits, enabling key recovery with reduced data requirements.	Differential cryptanalysis is a statistical attack technique on symmetric block ciphers that analyzes differences in inputs and outputs to recover secret keys. Introduced by Eli Biham and Adi Shamir in 1990, differential cryptanalysis was the first practical attack on DES that outperformed brute force search. The technique exploits non-random properties of cipher transformations by studying how small changes in plaintext propagate through the cipher rounds. Differential cryptanalysis has shaped cipher design for three decades.