방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| RSA 암호 시스템 분석× | SHA 해시 함수× | |
|---|---|---|
| 분야 | 암호학 | 암호학 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1978 | 1993 |
| 창시자≠ | Ronald Rivest, Adi Shamir, Leonard Adleman | National Institute of Standards and Technology (NIST) |
| 유형≠ | Asymmetric encryption and signature algorithm | One-way hash algorithm |
| 원전≠ | 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 ↗ |
| 별칭≠ | RSA Analysis, Rivest–Shamir–Adleman Analysis | SHA-1, SHA-256, SHA-512, Secure Hash Algorithm |
| 관련 | 4 | 4 |
| 요약≠ | 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. |
| ScholarGate데이터셋 ↗ |
|
|