On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
From MaRDI portal
Publication:4307309
DOI10.1109/18.272496zbMath0803.94016OpenAlexW2148321903MaRDI QIDQ4307309
Yuanxing Li, Robert H. Deng, Xinmei Wang
Publication date: 4 October 1994
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/sis_research/94
Related Items
Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security, A Summary of McEliece-Type Cryptosystems and their Security, Basics of Secrecy Coding, A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory, Secure Message Authentication Against Related-Key Attack, The non-gap sequence of a subcode of a generalized Reed-Solomon code, A code-based signature scheme from the Lyubashevsky framework, Extended multivariate public key cryptosystems with secure encryption function, Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes, A survey of some applications of finite fields, Computational aspects of retrieving a representation of an algebraic geometry code, Code-Based Cryptosystems Using Generalized Concatenated Codes, Attacking and Defending the McEliece Cryptosystem, A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes, On quasi-cyclic codes as a generalization of cyclic codes, On the dimension of the subfield subcodes of 1-point Hermitian codes, Semantic security for the McEliece cryptosystem without random oracles, Wild McEliece, Reducing Key Length of the McEliece Cryptosystem, Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
Uses Software
