Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| HMAC× | RSA-kryptosystem× | |
|---|---|---|
| Ämnesområde | Kryptografi | Kryptografi |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1997 | 1978 |
| Upphovsperson≠ | Hugo Krawczyk | Ronald Rivest |
| Typ≠ | cryptographic authentication mechanism | asymmetric encryption algorithm |
| Ursprungskälla≠ | Krawczyk, H., Bellare, M., & Crechanko, R. (1997). HMAC: Keyed-Hashing for Message Authentication. RFC 2104. link ↗ | 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 ↗ |
| Alias | HMAC, keyed hash function | RSA encryption, RSA public-key cryptography |
| Närliggande≠ | 3 | 4 |
| Sammanfattning≠ | HMAC (Hash-Based Message Authentication Code) is a cryptographic algorithm for authenticating messages using a secret key and a hash function. Standardized in RFC 2104 (1997), HMAC can be combined with any cryptographic hash function (SHA-256, SHA-3, etc.) to create a message authentication code (MAC). HMAC provides both data integrity and authentication, detecting both accidental corruption and deliberate tampering, and is widely used in web security (TLS/SSL), API authentication, and network protocols. | 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. |
| ScholarGateDatamängd ↗ |
|
|