Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices-Reference-Cited by-同舟云学术

Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices

Published:2011 Issue: Volume: Page:143-162
ISSN:0302-9743
Container-title:Post-Quantum Cryptography
language:
Short-container-title:

Author:

Heyse Stefan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-25405-5_10

Reference23 articles.

1. Adams, W., Loustaunau, P.: An Introduction to Gröbner Bases, vol. 3 (1994)

2. Afanasyev, V.B.: On the complexity of finite field arithmetic. In: Fifth Joint Soviet-Swedish Intern. Workshop Information Theory, pp. 9–12 (January 1991)

3. Berlekamp, E.R.: Factoring polynomials over large finite fields. Mathematics of Computation 24(111), 713–715 (1970)

4. Lecture Notes in Computer Science;D.J. Bernstein,2008

5. Chien, R.: Cyclic decoding procedure for the bose-chaudhuri-hocquenghem codes. IEEE Transactions on Information Theory IT-10(10), 357–363 (1964)

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Socio-Cyber-Physical Systems Security Concept;2022 International Congress on Human-Computer Interaction, Optimization and Robotic Applications (HORA);2022-06-09

2. Classic McEliece Implementation with Low Memory Footprint;Smart Card Research and Advanced Applications;2021

3. From Pre-Quantum to Post-Quantum IoT Security: A Survey on Quantum-Resistant Cryptosystems for the Internet of Things;IEEE Internet of Things Journal;2020-07

4. Higher-Order Masking Scheme against DPA Attack in Practice: McEliece Cryptosystem Based on QD-MDPC Code;KSII Transactions on Internet and Information Systems;2019-02-28

5. Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$;Codes, Cryptology and Information Security;2017