TCHo: A Code-Based Cryptosystem

TCHo is a public-key cryptosystem based on the hardness of finding a multiple polynomial with low weight and on the hardness of distinguishing between the output of an LFSR with noise and some random source. An early version was proposed in 2006 by Finiasz and Vaudenay with non-polynomial (though practical) decryption time. The latest version came in 2007 with more co-authors. It reached competitive (heuristic) polynomial complexity and IND-CPA security. Since then, a key-recovery chosen ciphertext attack was published by Herrmann and Leander in 2009. In this paper we review the state of the art on this cryptosystem, together with some latest improvements regarding implementation and selection of parameters. We provide also more formal results regarding correctness and we update the key generation algorithm.


Editor(s):
Kranakis, Evangelos
Published in:
Advances in Network Analysis and its Applications, 149-179
Year:
2013
Publisher:
Berlin, Springer Berlin Heidelberg
ISBN:
978-3-642-30903-8
Laboratories:




 Record created 2012-11-07, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)