/openjdk10/jdk/src/java.base/share/classes/java/security/spec/ |
H A D | RSAPrivateKeySpec.java | 47 private BigInteger modulus; field in class:RSAPrivateKeySpec 53 * @param modulus the modulus 56 public RSAPrivateKeySpec(BigInteger modulus, BigInteger privateExponent) { argument 57 this.modulus = modulus; 62 * Returns the modulus. 64 * @return the modulus 67 return this.modulus;
|
H A D | RSAPublicKeySpec.java | 47 private BigInteger modulus; field in class:RSAPublicKeySpec 53 * @param modulus the modulus 56 public RSAPublicKeySpec(BigInteger modulus, BigInteger publicExponent) { argument 57 this.modulus = modulus; 62 * Returns the modulus. 64 * @return the modulus 67 return this.modulus;
|
H A D | RSAPrivateCrtKeySpec.java | 60 * given the modulus, publicExponent, privateExponent, 64 * @param modulus the modulus n 74 public RSAPrivateCrtKeySpec(BigInteger modulus, argument 82 super(modulus, privateExponent);
|
H A D | RSAMultiPrimePrivateCrtKeySpec.java | 61 * given the modulus, publicExponent, privateExponent, 69 * @param modulus the modulus n. 81 * {@code modulus}, 89 public RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus, argument 98 super(modulus, privateExponent); 99 if (modulus == null) { 100 throw new NullPointerException("the modulus parameter must be " +
|
/openjdk10/jdk/test/sanity/client/lib/SwingSet3/src/com/sun/swingset3/demos/list/ |
H A D | Permuter.java | 38 private int modulus; field in class:Permuter 54 modulus = n; 74 return (multiplier * i + ADDEND) % modulus; 90 * Simple test. Takes modulus on command line and prints out permutation. 93 int modulus = Integer.parseInt(args[0]); 94 Permuter p = new Permuter(modulus); 95 for (int i = 0; i < modulus; i++) {
|
/openjdk10/hotspot/src/cpu/zero/vm/ |
H A D | assembler_zero.cpp | 61 void MacroAssembler::align(int modulus) { argument 62 while (offset() % modulus != 0)
|
H A D | assembler_zero.hpp | 47 void align(int modulus);
|
/openjdk10/jdk/src/java.base/share/classes/sun/security/ssl/ |
H A D | DHCrypt.java | 46 * called the shared secret. It has the same length as the modulus, e.g. 512 59 * . if we are client, call DHCrypt(modulus, base, random). This 80 // group parameters (prime modulus and generator) 81 private BigInteger modulus; // P (aka N) field in class:DHCrypt 104 * @param modulus the Diffie-Hellman modulus P 107 DHCrypt(BigInteger modulus, BigInteger base, SecureRandom random) { argument 108 this(modulus.bitLength(), 109 new DHParameterSpec(modulus, base), random); 141 modulus [all...] |
H A D | JsseJce.java | 334 BigInteger modulus; 336 modulus = ((RSAPublicKey)key).getModulus(); 339 modulus = spec.getModulus(); 341 return modulus.bitLength();
|
/openjdk10/jdk/src/jdk.crypto.mscapi/windows/classes/sun/security/mscapi/ |
H A D | RSAPublicKey.java | 46 private BigInteger modulus = null; field in class:RSAPublicKey 90 .append("]\n modulus: ").append(getModulus()) 116 * Returns the modulus. 120 if (modulus == null) { 124 modulus = new BigInteger(1, getModulus(publicKeyBlob)); 131 return modulus; 196 * Returns the key's modulus (in big-endian 2's complement format).
|
H A D | RSASignature.java | 248 BigInteger modulus = rsaKey.getModulus(); 253 RSAKeyFactory.checkKeyLengths(((modulus.bitLength() + 7) & ~7), 256 byte[] modulusBytes = modulus.toByteArray(); 515 int keyBitLength, byte[] modulus, byte[] publicExponent) 514 generatePublicKeyBlob( int keyBitLength, byte[] modulus, byte[] publicExponent) argument
|
H A D | RSACipher.java | 217 BigInteger modulus = rsaKey.getModulus(); 222 RSAKeyFactory.checkKeyLengths(((modulus.bitLength() + 7) & ~7), 225 byte[] modulusBytes = modulus.toByteArray();
|
/openjdk10/nashorn/test/script/maptests/ |
H A D | point.js | 37 Point.prototype.modulus = function() {
|
/openjdk10/jdk/src/java.management/share/classes/javax/management/monitor/ |
H A D | CounterMonitor.java | 54 * <P> If the counter can wrap around its maximum value, the modulus 55 * needs to be specified. The modulus is the value at which the 62 * value of the modulus. The derived gauge value (V[t]) is calculated 157 * Counter modulus. 160 private Number modulus = INTEGER_ZERO; field in class:CounterMonitor 306 // maximum value, then the modulus value needs to be set to that 308 // it strictly exceeds the modulus value. When the threshold rolls 314 modulus.longValue() > 0L && 315 o.getThreshold().longValue() > modulus.longValue()) { 486 * Gets the modulus valu [all...] |
/openjdk10/jdk/test/javax/management/monitor/ |
H A D | CounterMonitorTest.java | 44 // modulus number 45 private Number modulus = new Integer(7); field in class:CounterMonitorTest 161 counterMonitor.setModulus(modulus); 162 echo("\tATTRIBUTE \"Modulus\" = " + modulus);
|
/openjdk10/jdk/src/java.xml.crypto/share/classes/com/sun/org/apache/xml/internal/security/keys/content/keyvalues/ |
H A D | RSAKeyValue.java | 59 * @param modulus 62 public RSAKeyValue(Document doc, BigInteger modulus, BigInteger exponent) { argument 66 this.addBigIntegerElement(modulus, Constants._TAG_MODULUS);
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir.amd64/src/org/graalvm/compiler/lir/amd64/ |
H A D | AMD64Call.java | 209 int modulus = crb.target.wordSize; 210 if (offset % modulus != 0) { 211 masm.nop(modulus - offset % modulus);
|
/openjdk10/jdk/src/java.base/share/classes/com/sun/crypto/provider/ |
H A D | DHKeyAgreement.java | 292 BigInteger modulus = init_p; 293 int expectedLen = (modulus.bitLength() + 7) >>> 3; 317 byte[] secret = this.y.modPow(this.x, modulus).toByteArray();
|
/openjdk10/jdk/src/java.base/share/classes/java/util/ |
H A D | ArrayDeque.java | 214 * Increments i, mod modulus. 215 * Precondition and postcondition: 0 <= i < modulus. 217 static final int inc(int i, int modulus) { argument 218 if (++i >= modulus) i = 0; 223 * Decrements i, mod modulus. 224 * Precondition and postcondition: 0 <= i < modulus. 226 static final int dec(int i, int modulus) { argument 227 if (--i < 0) i = modulus - 1; 232 * Circularly adds the given distance to index i, mod modulus. 233 * Precondition: 0 <= i < modulus, 236 add(int i, int distance, int modulus) argument 248 sub(int i, int j, int modulus) argument [all...] |
/openjdk10/jdk/test/java/security/KeyFactory/ |
H A D | GenerateRSAPrivateCrtKey.java | 44 new RSAPrivateCrtKeySpec(new BigInteger(1, modulus), 74 throw new Exception("modulus not equal"); 92 static byte[] modulus = { field in class:GenerateRSAPrivateCrtKey
|
/openjdk10/jdk/test/sun/security/ssl/ClientHandshaker/ |
H A D | RSAExport.java | 63 * modulus: 285 static byte modulus[] = { field in class:RSAExport 535 new BigInteger(modulus),
|
/openjdk10/jdk/src/java.xml.crypto/share/classes/org/jcp/xml/dsig/internal/dom/ |
H A D | DOMKeyValue.java | 177 private DOMCryptoBinary modulus, exponent; field in class:DOMKeyValue.RSA 184 modulus = new DOMCryptoBinary(rkey.getModulus()); 202 modulus.marshal(modulusElem, dsPrefix, context); 222 modulus = new DOMCryptoBinary(modulusElem.getFirstChild()); 226 RSAPublicKeySpec spec = new RSAPublicKeySpec(modulus.getBigNum(),
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.asm/src/org/graalvm/compiler/asm/ |
H A D | Assembler.java | 161 public abstract void align(int modulus); argument
|
/openjdk10/hotspot/src/cpu/ppc/vm/ |
H A D | macroAssembler_ppc.inline.hpp | 53 inline void MacroAssembler::round_to(Register r, int modulus) { argument 54 assert(is_power_of_2_long((jlong)modulus), "must be power of 2"); 55 addi(r, r, modulus-1); 56 clrrdi(r, r, log2_long((jlong)modulus));
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.asm.sparc/src/org/graalvm/compiler/asm/sparc/ |
H A D | SPARCMacroAssembler.java | 72 public void align(int modulus) { argument 73 while (position() % modulus != 0) {
|