org.bouncycastle.pqc.crypto.xmss.LTreeAddress Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of bcprov-ext-debug-jdk15on Show documentation

The Bouncy Castle Crypto package is a Java implementation of cryptographic algorithms. This jar contains JCE provider and lightweight API for the Bouncy Castle Cryptography APIs for JDK 1.5 to JDK 1.8 with debug enabled.

There is a newer version: 1.70

Show newest version

package org.bouncycastle.pqc.crypto.xmss;

import org.bouncycastle.util.Pack;

/**
 * L-tree address.
 *
 */
final class LTreeAddress extends XMSSAddress {

	private static final int TYPE = 0x01;
	
	private final int lTreeAddress;
	private final int treeHeight;
	private final int treeIndex;

	private LTreeAddress(Builder builder) {
		super(builder);
		lTreeAddress = builder.lTreeAddress;
		treeHeight = builder.treeHeight;
		treeIndex = builder.treeIndex;
	}
	
	protected static class Builder extends XMSSAddress.Builder {

		/* optional */
		private int lTreeAddress = 0;
		private int treeHeight = 0;
		private int treeIndex = 0;

		protected Builder() {
			super(TYPE);
		}
		
		protected Builder withLTreeAddress(int val) {
			lTreeAddress = val;
			return this;
		}
		
		protected Builder withTreeHeight(int val) {
			treeHeight = val;
			return this;
		}
		
		protected Builder withTreeIndex(int val) {
			treeIndex = val;
			return this;
		}
		
		@Override
		protected XMSSAddress build() {
			return new LTreeAddress(this);
		}

		@Override
		protected Builder getThis() {
			return this;
		}
	}

	@Override
	protected byte[] toByteArray() {
		byte[] byteRepresentation = super.toByteArray();
		Pack.intToBigEndian(lTreeAddress, byteRepresentation, 16);
		Pack.intToBigEndian(treeHeight, byteRepresentation, 20);
		Pack.intToBigEndian(treeIndex, byteRepresentation, 24);
		return byteRepresentation;
	}

	protected int getLTreeAddress() {
		return lTreeAddress;
	}
	
	protected int getTreeHeight() {
		return treeHeight;
	}
	
	protected int getTreeIndex() {
		return treeIndex;
	}
}