Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k )
From MaRDI portal
Publication:3511179
DOI10.1007/978-3-540-70500-0_31zbMath1370.94533MaRDI QIDQ3511179
Publication date: 8 July 2008
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70500-0_31
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
14G50: Applications to coding theory and cryptography of arithmetic geometry
Cites Work
- Montgomery multiplication in \(\text{GF}(2^ k)\)
- Elliptic curve cryptosystems in the presence of permanent and transient faults
- Polynomial Codes Over Certain Finite Fields
- Modular Multiplication Without Trial Division
- Elliptic Curve Cryptosystems
- Decoding of redundant residue polynomial codes using Euclid's algorithm
- Fast fault-tolerant digital convolution using a polynomial residue number system
- Mastrovito multiplier for general irreducible polynomials
- Fault-tolerant computations over replicated finite rings
- Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems
- On the importance of eliminating errors in cryptographic computations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item