diff options
| -rw-r--r-- | README.md | 2 | ||||
| -rw-r--r-- | vala/sha3sum.vala | 853 |
2 files changed, 1 insertions, 854 deletions
@@ -5,7 +5,6 @@ COMPLETE STATUS: Python 2 :: optimised for Python 3 C ISO C90 :: optimised Java/C JNI :: optimised - Vala :: under development NASM :: planned (maybe) Python 3 + C :: planned (maybe) Haskell :: planned (maybe) @@ -14,6 +13,7 @@ COMPLETE STATUS: Common Lisp :: planned (perhaps) Scala :: planned (perhaps) Magic :: planned (perhaps) + Vala :: maybe in the future PERFORMANCE COMPARISON: diff --git a/vala/sha3sum.vala b/vala/sha3sum.vala deleted file mode 100644 index ee411b0..0000000 --- a/vala/sha3sum.vala +++ /dev/null @@ -1,853 +0,0 @@ -/** - * sha3sum – SHA-3 (Keccak) checksum calculator - * - * Copyright © 2013, 2014 Mattias Andrée (maandree@member.fsf.org) - * - * This program is free software: you can redistribute it and/or modify - * it under the terms of the GNU Affero General Public License as published by - * the Free Software Foundation, either version 3 of the License, or - * (at your option) any later version. - * - * This program 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 Affero General Public License for more details. - * - * You should have received a copy of the GNU Affero General Public License - * along with this program. If not, see <http://www.gnu.org/licenses/>. - */ - - -/** - * Copy an array segment into an array - * - * @param src The source array - * @param soff The source array offset - * @param dest The destination array - * @param doff The destination array offset - * @param length The number of elements to copy - */ -static void arraycopy(uint8[] src, int soff, uint8[] dest, int doff, int length) -{ - if (soff + length < doff) - for (int i = 0; i < length; i++) - dest[doff + i] = src[soff + i]; - else - for (int i = length - 1; i >= 0; i--) - dest[doff + i] = src[soff + i]; -} - - -/** - * Copy an array segment into an array - * - * @param src The source array - * @param soff The source array offset - * @param dest The destination array - * @param doff The destination array offset - * @param length The number of elements to copy - */ -static void arraycopy_string(string[] src, int soff, string[] dest, int doff, int length) -{ - if (soff + length < doff) - for (int i = 0; i < length; i++) - dest[doff + i] = src[soff + i]; - else - for (int i = length - 1; i >= 0; i--) - dest[doff + i] = src[soff + i]; -} - - -/** - * SHA-3/Keccak hash algorithm implementation - * - * @author Mattias Andrée <a href="mailto:maandree@member.fsf.org">maandree@member.fsf.org</a> - */ -class SHA3 : Object -{ - /** - * Round contants - */ - private static const int64[] RC = { - 0x0000000000000001L, 0x0000000000008082L, 0x800000000000808AL, 0x8000000080008000L, - 0x000000000000808BL, 0x0000000080000001L, 0x8000000080008081L, 0x8000000000008009L, - 0x000000000000008AL, 0x0000000000000088L, 0x0000000080008009L, 0x000000008000000AL, - 0x000000008000808BL, 0x800000000000008BL, 0x8000000000008089L, 0x8000000000008003L, - 0x8000000000008002L, 0x8000000000000080L, 0x000000000000800AL, 0x800000008000000AL, - 0x8000000080008081L, 0x8000000000008080L, 0x0000000080000001L, 0x8000000080008008L}; - - /** - * Keccak-f round temporary - */ - private int64[] B = new int64[25]; - - /** - * Keccak-f round temporary - */ - private int64[] C = new int64[5]; - - - /** - * The bitrate - */ - private int r = 0; - - /** - * The capacity - */ - private int c = 0; - - /** - * The output size - */ - private int n = 0; - - /** - * The state size - */ - private int b = 0; - - /** - * The word size - */ - private int w = 0; - - /** - * The word mask - */ - private int64 wmod = 0; - - /** - * ℓ, the binary logarithm of the word size - */ - private int l = 0; - - /** - * 12 + 2ℓ, the number of rounds - */ - private int nr = 0; - - - /** - * The current state - */ - private int64[] S = null; - - /** - * Left over water to fill the sponge with at next update - */ - private uint8[] M = null; - - /** - * Pointer for {@link #M} - */ - private int mptr = 0; - - - - // Has default constructor - - - - /** - * Rotate a word - * - * @param x The value to rotate - * @param n Rotation steps, may not be 0 - * @return The value rotated - */ - private int64 rotate(int64 x, int n) - { - int64 m = n % this.w; - return ((int64)((uint64)x >> (this.w - m)) + (x << m)) & this.wmod; - } - - - /** - * Rotate a 64-bit word - * - * @param x The value to rotate - * @param n Rotation steps, may not be 0 - * @return The value rotated - */ - private int64 rotate64(int64 x, int n) - { - return (int64)((uint64)x >> (64 - n)) + (x << n); - } - - - /** - * Binary logarithm - * - * @param x The value of which to calculate the binary logarithm - * @return The binary logarithm - */ - private int lb(int x) - { - int rc = 0; - if ((x & 0xFF00) != 0) { rc += 8; x >>= 8; } - if ((x & 0x00F0) != 0) { rc += 4; x >>= 4; } - if ((x & 0x000C) != 0) { rc += 2; x >>= 2; } - if ((x & 0x0002) != 0) rc += 1; - return rc; - } - - /** - * Perform one round of computation - * - * @param A The current state - * @param rc Round constant - */ - private void keccakFRound(int64[] A, int64 rc) - { - /* θ step (step 1 of 3) */ - for (int i = 0, j = 0; i < 5; i++, j += 5) - this.C[i] = A[j] ^ A[j + 1] ^ A[j + 2] ^ A[j + 3] ^ A[j + 4]; - - int64 da, db, dc, dd, de; - - if (this.w == 64) - { - /* ρ and π steps, with last two part of θ */ - this.B[0] = A[ 0] ^ (da = this.C[4] ^ this.rotate64(this.C[1], 1)); - this.B[1] = this.rotate64(A[15] ^ (dd = this.C[2] ^ this.rotate64(this.C[4], 1)), 28); - this.B[2] = this.rotate64(A[ 5] ^ (db = this.C[0] ^ this.rotate64(this.C[2], 1)), 1); - this.B[3] = this.rotate64(A[20] ^ (de = this.C[3] ^ this.rotate64(this.C[0], 1)), 27); - this.B[4] = this.rotate64(A[10] ^ (dc = this.C[1] ^ this.rotate64(this.C[3], 1)), 62); - - this.B[5] = this.rotate64(A[ 6] ^ db, 44); - this.B[6] = this.rotate64(A[21] ^ de, 20); - this.B[7] = this.rotate64(A[11] ^ dc, 6); - this.B[8] = this.rotate64(A[ 1] ^ da, 36); - this.B[9] = this.rotate64(A[16] ^ dd, 55); - - this.B[10] = this.rotate64(A[12] ^ dc, 43); - this.B[11] = this.rotate64(A[ 2] ^ da, 3); - this.B[12] = this.rotate64(A[17] ^ dd, 25); - this.B[13] = this.rotate64(A[ 7] ^ db, 10); - this.B[14] = this.rotate64(A[22] ^ de, 39); - - this.B[15] = this.rotate64(A[18] ^ dd, 21); - this.B[16] = this.rotate64(A[ 8] ^ db, 45); - this.B[17] = this.rotate64(A[23] ^ de, 8); - this.B[18] = this.rotate64(A[13] ^ dc, 15); - this.B[19] = this.rotate64(A[ 3] ^ da, 41); - - this.B[20] = this.rotate64(A[24] ^ de, 14); - this.B[21] = this.rotate64(A[14] ^ dc, 61); - this.B[22] = this.rotate64(A[ 4] ^ da, 18); - this.B[23] = this.rotate64(A[19] ^ dd, 56); - this.B[24] = this.rotate64(A[ 9] ^ db, 2); - } - else - { - /* ρ and π steps, with last two part of θ */ - this.B[0] = A[ 0] ^ (da = this.C[4] ^ this.rotate(this.C[1], 1)); - this.B[1] = this.rotate(A[15] ^ (dd = this.C[2] ^ this.rotate(this.C[4], 1)), 28); - this.B[2] = this.rotate(A[ 5] ^ (db = this.C[0] ^ this.rotate(this.C[2], 1)), 1); - this.B[3] = this.rotate(A[20] ^ (de = this.C[3] ^ this.rotate(this.C[0], 1)), 27); - this.B[4] = this.rotate(A[10] ^ (dc = this.C[1] ^ this.rotate(this.C[3], 1)), 62); - - this.B[5] = this.rotate(A[ 6] ^ db, 44); - this.B[6] = this.rotate(A[21] ^ de, 20); - this.B[7] = this.rotate(A[11] ^ dc, 6); - this.B[8] = this.rotate(A[ 1] ^ da, 36); - this.B[9] = this.rotate(A[16] ^ dd, 55); - - this.B[10] = this.rotate(A[12] ^ dc, 43); - this.B[11] = this.rotate(A[ 2] ^ da, 3); - this.B[12] = this.rotate(A[17] ^ dd, 25); - this.B[13] = this.rotate(A[ 7] ^ db, 10); - this.B[14] = this.rotate(A[22] ^ de, 39); - - this.B[15] = this.rotate(A[18] ^ dd, 21); - this.B[16] = this.rotate(A[ 8] ^ db, 45); - this.B[17] = this.rotate(A[23] ^ de, 8); - this.B[18] = this.rotate(A[13] ^ dc, 15); - this.B[19] = this.rotate(A[ 3] ^ da, 41); - - this.B[20] = this.rotate(A[24] ^ de, 14); - this.B[21] = this.rotate(A[14] ^ dc, 61); - this.B[22] = this.rotate(A[ 4] ^ da, 18); - this.B[23] = this.rotate(A[19] ^ dd, 56); - this.B[24] = this.rotate(A[ 9] ^ db, 2); - } - - /* ξ step */ - for (int i = 0; i < 15; i++) - A[i ] = this.B[i ] ^ ((~(this.B[i + 5])) & this.B[i + 10]); - for (int i = 0; i < 5; i++) - { - A[i + 15] = this.B[i + 15] ^ ((~(this.B[i + 20])) & this.B[i ]); - A[i + 20] = this.B[i + 20] ^ ((~(this.B[i ])) & this.B[i + 5]); - } - - /* ι step */ - A[0] ^= rc; - } - - - /** - * Perform Keccak-f function - * - * @param A The current state - */ - private void keccakF(int64[] A) - { - if (this.nr == 24) - for (int i = 0; i < 24; i++) - this.keccakFRound(A, SHA3.RC[i]); - else - for (int i = 0; i < this.nr; i++) - this.keccakFRound(A, SHA3.RC[i] & this.wmod); - } - - - /** - * Convert a chunk of byte:s to a word - * - * @param message The message - * @param msgoff The number of times to loop has run times to bitrate - * @param rr Bitrate in bytes - * @param ww Word size in bytes - * @param off The offset in the message - * @return Lane - */ - private int64 toLane(uint8[] message, int msgoff, int rr, int ww, int off) - { - int64 rc = 0; - int n = (message.length < rr ? message.length : rr) + msgoff; - for (int i = off + ww - 1; i >= off; i--) - rc = (rc << 8) | ((i < n) ? (int64)(message[i] & 255) : 0L); - return rc; - } - - - /** - * Convert a chunk of byte:s to a 64-bit word - * - * @param message The message - * @param msgoff The number of times to loop has run times to bitrate - * @param rr Bitrate in bytes - * @param off The offset in the message - * @return Lane - */ - private int64 toLane64(uint8[] message, int msgoff, int rr, int off) - { - int n = (message.length < rr ? message.length : rr) + msgoff; - return ((off + 7 < n) ? ((int64)(message[off + 7] & 255) << 56) : 0L) | - ((off + 6 < n) ? ((int64)(message[off + 6] & 255) << 48) : 0L) | - ((off + 5 < n) ? ((int64)(message[off + 5] & 255) << 40) : 0L) | - ((off + 4 < n) ? ((int64)(message[off + 4] & 255) << 32) : 0L) | - ((off + 3 < n) ? ((int64)(message[off + 3] & 255) << 24) : 0L) | - ((off + 2 < n) ? ((int64)(message[off + 2] & 255) << 16) : 0L) | - ((off + 1 < n) ? ((int64)(message[off + 1] & 255) << 8) : 0L) | - ((off < n) ? ((int64)(message[off ] & 255) ) : 0L); - } - - - /** - * pad 10*1 - * - * @param msg The message to pad - * @parm len The length of the message - * @param r The bitrate - * @return The message padded - */ - private uint8[] pad10star1(uint8[] msg, int len, int r) - { - int nrf = (len <<= 3) >> 3; - int nbrf = len & 7; - int ll = len % r; - - uint8 b = (uint8)(nbrf == 0 ? 1 : ((msg[nrf] >> (8 - nbrf)) | (1 << nbrf))); - - uint8[] message; - if ((r - 8 <= ll) && (ll <= r - 2)) - { - message = new uint8[len = nrf + 1]; - message[nrf] = (uint8)(b ^ 128); - } - else - { - len = (nrf + 1) << 3; - len = ((len - (len % r) + (r - 8)) >> 3) + 1; - message = new uint8[len]; - message[nrf] = b; - message[len - 1] = (uint8)(-128); - } - arraycopy(msg, 0, message, 0, nrf); - - return message; - } - - - /** - * Initialise Keccak sponge - * - * @param r The bitrate - * @param c The capacity - * @param n The output size - */ - public void initialise(int r, int c, int n) - { - this.r = r; - this.c = c; - this.n = n; - this.b = r + c; - this.w = this.b / 25; - this.l = this.lb(this.w); - this.nr = 12 + (this.l << 1); - this.wmod = w == 64 ? -1L : (1L << this.w) - 1L; - this.S = new int64[25]; - this.M = new uint8[(this.r * this.b) >> 2]; - this.mptr = 0; - } - - - /** - * Absorb the more of the message message to the Keccak sponge - * - * @param msg The partial message - * @param msglen The length of the partial message - */ - public void update(uint8[] msg, int msglen) - { - int rr = this.r >> 3; - int ww = this.w >> 3; - - if (this.mptr + msglen > this.M.length) - arraycopy(this.M, 0, this.M = new uint8[(this.M.length + msglen) << 1], 0, this.mptr); - arraycopy(msg, 0, this.M, this.mptr, msglen); - int len = this.mptr += msglen; - len -= len % ((this.r * this.b) >> 3); - uint8[] message; - arraycopy(this.M, 0, message = new uint8[len], 0, len); - arraycopy(this.M, len, this.M, 0, this.mptr -= len); - - /* Absorbing phase */ - if (ww == 8) - for (int i = 0; i < len; i += rr) - { - this.S[ 0] ^= this.toLane64(message, i, rr, i + 0); - this.S[ 5] ^= this.toLane64(message, i, rr, i + 8); - this.S[10] ^= this.toLane64(message, i, rr, i + 16); - this.S[15] ^= this.toLane64(message, i, rr, i + 24); - this.S[20] ^= this.toLane64(message, i, rr, i + 32); - this.S[ 1] ^= this.toLane64(message, i, rr, i + 40); - this.S[ 6] ^= this.toLane64(message, i, rr, i + 48); - this.S[11] ^= this.toLane64(message, i, rr, i + 56); - this.S[16] ^= this.toLane64(message, i, rr, i + 64); - this.S[21] ^= this.toLane64(message, i, rr, i + 72); - this.S[ 2] ^= this.toLane64(message, i, rr, i + 80); - this.S[ 7] ^= this.toLane64(message, i, rr, i + 88); - this.S[12] ^= this.toLane64(message, i, rr, i + 96); - this.S[17] ^= this.toLane64(message, i, rr, i + 104); - this.S[22] ^= this.toLane64(message, i, rr, i + 112); - this.S[ 3] ^= this.toLane64(message, i, rr, i + 120); - this.S[ 8] ^= this.toLane64(message, i, rr, i + 128); - this.S[13] ^= this.toLane64(message, i, rr, i + 136); - this.S[18] ^= this.toLane64(message, i, rr, i + 144); - this.S[23] ^= this.toLane64(message, i, rr, i + 152); - this.S[ 4] ^= this.toLane64(message, i, rr, i + 160); - this.S[ 9] ^= this.toLane64(message, i, rr, i + 168); - this.S[14] ^= this.toLane64(message, i, rr, i + 176); - this.S[19] ^= this.toLane64(message, i, rr, i + 184); - this.S[24] ^= this.toLane64(message, i, rr, i + 192); - this.keccakF(this.S); - } - else - for (int i = 0; i < len; i += rr) - { - this.S[ 0] ^= this.toLane(message, i, rr, ww, i + 0 ); - this.S[ 5] ^= this.toLane(message, i, rr, ww, i + w); - this.S[10] ^= this.toLane(message, i, rr, ww, i + 2 * w); - this.S[15] ^= this.toLane(message, i, rr, ww, i + 3 * w); - this.S[20] ^= this.toLane(message, i, rr, ww, i + 4 * w); - this.S[ 1] ^= this.toLane(message, i, rr, ww, i + 5 * w); - this.S[ 6] ^= this.toLane(message, i, rr, ww, i + 6 * w); - this.S[11] ^= this.toLane(message, i, rr, ww, i + 7 * w); - this.S[16] ^= this.toLane(message, i, rr, ww, i + 8 * w); - this.S[21] ^= this.toLane(message, i, rr, ww, i + 9 * w); - this.S[ 2] ^= this.toLane(message, i, rr, ww, i + 10 * w); - this.S[ 7] ^= this.toLane(message, i, rr, ww, i + 11 * w); - this.S[12] ^= this.toLane(message, i, rr, ww, i + 12 * w); - this.S[17] ^= this.toLane(message, i, rr, ww, i + 13 * w); - this.S[22] ^= this.toLane(message, i, rr, ww, i + 14 * w); - this.S[ 3] ^= this.toLane(message, i, rr, ww, i + 15 * w); - this.S[ 8] ^= this.toLane(message, i, rr, ww, i + 16 * w); - this.S[13] ^= this.toLane(message, i, rr, ww, i + 17 * w); - this.S[18] ^= this.toLane(message, i, rr, ww, i + 18 * w); - this.S[23] ^= this.toLane(message, i, rr, ww, i + 19 * w); - this.S[ 4] ^= this.toLane(message, i, rr, ww, i + 20 * w); - this.S[ 9] ^= this.toLane(message, i, rr, ww, i + 21 * w); - this.S[14] ^= this.toLane(message, i, rr, ww, i + 22 * w); - this.S[19] ^= this.toLane(message, i, rr, ww, i + 23 * w); - this.S[24] ^= this.toLane(message, i, rr, ww, i + 24 * w); - this.keccakF(this.S); - } - } - - - /** - * Absorb the last part of the message and squeeze the Keccak sponge - * - * @param msg The rest of the message - * @param msglen The length of the partial message - */ - public uint8[] digest(uint8[]? msg, int msglen) - { - uint8[] message; - if ((msg == null) || (msglen == 0)) - message = this.pad10star1(this.M, this.mptr, this.r); - else - { - if (this.mptr + msglen > this.M.length) - arraycopy(this.M, 0, this.M = new uint8[this.M.length + msglen], 0, this.mptr); - arraycopy(msg, 0, this.M, this.mptr, msglen); - message = this.pad10star1(this.M, this.mptr + msglen, this.r); - } - this.M = null; - int len = message.length; - uint8[] rc = new uint8[(this.n + 7) >> 3]; - int ptr = 0; - - int rr = this.r >> 3; - int nn = (this.n + 7) >> 3; - int ww = this.w >> 3; - - /* Absorbing phase */ - if (ww == 8) - for (int i = 0; i < len; i += rr) - { - this.S[ 0] ^= this.toLane64(message, i, rr, i + 0); - this.S[ 5] ^= this.toLane64(message, i, rr, i + 8); - this.S[10] ^= this.toLane64(message, i, rr, i + 16); - this.S[15] ^= this.toLane64(message, i, rr, i + 24); - this.S[20] ^= this.toLane64(message, i, rr, i + 32); - this.S[ 1] ^= this.toLane64(message, i, rr, i + 40); - this.S[ 6] ^= this.toLane64(message, i, rr, i + 48); - this.S[11] ^= this.toLane64(message, i, rr, i + 56); - this.S[16] ^= this.toLane64(message, i, rr, i + 64); - this.S[21] ^= this.toLane64(message, i, rr, i + 72); - this.S[ 2] ^= this.toLane64(message, i, rr, i + 80); - this.S[ 7] ^= this.toLane64(message, i, rr, i + 88); - this.S[12] ^= this.toLane64(message, i, rr, i + 96); - this.S[17] ^= this.toLane64(message, i, rr, i + 104); - this.S[22] ^= this.toLane64(message, i, rr, i + 112); - this.S[ 3] ^= this.toLane64(message, i, rr, i + 120); - this.S[ 8] ^= this.toLane64(message, i, rr, i + 128); - this.S[13] ^= this.toLane64(message, i, rr, i + 136); - this.S[18] ^= this.toLane64(message, i, rr, i + 144); - this.S[23] ^= this.toLane64(message, i, rr, i + 152); - this.S[ 4] ^= this.toLane64(message, i, rr, i + 160); - this.S[ 9] ^= this.toLane64(message, i, rr, i + 168); - this.S[14] ^= this.toLane64(message, i, rr, i + 176); - this.S[19] ^= this.toLane64(message, i, rr, i + 184); - this.S[24] ^= this.toLane64(message, i, rr, i + 192); - this.keccakF(this.S); - } - else - for (int i = 0; i < len; i += rr) - { - this.S[ 0] ^= this.toLane(message, i, rr, ww, i + 0 ); - this.S[ 5] ^= this.toLane(message, i, rr, ww, i + w); - this.S[10] ^= this.toLane(message, i, rr, ww, i + 2 * w); - this.S[15] ^= this.toLane(message, i, rr, ww, i + 3 * w); - this.S[20] ^= this.toLane(message, i, rr, ww, i + 4 * w); - this.S[ 1] ^= this.toLane(message, i, rr, ww, i + 5 * w); - this.S[ 6] ^= this.toLane(message, i, rr, ww, i + 6 * w); - this.S[11] ^= this.toLane(message, i, rr, ww, i + 7 * w); - this.S[16] ^= this.toLane(message, i, rr, ww, i + 8 * w); - this.S[21] ^= this.toLane(message, i, rr, ww, i + 9 * w); - this.S[ 2] ^= this.toLane(message, i, rr, ww, i + 10 * w); - this.S[ 7] ^= this.toLane(message, i, rr, ww, i + 11 * w); - this.S[12] ^= this.toLane(message, i, rr, ww, i + 12 * w); - this.S[17] ^= this.toLane(message, i, rr, ww, i + 13 * w); - this.S[22] ^= this.toLane(message, i, rr, ww, i + 14 * w); - this.S[ 3] ^= this.toLane(message, i, rr, ww, i + 15 * w); - this.S[ 8] ^= this.toLane(message, i, rr, ww, i + 16 * w); - this.S[13] ^= this.toLane(message, i, rr, ww, i + 17 * w); - this.S[18] ^= this.toLane(message, i, rr, ww, i + 18 * w); - this.S[23] ^= this.toLane(message, i, rr, ww, i + 19 * w); - this.S[ 4] ^= this.toLane(message, i, rr, ww, i + 20 * w); - this.S[ 9] ^= this.toLane(message, i, rr, ww, i + 21 * w); - this.S[14] ^= this.toLane(message, i, rr, ww, i + 22 * w); - this.S[19] ^= this.toLane(message, i, rr, ww, i + 23 * w); - this.S[24] ^= this.toLane(message, i, rr, ww, i + 24 * w); - this.keccakF(this.S); - } - - /* Squeezing phase */ - int olen = this.n; - int j = 0; - int ni = 25 < rr ? 25 : rr; - while (olen > 0) - { - int i = 0; - while ((i < ni) && (j < nn)) - { - int64 v = this.S[(i % 5) * 5 + i / 5]; - for (int _ = 0; _ < ww; _++) - { - if (j < nn) - { - rc[ptr] = (uint8)v; - ptr += 1; - } - v >>= 8; - j += 1; - } - i += 1; - } - olen -= this.r; - if (olen > 0) - this.keccakF(S); - } - if ((n & 7) != 0) - rc[n >> 3] &= (1 << (n & 7)) - 1; - - return rc; - } - -} - - -/** - * This is the main entry point of the program - * - * @param args Command line arguments - */ -static int main(string[] cmdargs) -{ - string[] HEXADECA = {"0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "A", "B", "C", "D", "E", "F"}; - - string cmd = cmdargs[0]; - string[] argv = new string[cmdargs.length - 1]; - arraycopy_string(cmdargs, 1, argv, 0, argv.length); - - if (cmd.contains("/")) - cmd = cmd.substring(cmd.last_index_of("/") + 1); - if (cmd.has_suffix(".jar")) - cmd = cmd.substring(0, cmd.length - 4); - - int _o, o = _o = 512; /* --outputsize */ - if (cmd == "sha3-224sum") o = _o = 224; - else if (cmd == "sha3-256sum") o = _o = 256; - else if (cmd == "sha3-384sum") o = _o = 384; - else if (cmd == "sha3-512sum") o = _o = 512; - int _s, s = _s = 1600; /* --statesize */ - int _c, c = _c = s - (o << 1); /* --capacity */ - int _r, r = _r = s - c; /* --bitrate */ - int _w, w = _w = s / 25; /* --wordsize */ - int _i, i = _i = 1; /* --iterations */ - bool binary = false; - - string[] files = new string[argv.length + 1]; - int fptr = 0; - bool dashed = false; - string[] linger = null; - - string[] args = new string[argv.length + 1]; - arraycopy_string(argv, 0, args, 0, argv.length); - for (int a = 0, an = args.length; a < an; a++) - { string arg = args[a]; - if (linger != null) - { - if ((linger[0] == "-h") || (linger[0] == "--help")) - { - stdout.printf("\n"); - stdout.printf("SHA-3/Keccak checksum calculator\n"); - stdout.printf("\n"); - stdout.printf("USAGE: sha3sum [option...] < file\n"); - stdout.printf(" sha3sum [option...] file...\n"); - stdout.printf("\n"); - stdout.printf("\n"); - stdout.printf("OPTIONS:\n"); - stdout.printf(" -r BITRATE\n"); - stdout.printf(" --bitrate The bitrate to use for SHA-3. (default: %i)\n", _r); - stdout.printf(" \n"); - stdout.printf(" -c CAPACITY\n"); - stdout.printf(" --capacity The capacity to use for SHA-3. (default: %i)\n", _c); - stdout.printf(" \n"); - stdout.printf(" -w WORDSIZE\n"); - stdout.printf(" --wordsize The word size to use for SHA-3. (default: %i)\n", _w); - stdout.printf(" \n"); - stdout.printf(" -o OUTPUTSIZE\n"); - stdout.printf(" --outputsize The output size to use for SHA-3. (default: %i)\n", _o); - stdout.printf(" \n"); - stdout.printf(" -s STATESIZE\n"); - stdout.printf(" --statesize The state size to use for SHA-3. (default: %i)\n", _s); - stdout.printf(" \n"); - stdout.printf(" -i ITERATIONS\n"); - stdout.printf(" --iterations The number of hash iterations to run. (default: %i)\n", _i); - stdout.printf(" \n"); - stdout.printf(" -b\n"); - stdout.printf(" --binary Print the checksum in binary, rather than hexadecimal.\n"); - stdout.printf("\n"); - stdout.printf("\n"); - stdout.printf("COPYRIGHT:\n"); - stdout.printf("\n"); - stdout.printf("Copyright © 2013, 2014 Mattias Andrée (maandree@member.fsf.org)\n"); - stdout.printf("\n"); - stdout.printf("This program is free software: you can redistribute it and/or modify\n"); - stdout.printf("it under the terms of the GNU Affero General Public License as published by\n"); - stdout.printf("the Free Software Foundation, either version 3 of the License, or\n"); - stdout.printf("(at your option) any later version.\n"); - stdout.printf("\n"); - stdout.printf("This program is distributed in the hope that it will be useful,\n"); - stdout.printf("but WITHOUT ANY WARRANTY; without even the implied warranty of\n"); - stdout.printf("MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n"); - stdout.printf("GNU Affero General Public License for more details.\n"); - stdout.printf("\n"); - stdout.printf("You should have received a copy of the GNU Affero General Public License\n"); - stdout.printf("along with this program. If not, see <http://www.gnu.org/licenses/>.\n"); - stdout.printf("\n"); - return 2; - } - else - { - if (linger[1] == null) - { - linger[1] = arg; - arg = null; - } - if ((linger[0] == "-r") || (linger[0] == "--bitrate")) - o = (s - (r = int.parse(linger[1]))) >> 1; - else if ((linger[0] == "-c") || (linger[0] == "--capacity")) - r = s - (c = int.parse(linger[1])); - else if ((linger[0] == "-w") || (linger[0] == "--wordsize")) - s = (w = int.parse(linger[1])) * 25; - else if ((linger[0] == "-o") || (linger[0] == "--outputsize")) - r = s - ((o = int.parse(linger[1])) << 1); - else if ((linger[0] == "-s") || (linger[0] == "--statesize")) - r = (s = int.parse(linger[1])) - (o << 1); - else if ((linger[0] == "-i") || (linger[0] == "--iterations")) - i = int.parse(linger[1]); - else - { - stdout.printf("%s: unrecognised option: %s\n", cmd, linger[0]); - return 1; - } - } - linger = null; - if (arg == null) - continue; - } - if (arg == null) - continue; - if (dashed) - files[fptr++] = arg == "-" ? null : arg; - else if (arg == "--") - dashed = true; - else if (arg == "-") - files[fptr++] = null; - else if (arg.has_prefix("--")) - if (arg.contains("=")) - linger = new string[] { arg.substring(0, arg.index_of("=")), arg.substring(arg.index_of("=") + 1) }; - else - if (arg == "--binary") - binary = true; - else - linger = new string[] { arg, null }; - else if (arg.has_prefix("-")) - { - arg = arg.substring(1); - if (arg[0] == 'b') - { - binary = true; - arg = arg.substring(1); - } - else if (arg.length == 1) - linger = new string[] { "-" + arg, null }; - else - linger = new string[] { "-" + arg[0].to_string(), arg.substring(1) }; - } - else - files[fptr++] = arg; - } - - if (fptr == 0) - files[fptr++] = null; - if (i < 1) - { - stderr.printf("%s: sorry, I will only do at least one iteration!\n", cmd); - return 3; - } - - uint8[] stdin_ = null; - bool fail = false; - string filename; - - SHA3 sha3 = new SHA3(); - - for (int f = 0; f < fptr; f++) - { - if (((filename = files[f]) == null) && (stdin_ != null)) - { - stdout.write(stdin_, stdin_.length); - continue; - } - string rc = ""; - string fn = filename == null ? "/dev/stdin" : filename; - FileStream file = null; - try - { - file = FileStream.open(fn, "r"); - if (file == null) - { - stderr.printf("%s: cannot read file: %s\n", cmd, filename); - fail = true; - continue; - } - sha3.initialise(r, c, o); - int blksize = 4096; /** XXX os.stat(os.path.realpath(fn)).st_size; **/ - uint8[] chunk = new uint8[blksize]; - while (file.eof() == false) - { - int readn = (int)(file.read(chunk, blksize)); - sha3.update(chunk, readn); - } - uint8[] bs = sha3.digest(null, 0); - for (int _ = 1; _ < i; _++) - { - sha3.initialise(r, c, o); - bs = sha3.digest(bs, bs.length); - } - if (binary) - { if (filename == null) - stdin_ = bs; - stdout.write(bs, bs.length); - stdout.flush(); - } - else - { - for (int b = 0, bn = bs.length; b < bn; b++) - { - rc += HEXADECA[(bs[b] >> 4) & 15]; - rc += HEXADECA[bs[b] & 15]; - } - rc += " " + (filename == null ? "-" : filename) + "\n"; - if (filename == null) - stdin_ = (uint8[])(rc.to_utf8()); - stdout.printf("%s", rc); - stdout.flush(); - } - } - catch - { - stderr.printf("%s: cannot read file: %s\n", cmd, filename); - fail = true; - } - } - - stdout.flush(); - if (fail) - return 5; - - return 0; -} - - -/* P.S. I utterly hate Vala more than C++ and JavaScript combined. Happy Hearts and Hooves Day! */ - |