US 2011/0033041 A1 · INDEX-BASED CODING WITH A PSEUDO-RANDOM SOURCE

Abstract

Outputs from at least one pseudo-random source are used to encode hidden value. The hidden value is encoded using index based quantities, for example, based on numerically ordering a sequence of outputs from pseudo-random source(s). In some examples, the numerical ordering of re-generated device-specific quantities is used to re-generate the hidden value, without necessarily requiring additional error correction mechanisms. Information leak may be reduced by constructing system whose “syndrome” helper bits are random, as measured, for example, by NIST's Statistical Tests for Randomness In some examples, index based coding provides coding gain that exponentially reduces total error correction code complexity, resulting in efficiently realizable PRS-based key generation systems. In some examples, index based coding allows noisy PRS to be robust across conditions where conventional error correction code cannot error correct.

Claims21

Dependent claims

A method comprising:

accepting an encoding of first data as data representing a set of one or more indices formed based on a first series of quantities generated by a pseudo-random source, the data representing the indices being insufficient to reproduce the first data;
generating a second series of quantities with the pseudo-random source, the set of one or more indices identifying quantities in the second series;
and
combining the set of one or more indices and the second series of quantities to reproduce first data.

1 more element

Dependencies are inferred from the claim text.

Index-based coding with a pseudo-random source

Life of this patent

Index-based coding with a pseudo-random source

Life of this patent

Abstract

Claims21