Scaling efficient code-based cryptosystems for embedded platforms
Felipe P. Biasi, Paulo S. L. M. Barreto, Rafael Misoczki and, Wilson V. Ruggiero

TL;DR
This paper introduces a family of efficient code-based cryptographic systems optimized for embedded platforms, outperforming traditional and post-quantum algorithms in various efficiency metrics.
Contribution
It presents novel highly efficient codes and algorithms specifically designed for constrained embedded environments, surpassing existing cryptographic proposals.
Findings
Outperforms RSA and NTRU in efficiency metrics
Suitable for highly constrained platforms
Provides a new family of cryptographic codes
Abstract
We describe a family of highly efficient codes for cryptographic purposes and dedicated algorithms for their manipulation. Our proposal is especially tailored for highly constrained platforms, and surpasses certain conventional and post-quantum proposals (like RSA and NTRU, respectively) according to most if not all efficiency metrics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptographic Implementations and Security · Coding theory and cryptography · Chaos-based Image/Signal Encryption
