Reference Guide

Acronyms 43
RSA BSAFE Crypto-J JSAFE and JCE Software Module 6.2.5 Security Policy Level 1
with Level 2 Roles, Services and Authentication
PC Personal Computer.
Poly1305 A cryptographic MAC standardized in RFC 7539
.
private key The secret key in public key cryptography. Primarily used for decryption
but also used for encryption with digital signatures.
PRNG Pseudo-random Number Generator.
RC2 Block cipher developed by Ron Rivest as an alternative to the DES. It has
a block size of 64 bits and a variable key size. It is a legacy cipher and
RC5 should be used in preference.
RC4 Symmetric algorithm designed by Ron Rivest using variable length keys
(usually 40 bit or 128 bit).
RC5 Block cipher designed by Ron Rivest. It is parameterizable in its word
size, key length and number of rounds. Typical use involves a block size
of 64 bits, a key size of 128 bits and either 16 or 20 iterations of its round
function.
RNG Random Number Generator.
RSA Public key (asymmetric) algorithm providing the ability to encrypt data
and create and verify digital signatures. RSA stands for Rivest, Shamir,
and Adleman, the developers of the RSA public key crypto-system.
SHA Secure Hash Algorithm. An algorithm which creates a hash value for
each possible input. SHA takes an arbitrary input which is hashed into a
160-bit digest.
SHA-1 A revision to SHA to correct a weakness. It produces 160-bit digests.
SHA-1 takes an arbitrary input which is hashed into a 20-byte digest.
SHA-2 The NIST-mandated successor to SHA-1, to complement the Advanced
Encryption Standard. It is a family of hash algorithms (SHA-256,
SHA-384 and SHA-512) which produce digests of 256, 384 and 512 bits
respectively.
SHA-3 A family of hash algorithms which includes SHA3-224, SHA3-256,
SHA3-384 and SHA3-512. It also includes the extendable-output
functions SHAKE128 and SHAKE256. SHA-3 is an alternative to
SHA-2, as no significant attacks on SHA-2 are currently known.
Shamir Secret
Sharing
A form of secret sharing where a secret is divided into parts, and each
participant is given a unique part. Some or all of the parts are needed to
reconstruct the secret. This is also known as a (
k,n) threshold scheme
where any
k of the n parts are sufficient to reconstruct the original secret.
Table 15 Acronyms used with the JCM (continued)
Acronym Definition