Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Analys av RSA-kryptosystemet× | SHA-hashfunktion× | |
|---|---|---|
| Ämnesområde | Kryptografi | Kryptografi |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1978 | 1993 |
| Upphovsperson≠ | Ronald Rivest, Adi Shamir, Leonard Adleman | National Institute of Standards and Technology (NIST) |
| Typ≠ | Asymmetric encryption and signature algorithm | One-way hash algorithm |
| Ursprungskälla≠ | 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 ↗ | National Institute of Standards and Technology (1993). Secure Hash Standard (SHS). Federal Information Processing Standards (FIPS) Publication 180. link ↗ |
| Alias≠ | RSA Analysis, Rivest–Shamir–Adleman Analysis | SHA-1, SHA-256, SHA-512, Secure Hash Algorithm |
| Närliggande | 4 | 4 |
| Sammanfattning≠ | RSA (Rivest–Shamir–Adleman) is a foundational asymmetric cryptosystem introduced in 1978 that enables both encryption and digital signatures using a pair of public and private keys. It remains one of the most widely deployed cryptographic algorithms in modern security infrastructure, supporting secure communication and authentication across the internet. | The Secure Hash Algorithm (SHA) is a family of cryptographic hash functions standardized by NIST starting in 1993. SHA functions produce fixed-length digests from arbitrary-length input data, serving as a fundamental building block for digital signatures, message authentication, and data integrity verification across security-critical applications. |
| ScholarGateDatamängd ↗ |
|
|