Pith. sign in

REVIEW 1 cited by

Unsupervised Cipher Cracking Using Discrete GANs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1801.04883 v1 pith:K3KQZKU3 submitted 2018-01-15 cs.LG

classification cs.LG
keywords ciphergandatadiscreteciphercrackingcyclegangansused
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This work details CipherGAN, an architecture inspired by CycleGAN used for inferring the underlying cipher mapping given banks of unpaired ciphertext and plaintext. We demonstrate that CipherGAN is capable of cracking language data enciphered using shift and Vigenere ciphers to a high degree of fidelity and for vocabularies much larger than previously achieved. We present how CycleGAN can be made compatible with discrete data and train in a stable way. We then prove that the technique used in CipherGAN avoids the common problem of uninformative discrimination associated with GANs applied to discrete data.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Should LLM Safety Be More Than Refusing Harmful Instructions?

    cs.CL 2025-06 conditional novelty 5.0 of 10

    LLMs that can decrypt common ciphers show safety failures split across two dimensions, refusing too much or generating unsafe output, and current defenses fix one side while breaking the other.

Pith tools