Modulus Computational Entropy (Q2948262)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Modulus Computational Entropy	scientific article

Statements

scholarly article

0 references

Modulus Computational Entropy (English)

0 references

Maciej Skórski

0 references

Lecture Notes in Computer Science

0 references

publication date

30 September 2015

0 references

full work available at URL

https://arxiv.org/abs/1302.2128

0 references

MaRDI profile type

MaRDI publication profile

0 references

Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

0 references

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

0 references

Overcoming Weak Expectations

0 references

A Pseudorandom Generator from any One-way Function

0 references

Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility

0 references

A Counterexample to the Chain Rule for Conditional HILL Entropy

0 references

Some Notions of Entropy for Cryptography

0 references

A Mathematical Theory of Communication

0 references

Characterizing pseudoentropy and simplifying pseudorandom generator constructions

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-04268-8_11

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2948262

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