net.sourceforge.plantuml.argon2.algorithm.Functions Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of plantuml-lgpl Show documentation
PlantUML is a component that allows to quickly write diagrams from text.
There is a newer version: 1.2024.8
// THIS FILE HAS BEEN GENERATED BY A PREPROCESSOR.
/* +=======================================================================
 * |
 * |      PlantUML : a free UML diagram generator
 * |
 * +=======================================================================
 *
 * (C) Copyright 2009-2024, Arnaud Roques
 *
 * Project Info:  https://plantuml.com
 *
 * If you like this project or if you find it useful, you can support us at:
 *
 * https://plantuml.com/patreon (only 1$ per month!)
 * https://plantuml.com/liberapay (only 1€ per month!)
 * https://plantuml.com/paypal
 *
 *
 * PlantUML is free software; you can redistribute it and/or modify it
 * under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * PlantUML 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 Lesser General Public
 * License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this library.  If not, see .
 *
 * PlantUML can occasionally display sponsored or advertising messages. Those
 * messages are usually generated on welcome or error images and never on
 * functional diagrams.
 * See https://plantuml.com/professional if you want to remove them
 *
 * Images (whatever their format : PNG, SVG, EPS...) generated by running PlantUML
 * are owned by the author of their corresponding sources code (that is, their
 * textual description in PlantUML language). Those images are not covered by
 * this LGPL license.
 *
 * The generated images can then be used without any reference to the LGPL license.
 * It is not even necessary to stipulate that they have been generated with PlantUML,
 * although this will be appreciated by the PlantUML team.
 *
 * There is an exception : if the textual description in PlantUML language is also covered
 * by any license, then the generated images are logically covered
 * by the very same license.
 *
 * This is the IGY distribution (Install GraphViz by Yourself).
 * You have to install GraphViz and to setup the GRAPHVIZ_DOT environment variable
 * (see https://plantuml.com/graphviz-dot )
 *
 * Icons provided by OpenIconic :  https://useiconic.com/open
 * Archimate sprites provided by Archi :  http://www.archimatetool.com
 * Stdlib AWS provided by https://github.com/milo-minderbinder/AWS-PlantUML
 * Stdlib Icons provided https://github.com/tupadr3/plantuml-icon-font-sprites
 * ASCIIMathML (c) Peter Jipsen http://www.chapman.edu/~jipsen
 * ASCIIMathML (c) David Lippman http://www.pierce.ctc.edu/dlippman
 * CafeUndZopfli ported by Eugene Klyuchnikov https://github.com/eustas/CafeUndZopfli
 * Brotli (c) by the Brotli Authors https://github.com/google/brotli
 * Themes (c) by Brett Schwarz https://github.com/bschwarz/puml-themes
 * Twemoji (c) by Twitter at https://twemoji.twitter.com/
 *
 */
package net.sourceforge.plantuml.argon2.algorithm;

import static net.sourceforge.plantuml.argon2.Constants.ARGON2_BLOCK_SIZE;
import static net.sourceforge.plantuml.argon2.Constants.ARGON2_PREHASH_DIGEST_LENGTH;
import static net.sourceforge.plantuml.argon2.Constants.ARGON2_PREHASH_SEED_LENGTH;

import net.sourceforge.plantuml.argon2.Util;
import net.sourceforge.plantuml.argon2.blake2.Blake2b;
import net.sourceforge.plantuml.argon2.model.Block;

class Functions {

