পদ্ধতির তুলনা করুন

	ল্যাটিস-ভিত্তিক ক্রিপ্টোগ্রাফি	zk-STARK
ক্ষেত্র	ক্রিপ্টোগ্রাফি	ক্রিপ্টোগ্রাফি
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1996	2018
প্রবর্তক	Miklós Ajtai	Eli Ben-Sasson
ধরন	public-key cryptosystem based on lattice hardness	transparent zero-knowledge argument of knowledge
মৌলিক উৎস	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.	Ben-Sasson, E., Bentov, I., Horesh, Y., & Riabzev, M. (2019). Scalable, transparent, and post-quantum secure computational integrity. In IACR Cryptology ePrint Archive, Report 2018/046.
অপর নাম	lattice cryptography, post-quantum lattice cryptography	zk-STARK, transparent argument of knowledge, STARK
সম্পর্কিত	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.	A zk-STARK (Zero-Knowledge Scalable Transparent Argument of Knowledge) is a cryptographic proof system allowing a prover to convince a verifier of a computation's correctness without trusted setup or revealing computational details. Introduced by Ben-Sasson and colleagues in 2018, zk-STARKs address a key limitation of zk-SNARKs: they require no preprocessing phase vulnerable to corruption. Instead, STARKs rely only on cryptographic hash functions, making them simpler, more transparent, and believed to be post-quantum secure.