পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| ল্যাটিস-ভিত্তিক ক্রিপ্টোগ্রাফি× | এলিপটিক কার্ভ ক্রিপ্টোগ্রাফি× | |
|---|---|---|
| ক্ষেত্র | ক্রিপ্টোগ্রাফি | ক্রিপ্টোগ্রাফি |
| পরিবার | Machine learning | Machine learning |
| উদ্ভবের বছর≠ | 1996 | 1985 |
| প্রবর্তক≠ | Miklós Ajtai | Neal Koblitz |
| ধরন≠ | public-key cryptosystem based on lattice hardness | asymmetric encryption and key agreement |
| মৌলিক উৎস≠ | Ajtai, M. (1996). Generating hard instances of the short basis problem. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 99-108. link ↗ | 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 ↗ |
| অপর নাম | lattice cryptography, post-quantum lattice cryptography | ECC, elliptic curve cryptosystem |
| সম্পর্কিত | 3 | 3 |
| সারসংক্ষেপ≠ | Lattice-based cryptography is a class of cryptosystems whose security is derived from the computational hardness of lattice problems, particularly the shortest vector problem (SVP) and learning with errors (LWE). First proposed by Miklós Ajtai in 1996, lattice-based approaches have gained prominence as the leading candidates for post-quantum cryptography. Unlike RSA and ECC, which are vulnerable to quantum computers, lattice problems are believed to remain hard even against quantum algorithms. | Elliptic Curve Cryptography (ECC) is a public-key cryptosystem based on the algebraic structure of elliptic curves over finite fields. Proposed independently by Neal Koblitz and Victor Miller in 1985, ECC offers equivalent security to RSA with much smaller key sizes. Modern cryptography increasingly favors ECC for its efficiency: a 256-bit ECC key provides security comparable to a 2048-bit RSA key, making it ideal for constrained environments and high-performance systems. |
| ScholarGateডেটাসেট ↗ |
|
|