ScholarGate
Assistent

Sammenlign metoder

Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.

AES (Rijndael)×Lineær kryptanalyse×RSA-krypteringssystemet×
FagområdeKryptografiKryptografiKryptografi
FamilieMachine learningMachine learningMachine learning
Oprindelsesår200119931978
OphavspersonJoan DaemenMitsuru MatsuiRonald Rivest
Typesymmetric encryption algorithmlinear approximation attackasymmetric encryption algorithm
Oprindelig kildeDaemen, J., & Rijmen, V. (2002). The Design of Rijndael: AES - The Advanced Encryption Standard. Springer-Verlag. ISBN: 978-3540425809Matsui, M. (1993). Linear cryptanalysis method for DES cipher. In Advances in Cryptology - EUROCRYPT 1993, LNCS 765, pp. 386-397. DOI ↗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. DOI ↗
AliasserRijndael, AES encryption, FIPS 197linear attack, linear approximation, piling-up lemmaRSA encryption, RSA public-key cryptography
Relaterede434
ResuméThe Advanced Encryption Standard (AES), also known as Rijndael, is a symmetric block cipher adopted as the official encryption standard by the U.S. government in 2001. It processes data in 128-bit blocks using 128, 192, or 256-bit keys and performs multiple rounds of substitution, permutation, and mixing operations. AES is the most widely used symmetric encryption algorithm today, securing everything from government communications to everyday internet traffic.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.
ScholarGateDatasæt
  1. v1
  2. 2 Kilder
  3. PUBLISHED
  1. v1
  2. 2 Kilder
  3. PUBLISHED
  1. v1
  2. 2 Kilder
  3. PUBLISHED

Gå til søgning Hent slides

ScholarGateSammenlign metoder: AES (Rijndael) · Linear Cryptanalysis · RSA Cryptosystem. Hentet 2026-06-17 fra https://scholargate.app/da/compare