Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems

DOI10.1007/978-3-540-77224-8_16MaRDI QIDQ5386085zbMATH OpenOpenAlexFDO

Authors Silvana Medoš, Serdar Boztaş

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k )
• Robust finite field arithmetic for fault-tolerant Tate pairing
• Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable
• Perturbating RSA Public Keys: An Improved Attack
• scientific article; zbMATH DE number 1979306

Cites work

• Fast fault-tolerant digital convolution using a polynomial residue number system
• Fault-tolerant computations over replicated finite rings
• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• scientific article; zbMATH DE number 1026591 (Why is no real title available?)
• scientific article; zbMATH DE number 1149907 (Why is no real title available?)
• scientific article; zbMATH DE number 1418307 (Why is no real title available?)
• Modern computer algebra
• On the importance of eliminating errors in cryptographic computations
• Polynomial Codes Over Certain Finite Fields

Cited in

(7)

• A systematic approach for encryption and authentication with fault tolerance
• Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k )
• Robust finite field arithmetic for fault-tolerant Tate pairing
• The robust arithmetic of finite field for fault-tolerant Tate pairing with binary field
• scientific article; zbMATH DE number 1424173 (Why is no real title available?)
• scientific article; zbMATH DE number 5066607 (Why is no real title available?)
• Efficient hardware implementation of finite fields with applications to cryptography

This page was built for publication: Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386085)