HN user

seasox

38 karma
Posts2
Comments19
View on HN

We usually do conferences in cryptography/security, and most of them have page limits: CCS, USENIX, NDSS, S&P, CRYPTO, EUROCRYPT all have page limits (some allow appendices, which reviewers are not obligated to read).

There is no known polynomial time algorithm for TSP. AFAIK there are quantum algorithms for TSP with quadratic speedup in comparison to the brute force method (still exponential though).

The one thing quantum computers are (currently and theoretically) able to solve efficiently is the factorization problem, but are very much limited by low qubit number, i.e. engineering problems.

Don‘t think about microwave vs. stove. Instead, do the following:

1. stop buying meat

2. stop eating meat

3. stop buying dairy-based products

4. stop eating dairy-based products

5. stop eating eggs, honey, fish

6. use public transport, if possible

7. don‘t fly, if possible

Congrats, you now are an environmentalist.

That's an interesting question! Disclaimer: In my current research, I'm focusing on steganography on ML-based lossless channels. Not an export on image-based steganography.

As far as I know, image based steganography usually uses random noise added to a cover image and a preshared key to decide which noise is actually encoded information. Since printers and scanners are a lossy channel, the noise will deteriorate. So I think this is a hard problem -- this might be possible with some kind of error correcting code as used in QR codes and alike (or maybe even use QR codes as the cover channel)