Bit retrieval: intractability and application to digital watermarking

Details Bit retrieval: intractability and application to digital watermarking Bit retrieval: intractability and application to digital watermarking

2003-09-23

arxiv.org/abs/math/0309387v1

Mathematics

Number Theory

27 pages, 4 figures

Scientific paper

Bit retrieval, the problem of determining a binary sequence from its cyclic autocorrelation, is a special case of the phase retrieval problem. Algorithms for phase retrieval are extensively used in several scientific disciplines, and yet, very little is known about the complexity of these algorithms or phase retrieval in general. Here we show that bit retrieval, in particular, is closely related to computations that arise in algebraic number theory and can also be formulated as an integer program. We find that general purpose algorithms from these fields, when applied to bit retrieval, are outperformed by a particular iterative phase retrieval algorithm. This algorithm still has exponential complexity and motivates us to propose a new public key signature scheme based on the intractability of bit retrieval, and image watermarking as a possible application.

Affiliated with

Also associated with

No associations

Rating

Bit retrieval: intractability and application to digital watermarking does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bit retrieval: intractability and application to digital watermarking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bit retrieval: intractability and application to digital watermarking will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-182911