	/**
	 * H0 = H64(p, \u03c4, m, t, v, y, |P|, P, |S|, S, |L|, K, |X|, X) -> 64 byte
	 * (ARGON2_PREHASH_DIGEST_LENGTH)
	 */
	static byte[] initialHash(byte[] lanes, byte[] outputLength, byte[] memory, byte[] iterations, byte[] version,
			byte[] type, byte[] passwordLength, byte[] password, byte[] saltLength, byte[] salt, byte[] secretLength,
			byte[] secret, byte[] additionalLength, byte[] additional) {

		Blake2b.Param params = new Blake2b.Param().setDigestLength(ARGON2_PREHASH_DIGEST_LENGTH);

		final Blake2b blake2b = Blake2b.Digest.newInstance(params);

		blake2b.update(lanes);
		blake2b.update(outputLength);
		blake2b.update(memory);
		blake2b.update(iterations);
		blake2b.update(version);
		blake2b.update(type);

		blake2b.update(passwordLength);
		if (password != null) {
			blake2b.update(password);
		}

		blake2b.update(saltLength);
		if (salt != null) {
			blake2b.update(salt);
		}

		blake2b.update(secretLength);
		if (secret != null) {
			blake2b.update(secret);
		}

		blake2b.update(additionalLength);
		if (additional != null) {
			blake2b.update(additional);
		}

		byte[] blake2hash = blake2b.digest();
		assert (blake2hash.length == 64);

		return blake2hash;
	}

	/**
	 * H' - blake2bLong - variable length hash function
	 */
	static byte[] blake2bLong(byte[] input, int outputLength) {

		assert (input.length == ARGON2_PREHASH_SEED_LENGTH || input.length == ARGON2_BLOCK_SIZE);

		byte[] result = new byte[outputLength];
		byte[] outlenBytes = Util.intToLittleEndianBytes(outputLength);

		int blake2bLength = 64;

		if (outputLength <= blake2bLength) {
			result = blake2b(input, outlenBytes, outputLength);
		} else {
			byte[] outBuffer;

			/* V1 */
			outBuffer = blake2b(input, outlenBytes, blake2bLength);
			System.arraycopy(outBuffer, 0, result, 0, blake2bLength / 2);

			int r = (outputLength / 32) + (outputLength % 32 == 0 ? 0 : 1) - 2;

			int position = blake2bLength / 2;
			for (int i = 2; i <= r; i++, position += blake2bLength / 2) {
				/* V2 to Vr */
				outBuffer = blake2b(outBuffer, null, blake2bLength);
				System.arraycopy(outBuffer, 0, result, position, blake2bLength / 2);
			}

			int lastLength = outputLength - 32 * r;

			/* Vr+1 */
			outBuffer = blake2b(outBuffer, null, lastLength);
			System.arraycopy(outBuffer, 0, result, position, lastLength);
		}

		assert (result.length == outputLength);
		return result;
	}

	private static byte[] blake2b(byte[] input, byte[] outlenBytes, int outputLength) {
		Blake2b.Param params = new Blake2b.Param().setDigestLength(outputLength);

		final Blake2b blake2b = Blake2b.Digest.newInstance(params);

		if (outlenBytes != null)
			blake2b.update(outlenBytes);

		blake2b.update(input);

		return blake2b.digest();
	}

	static void roundFunction(Block block, int v0, int v1, int v2, int v3, int v4, int v5, int v6, int v7, int v8,
			int v9, int v10, int v11, int v12, int v13, int v14, int v15) {

		F(block, v0, v4, v8, v12);
		F(block, v1, v5, v9, v13);
		F(block, v2, v6, v10, v14);
		F(block, v3, v7, v11, v15);

		F(block, v0, v5, v10, v15);
		F(block, v1, v6, v11, v12);
		F(block, v2, v7, v8, v13);
		F(block, v3, v4, v9, v14);
	}

	private static void F(Block block, int a, int b, int c, int d) {
		fBlaMka(block, a, b);
		rotr64(block, d, a, 32);

		fBlaMka(block, c, d);
		rotr64(block, b, c, 24);

		fBlaMka(block, a, b);
		rotr64(block, d, a, 16);

		fBlaMka(block, c, d);
		rotr64(block, b, c, 63);
	}

	/* designed by the Lyra PHC team */
	/*
	 * a <- a + b + 2*aL*bL + == addition modulo 2^64 aL = least 32 bit
	 */
	private static void fBlaMka(Block block, int x, int y) {
		final long m = 0xFFFFFFFFL;
		final long xy = (block.v[x] & m) * (block.v[y] & m);

		block.v[x] = block.v[x] + block.v[y] + 2 * xy;
	}

	private static void rotr64(Block block, int v, int w, long c) {
		final long temp = block.v[v] ^ block.v[w];
		block.v[v] = (temp >>> c) | (temp << (64 - c));
	}
}