public class StateRecovery01 extends Object
Usage: java StateRecovery01 [-v] dfreq K N P seed
The program picks a random key; a random nonce of length Nlen; and a random plaintext of length Plen using the digram frequencies in the dfreq file. The program computes the ciphertext. The program "forgets" the final K letters of the key. The program does a branch-and-bound search to recover the missing key letters and reports the number of conflicts encountered during the search. If the -v flag is specified, the program prints the state of the search at each step.
Constructor and Description |
---|
StateRecovery01() |
Copyright © 2017 by Alan Kaminsky. All rights reserved. Send comments to ark@cs.rit.edu.