Lines Matching +defs:n +defs:y

37       // alert("no form dw__editform\n");
173     // alert("no form wiki__text\n");
268   // alert("crypt_keys[" + lock + "]=" + crypt_keys[lock] + "\n");
270     var x,y;
273     y=prompt("Verify passphrase key for lock " + lock);
274     if(y===null) { return(false); }
275     if(x!=y) { crypt_debug("passwords do not match\n"); return(false); }
276     crypt_debug("x=" + x + " y=" + y);
285   // document.getElementById("debug_field").value+=str + "\n";
435   prefix+="http://www.fourmilab.ch/javascrypt/\n";
436   suffix = "#####  End encrypted message\n";
625 // the indeterminant that has a 1 coefficient in x, add y times that power
626 // to the result. x and y should be bytes representing elements of GF(2^8)
628 function mult_GF256(x, y) {
631   for (bit = 1; bit < 256; bit *= 2, y = xtime(y)) {
632     if (x & bit) { result ^= y; }
1206   var n = 1 + (this.key[3] & 2) + (this.key[9] & 1);
1207   for (i = 0; i < n; i++) {
1229 //  Return n bit integer value (up to maximum integer size)
1230 function AESprng_nextbits(n) {
1231   var i, w = 0, nbytes = Math.floor((n + 7) / 8);
1236   return w & ((1 << n) - 1);
1239 //  Return integer between 0 and n inclusive
1240 function AESprng_nextInt(n) {
1243   //  Determine smallest p,  2^p > n
1246   while (n >= p) {
1252   /*  Generate values from 0 through n by first generating
1253       values v from 0 to (2^p)-1, then discarding any results v > n.
1255       values mod (n + 1) is biased toward smaller values, see
1262     if (v <= n) {
1316 //  Return next random integer between 0 and n inclusive
1318 function LEnint(n) {
1321   //  Determine smallest p,  2^p > n
1323   while (n >= p) {
1328   /*  Generate values from 0 through n by first masking
1329     values v from 0 to (2^p)-1, then discarding any results v > n.
1331   values mod (n + 1) is biased toward smaller values, see
1338       if (v <= n) {
1366 function array(n) {
1367     for (i = 0; i < n; i++) {
1370     this.length = n;
1379 function integer(n) {
1380     return n % (0xffffffff + 1);
1509 function jcF(x, y, z) {
1510   return or(and(x, y), and(not(x), z));
1513 function jcG(x, y, z) {
1514   return or(and(x, z), and(y, not(z)));
1517 function jcH(x, y, z) {
1518   return xor(xor(x, y), z);
1521 function jcI(x, y, z) {
1522   return xor(y ,or(x , not(z)));
1525 function rotateLeft(a, n) {
1526   return or(shl(a, n), (shr(a, (32 - n))));
1737     t += h.substring(0, maxLineLength) + "\n";
1741   t += h + "\n";
1797     acgt += acgcl + "\n";
1849   acgt += acgcl + "\n";
1913       var n = c.charCodeAt(0) - charBase;
1914       n = (n + (24 - r)) % 24;
1915       //dump("n", n);
1917         ba = (n << 4);
1920         ba |= n;
1979       b64t += b64l + "\n";
2001     b64t += b64l + "\n";
2007   b64t += b64l + "\n";
2013   var i = 0, j, c, shortgroup = 0, n = 0;
2066     //dump("n", n);
2068       b[n++] = ((d[0] << 2) | (d[1] >> 4)) & 0xFF;
2070         b[n++] = ((d[1] << 4) | (d[2] >> 2)) & 0xFF;
2073           b[n++] = ((d[2] << 6) | d[3]) & 0xFF;
2090   for (var n = 0; n < s.length; n++) {
2091     var c = s.charCodeAt(n);