<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Neural Linguistic Steganography · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1909.01496/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1909.01496/feed.xml" rel="self" type="application/rss+xml" /><item><title>Neural Linguistic Steganography — mentioned by prophesi</title><link>https://news.ycombinator.com/item?id=22559234</link><guid isPermaLink="false">urn:hackerpapers:mention:1909.01496:22559234</guid><pubDate>Thu, 12 Mar 2020 17:21:51 GMT</pubDate><description>&lt;p&gt;Does anyone know what happened to the live demo on https://github.com/harvardnlp/NeuralSteganography ? It basically does what memespeech is doing, except much better. Both parties would need to agree on a cover text (let&amp;#x27;s say, a chapter from the NIV Bible). It then generates some text via GPT-2 trained on this cover text, with your hidden message encoded in it. You&amp;#x27;d then send this generated text to the recipient (which actually looks like a normal message written in the style of your cover text). They&amp;#x27;d enter the same chapter of the NIV Bible along with your generated text, which then lets…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1909.01496/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Neural Linguistic Steganography — mentioned by cs702</title><link>https://news.ycombinator.com/item?id=20891146</link><guid isPermaLink="false">urn:hackerpapers:mention:1909.01496:20891146</guid><pubDate>Thu, 05 Sep 2019 22:17:53 GMT</pubDate><description>&lt;p&gt;Very cool! If I understand correctly, this approach can generate steganographic output that is virtually indistinguishable from the output generated by the language model used. Quoting from section 4.3 of the paper: &amp;quot;Most striking, arithmetic coding with the unmodulated language model induces a q distribution with a KL of 4e-8 nats. This indicates that, consistent with theory (Sallee, 2004), arithmetic coding enables generative steganography matching the exact distribution of the language model used.&amp;quot;[a] Regardless of theory, I can&amp;#x27;t help but think, holy cow, the K-L divergence between the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1909.01496/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
