1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355
|
//******************************************************************************
//
// File: AesTestClu.java
// Package: edu.rit.clu.monte
// Unit: Class edu.rit.clu.monte.AesTestClu
//
// This Java source file is copyright (C) 2008 by Alan Kaminsky. All rights
// reserved. For further information, contact the author, Alan Kaminsky, at
// ark@cs.rit.edu.
//
// This Java source file is part of the Parallel Java Library ("PJ"). PJ is free
// software; you can redistribute it and/or modify it under the terms of the GNU
// General Public License as published by the Free Software Foundation; either
// version 3 of the License, or (at your option) any later version.
//
// PJ is distributed in the hope that it will be useful, but WITHOUT ANY
// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
// A PARTICULAR PURPOSE. See the GNU General Public License for more details.
//
// Linking this library statically or dynamically with other modules is making a
// combined work based on this library. Thus, the terms and conditions of the
// GNU General Public License cover the whole combination.
//
// As a special exception, the copyright holders of this library give you
// permission to link this library with independent modules to produce an
// executable, regardless of the license terms of these independent modules, and
// to copy and distribute the resulting executable under terms of your choice,
// provided that you also meet, for each linked independent module, the terms
// and conditions of the license of that module. An independent module is a
// module which is not derived from or based on this library. If you modify this
// library, you may extend this exception to your version of the library, but
// you are not obligated to do so. If you do not wish to do so, delete this
// exception statement from your version.
//
// A copy of the GNU General Public License is provided in the file gpl.txt. You
// may also obtain a copy of the GNU General Public License on the World Wide
// Web at http://www.gnu.org/licenses/gpl.html.
//
//******************************************************************************
package edu.rit.clu.monte;
import edu.rit.crypto.blockcipher.AES256Cipher;
import edu.rit.mp.DoubleBuf;
import edu.rit.mp.IntegerBuf;
import edu.rit.mp.LongBuf;
import edu.rit.mp.buf.DoubleItemBuf;
import edu.rit.mp.buf.LongItemBuf;
import edu.rit.numeric.Statistics;
import edu.rit.pj.Comm;
import edu.rit.pj.reduction.DoubleOp;
import edu.rit.pj.reduction.LongOp;
import edu.rit.util.Hex;
import edu.rit.util.LongRange;
import edu.rit.util.Range;
import java.util.Arrays;
/**
* Class AesTestClu is a cluster parallel program that tests the randomness of
* the AES block cipher.
* <P>
* Usage: java -Dpj.np=<I>K</I> edu.rit.clu.monte.AesTestClu <I>key</I> <I>N</I>
* <BR><I>K</I> = Number of parallel processes
* <BR><I>key</I> = Block cipher key
* <BR><I>N</I> = Number of blocks
* <P>
* The program:
* <UL>
* <LI>
* Initializes the AES block cipher with the <I>key</I>.
* <LI>
* Generates <I>N</I> ciphertext blocks by encrypting the plaintext blocks 0, 1,
* 2, and so on (counter mode).
* <LI>
* Takes the most significant halves of the 128-bit ciphertext blocks as a
* series of 64-bit <TT>long</TT> values.
* <LI>
* Divides the <TT>long</TT> values by 2<SUP>64</SUP>, yielding a series of
* supposedly-random <TT>double</TT> values in the range 0.0 to 1.0.
* <LI>
* Performs a Kolmogorov-Smirnov (K-S) test on the data to try to disprove the
* null hypothesis that the data are drawn from a uniform distribution.
* <LI>
* Prints the K-S statistic and the p-value.
* </UL>
* <P>
* The computation is performed in parallel in multiple processors. The program
* measures the computation's running time.
*
* @author Alan Kaminsky
* @version 05-May-2008
*/
public class AesTestClu
{
// Prevent construction.
private AesTestClu()
{
}
// Program shared variables.
// World communicator.
static Comm world;
static int size;
static int rank;
// Command line arguments.
static byte[] key = new byte [32];
static long N;
// AES block cipher.
static AES256Cipher cipher;
// Plaintext and ciphertext blocks.
static byte[] plaintext = new byte [16];
static byte[] ciphertext = new byte [16];
// Random data values, partitioned to be sent to all processes.
static double[] sendData;
// Number of data values sent from this process to each process, plus total.
static int[] sendLength;
static int sendN;
// Number of data values received by this process from each process, plus
// total.
static int[] recvLength;
static int recvN;
// Index ranges in the sendData array from which to obtain data values sent
// to each process.
static Range[] sendRanges;
// Index ranges in the data array in which to store data values received
// from each process.
static Range[] recvRanges;
// Random data values received by this process.
static double[] data;
// Number of data values in lower-ranked processes.
static long lowerN;
// 2^64.
static double TWO_SUP_64;
// Main program.
/**
* Main program.
*/
public static void main
(String[] args)
throws Exception
{
// Start timing.
long time = -System.currentTimeMillis();
// Initialize middleware.
Comm.init (args);
world = Comm.world();
size = world.size();
rank = world.rank();
// Validate command line arguments.
if (args.length != 2) usage();
Hex.toByteArray (args[0], key);
N = Long.parseLong (args[1]);
// Set up AES block cipher.
cipher = new AES256Cipher (key);
// Compute 2^64.
TWO_SUP_64 = 2.0; // 2^1
TWO_SUP_64 *= TWO_SUP_64; // 2^2
TWO_SUP_64 *= TWO_SUP_64; // 2^4
TWO_SUP_64 *= TWO_SUP_64; // 2^8
TWO_SUP_64 *= TWO_SUP_64; // 2^16
TWO_SUP_64 *= TWO_SUP_64; // 2^32
TWO_SUP_64 *= TWO_SUP_64; // 2^64
// Generate this process's subset of the N random data values.
LongRange indexRange = new LongRange (0, N-1) .subrange (size, rank);
long lb = indexRange.lb();
long len = indexRange.length();
sendData = new double [(int) len];
for (long i = 0; i < len; ++ i)
{
longToBytes (lb+i, plaintext, 8);
cipher.encrypt (plaintext, ciphertext);
sendData[(int) i] = bytesToDouble (ciphertext, 0);
}
// If there's more than one process, do message passing.
if (size > 1)
{
// Determine how many data values will be going to each process.
Arrays.sort (sendData);
sendLength = new int [size];
int prevj = 0;
int j = 0;
for (int i = 0; i < size; ++ i)
{
double threshold = ((double) (i+1)) / ((double) size);
while (j < len && sendData[j] < threshold) ++ j;
sendLength[i] = j - prevj;
prevj = j;
}
// Determine how many data values will be coming from each process.
recvLength = new int [size];
world.allToAll
(IntegerBuf.sliceBuffers
(sendLength, new Range (0, size-1) .subranges (size)),
IntegerBuf.sliceBuffers
(recvLength, new Range (0, size-1) .subranges (size)));
// Transfer data values.
sendRanges = new Range [size];
sendN = 0;
recvRanges = new Range [size];
recvN = 0;
for (int i = 0; i < size; ++ i)
{
sendRanges[i] = new Range (sendN, sendN+sendLength[i]-1);
sendN += sendLength[i];
recvRanges[i] = new Range (recvN, recvN+recvLength[i]-1);
recvN += recvLength[i];
}
data = new double [recvN];
world.allToAll
(DoubleBuf.sliceBuffers (sendData, sendRanges),
DoubleBuf.sliceBuffers (data, recvRanges));
// Release storage for sent data values.
sendData = null;
// Determine how many data values ended up in lower-ranked
// processes.
LongItemBuf lowerNbuf = LongBuf.buffer (recvN);
world.exclusiveScan (lowerNbuf, LongOp.SUM, 0L);
lowerN = lowerNbuf.item;
}
// If there's only one process, don't bother with message passing.
else
{
data = sendData;
sendData = null;
recvN = (int) len;
lowerN = 0;
}
// Compute the K-S statistic, D, for this process's random data values.
Arrays.sort (data);
double N_double = N;
double D = 0.0;
double F_lower = lowerN / N_double;
double F_upper;
double x;
for (int i = 0; i < recvN; ++ i)
{
F_upper = (lowerN+i+1) / N_double;
x = data[i];
D = Math.max (D, Math.abs (x - F_lower));
D = Math.max (D, Math.abs (x - F_upper));
F_lower = F_upper;
}
// Put the maximum of all processes' D values into process 0.
DoubleItemBuf Dbuf = DoubleBuf.buffer (D);
world.reduce (0, Dbuf, DoubleOp.MAXIMUM);
D = Dbuf.item;
// Compute the p-value, P.
double P = Statistics.ksPvalue (N, D);
// Stop timing.
time += System.currentTimeMillis();
// Print results in process 0.
if (rank == 0)
{
System.out.println ("N = " + N);
System.out.println ("D = " + D);
System.out.println ("P = " + P);
}
System.out.println (time + " msec " + rank);
}
// Hidden operations.
/**
* Convert the given <TT>long</TT> value to eight bytes stored starting at
* <TT>block[i]</TT>.
*
* @param value <TT>long</TT> value.
* @param block Plaintext block.
* @param i Starting index.
*/
private static void longToBytes
(long value,
byte[] block,
int i)
{
for (int j = 7; j >= 0; -- j)
{
block[i+j] = (byte) (value & 0xFF);
value >>>= 8;
}
}
/**
* Convert the eight bytes starting at <TT>block[i]</TT> to a
* <TT>double</TT> value.
*
* @param block Ciphertext block.
* @param i Starting index.
*
* @return <TT>double</TT> value.
*/
private static double bytesToDouble
(byte[] block,
int i)
{
long result = 0L;
for (int j = 0; j < 8; ++ j)
{
result = (result << 8) | (block[i+j] & 0xFF);
}
return result / TWO_SUP_64 + 0.5;
}
/**
* Print a usage message and exit.
*/
private static void usage()
{
System.err.println ("Usage: java -Dpj.np=<K> edu.rit.clu.monte.AesTestClu <key> <N>");
System.err.println ("<K> = Number of parallel processes");
System.err.println ("<key> = Block cipher key");
System.err.println ("<N> = Number of blocks");
System.exit (1);
}
}
|