public class StateRecovery02 extends Job
Usage: java pj2 StateRecovery02 dfreq R K N P seed
The program performs R repetitions in parallel. For each repetition, 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.
ALL_CORES, ALL_GPUS, ANY_NODE_NAME, DEFAULT_CHUNK, DEFAULT_CORES, DEFAULT_GPUS, DEFAULT_NODE_NAME, DEFAULT_SCHEDULE, DEFAULT_THREADS, DEFAULT_WORKERS, dynamic, fixed, guided, jobFinish, jobLaunch, jobStart, leapfrog, makespan, proportional, remainingTuples, STANDARD_CHUNK, taskArguments, taskFinish, taskInputTuples, taskLaunch, taskOutputTuples, taskStart, THREADS_EQUALS_CORES
Constructor and Description |
---|
StateRecovery02() |
Modifier and Type | Method and Description |
---|---|
void |
main(String[] args)
Job main program.
|
chunk, chunk, cores, cores, debug, debug, debug, execute, gpus, gpus, jar, jar, jvmFlags, jvmFlags, listenHost, listenHost, listenPort, listenPort, masterChunk, masterChunk, masterFor, masterFor, masterSchedule, masterSchedule, nodeName, nodeName, putTuple, putTuple, rule, rule, schedule, schedule, terminate, threads, threads, timeLimit, timeLimit, trackerHost, trackerHost, trackerPort, trackerPort, workers, workers
Copyright © 2017 by Alan Kaminsky. All rights reserved. Send comments to ark@cs.rit.edu.