Methoden vergleichen

	Lineare Kryptoanalyse	RSA-Kryptosystem
Fachgebiet	Kryptographie	Kryptographie
Familie	Machine learning	Machine learning
Entstehungsjahr	1993	1978
Urheber	Mitsuru Matsui	Ronald Rivest
Typ	linear approximation attack	asymmetric encryption algorithm
Wegweisende Quelle	Matsui, M. (1993). Linear cryptanalysis method for DES cipher. In Advances in Cryptology - EUROCRYPT 1993, LNCS 765, pp. 386-397.	Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126.
Aliasnamen	linear attack, linear approximation, piling-up lemma	RSA encryption, RSA public-key cryptography
Verwandt	3	4
Zusammenfassung	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.	RSA is a foundational public-key cryptosystem developed by Rivest, Shamir, and Adleman in 1978. It enables secure encryption and digital signatures by using a pair of mathematically linked keys: a public key for encryption and a private key for decryption. RSA's security relies on the computational difficulty of factoring large composite numbers into their prime factors.