Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems
From MaRDI portal
Publication:5386085
DOI10.1007/978-3-540-77224-8_16zbMath1195.94065OpenAlexW1607148308MaRDI QIDQ5386085
Publication date: 17 April 2008
Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77224-8_16
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial Codes Over Certain Finite Fields
- Fast fault-tolerant digital convolution using a polynomial residue number system
- Fault-tolerant computations over replicated finite rings
- On the importance of eliminating errors in cryptographic computations
This page was built for publication: Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems