Self-correctors for Cryptographic Modules (Q3104690)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Self-correctors for Cryptographic Modules	scientific article

Statements

scholarly article

0 references

Self-correctors for Cryptographic Modules (English)

0 references

0 references

Tetsutaro Kobayashi

0 references

Cryptography and Coding

0 references

publication date

16 December 2011

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-25516-8_9

0 references

Proof verification and the hardness of approximation problems

0 references

Probabilistic checking of proofs

0 references

0 references

Self-testing/correcting with applications to numerical problems

0 references

On coherence, random-self-reducibility, and self-correction

0 references

A Simple BGN-Type Cryptosystem from LWE

0 references

Theory of Cryptography

0 references

Factoring integers with elliptic curves

0 references

The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

0 references

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

0 references

0 references

Robust Characterizations of Polynomials with Applications to Program Testing

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-25516-8_9

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3104690

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3104690&oldid=35258424"