Low-Reiter: Niederreiter encryption scheme for embedded microcontrollers

20Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Most modern security systems rely on public-key schemes based either on the factorization or the discrete logarithm problem. Since both problems are known to be closely related, a major breakthrough in cryptanalysis affecting one of those problems could render a large set of cryptosystems completely useless. Coding based public-key schemes are based on the alternative security assumption that decoding unknown linear binary codes is NP-complete. There exist two basic schemes of this type, namely McEliece and the Niederreiter variant, whereas the security of both schemes are equivalent. The latter has the advantage of smaller public keys, but the disadvantage of a computationally expensive mapping, which slows down encryption and decryption. In this work, we investigate the efficient implementation of the Niederreiter scheme on very constrained micro controllers. We adopt existing algorithms to the limited abilities of the target platform and finally compare the implementation to widely used schemes and also to other alternative public schemes. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Heyse, S. (2010). Low-Reiter: Niederreiter encryption scheme for embedded microcontrollers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6061 LNCS, pp. 165–181). https://doi.org/10.1007/978-3-642-12929-2_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free