Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

New Code-Based Cryptosystem with Arbitrary Error Vectors (2006.00514v1)

Published 31 May 2020 in cs.CR

Abstract: McEliece cryptosystem represents a smart open key system based on the hardness of the decoding of an arbitrary linear code, which is believed to be able to resist the advent of quantum computers. But the original McEliece cryptosystem, based on Goppa codes, has just very limited interest in practice, partly because it requires a very large public key. In this paper we propose a new general way to reduce the public key size. Unlike most papers on reducing key length of the cryptosystem, where original Goppa codes are substituted by some other codes, we suggest a new method of key size reduction which is code-independent.

Summary

We haven't generated a summary for this paper yet.