TCHo: A Code-Based Cryptosystem

• Published in: Advances in Network Analysis and its Applications (ISBN: 978-3-642-30903-8), p. 149-179
• Series: Mathematics in Industry 18
• Berlin: Springer Berlin Heidelberg, 2013

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.

Reference

• EPFL-CHAPTER-182194
• doi:10.1007/978-3-642-30904-5_7

Record created on 2012-11-07, modified on 2012-11-12