Self-correctors for Cryptographic Modules

DOI10.1007/978-3-642-25516-8_9zbMath1292.68064OpenAlexW138127373MaRDI QIDQ3104690

Go Yamamoto, Tetsutaro Kobayashi

Publication date: 16 December 2011

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25516-8_9

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• On coherence, random-self-reducibility, and self-correction
• Self-testing/correcting with applications to numerical problems
• Proof verification and the hardness of approximation problems
• A Simple BGN-Type Cryptosystem from LWE
• Probabilistic checking of proofs
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• Robust Characterizations of Polynomials with Applications to Program Testing
• Theory of Cryptography

This page was built for publication: Self-correctors for Cryptographic Modules