Usanifu wa Kielektroniki wa Curve (ECC)
Usanifu wa Kielektroniki wa Curve (ECC) ni mfumo wa usimbaji fiche wa funguo za umma unaotegemea muundo wa kielektroniki wa curves juu ya uga finyu. Uliopendekezwa kwa kujitegemea na Neal Koblitz na Victor Miller mwaka 1985, ECC inatoa usalama sawa na RSA kwa ukubwa mdogo zaidi wa funguo. Usanifu fiche wa kisasa unazidi kupendelea ECC kwa ufanisi wake: funguo ya ECC ya bit 256 inatoa usalama unaolinganishwa na funguo ya RSA ya bit 2048, ikifanya iwe bora kwa mazingira yenye vikwazo na mifumo yenye utendaji wa juu.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Miller, V. S. (1985). Use of Elliptic Curves in Cryptography. In Proceedings of the Advances in Cryptology - CRYPTO 1985, LNCS 218, pp. 417-426. DOI: 10.1007/3-540-39799-X_31 ↗
- Koblitz, N. (1987). Elliptic Curve Cryptosystems. Mathematics of Computation, 48(177), 203-209. DOI: 10.1090/S0025-5718-1987-0866109-5 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Elliptic Curve Cryptography (ECC). ScholarGate. https://scholargate.app/sw/cryptography/elliptic-curve-cryptography
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Uhalifu wa msingi wa latisiKriptografia↔ compare
- Kificho-baada-ya-kwanta (Kyber)Kriptografia↔ compare
- Mfumo wa Usimbaji fiche wa RSAKriptografia↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →