Code-based cryptography on reconfigurable hardware: tweaking Niederreiter encryption for performance

摘要: Today’s public-key schemes that are either based on the factorization or discrete logarithm problem. Since both problems closely related, a major breakthrough in cryptanalysis (e.g., with advent of quantum computing will render nearly all currently employed security system useless. Code-based rely alternative assumption decoding generic linear binary codes is NP-complete. Two code-based for encryption available due to McEliece and Niederreiter. Although most researchers analyzed implemented McEliece’s cryptosystem, we show this work scheme by Niederreiter has some important advantages, such as smaller keys, more practical plain ciphertext sizes less computation complexity. In particular, propose an efficient FPGA implementation Niederreiter’s can encrypt than 1.5 million plaintexts per seconds Xilinx Virtex-6 FPGA—outperforming known implementations other popular cryptosystems so far.