Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Podpis pierścieniowy× | Kryptosystem RSA× | |
|---|---|---|
| Dziedzina | Kryptografia | Kryptografia |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 2001 | 1978 |
| Twórca | Ronald Rivest | Ronald Rivest |
| Typ≠ | signature scheme with anonymity | asymmetric encryption algorithm |
| Źródło pierwotne≠ | Rivest, R. L., Shamir, A., & Tauman, Y. (2001). How to leak a secret. In Advances in Cryptology - ASIACRYPT 2001, LNCS 2248, pp. 552-565. 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 ↗ |
| Inne nazwy | ring signature, group signature | RSA encryption, RSA public-key cryptography |
| Pokrewne≠ | 3 | 4 |
| Podsumowanie≠ | A ring signature is a digital signature scheme allowing a member of a group (ring) to sign a message on behalf of the group without revealing the signer's identity. Proposed by Rivest, Shamir, and Tauman in 2001, ring signatures provide signer anonymity while still proving that the signature comes from one member of a specified set. This cryptographic primitive is widely used in privacy-preserving applications, whistleblowing systems, and anonymous messaging platforms. | 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. |
| ScholarGateZbiór danych ↗ |
|
|