Docjar: A Java Source and Docuemnt Enginecom.*    java.*    javax.*    org.*    all    new    plug-in

Quick Search    Search Deep

gnu.javax.crypto.pad: Javadoc index of package gnu.javax.crypto.pad.


Package Samples:

gnu.javax.crypto.pad

Classes:

TLS1: The padding scheme used by the Transport Layer Security protocol, version 1. This padding scheme is used in the block-ciphered struct, e.g.: block-ciphered struct { opaque content[TLSCompressed.length]; opaque MAC[CipherSpec.hash_size]; uint8 padding[GenericBlockCipher.padding_length]; uint8 padding_length; } GenericBlockCipher; Where padding_length is any multiple of cipher_block_size - (( SSLCompressed.length + CipherSpec.hash_size ) % cipher_block_size ) - 1 that is less than 255. Every byte of the padding must be equal to padding_length . That is, the end of the plaintext is n + 1 copies of ...
SSL3: The padding scheme used by the Secure Sockets Layer, version 3. This padding scheme is used in the block-ciphered struct, e.g.: block-ciphered struct { opaque content[SSLCompressed.length]; opaque MAC[CipherSpec.hash_size]; uint8 padding[GenericBlockCipher.padding_length]; uint8 padding_length; } GenericBlockCipher; Where padding_length is cipher_block_size - (( SSLCompressed.length + CipherSpec.hash_size ) % cipher_block_size ) - 1. That is, the padding is enough bytes to make the plaintext a multiple of the block size minus one, plus one additional byte for the padding length. The padding can ...
TBC: The implementation of the Trailing Bit Complement (TBC) padding algorithm. In this mode, "...the data string is padded at the trailing end with the complement of the trailing bit of the unpadded message: if the trailing bit is 1 , then 0 bits are appended, and if the trailing bit is 0 , then 1 bits are appended. As few bits are added as are necessary to meet the formatting size requirement." References: Recommendation for Block Cipher Modes of Operation Methods and Techniques , Morris Dworkin.
PKCS7: The implementation of the PKCS7 padding algorithm. This algorithm is described for 8-byte blocks in [RFC-1423] and extended to block sizes of up to 256 bytes in [PKCS-7]. References: RFC-1423 : Privacy Enhancement for Internet Electronic Mail: Part III: Algorithms, Modes, and Identifiers. IETF . [PKCS-7] PKCS #7: Cryptographic Message Syntax Standard - An RSA Laboratories Technical Note. RSA Security .
PKCS1_V1_5: A padding algorithm implementation of the EME-PKCS1-V1.5 encoding/decoding algorithm as described in section 7.2 of RFC-3447. This is effectively an Adapter over an instance of gnu.java.security.sig.rsa.EME_PKCS1_V1_5 initialised with the RSA public shared modulus length (in bytes). References: Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1. Jakob Jonsson and Burt Kaliski.
IPad: The basic visible methods of any padding algorithm. Padding algorithms serve to pad and unpad byte arrays usually as the last step in an encryption or respectively a decryption operation. Their input buffers are usually those processed by instances of gnu.crypto.mode.IMode and/or gnu.crypto.cipher.IBlockCipher .
WrongPaddingException: A checked exception that indicates that a padding algorithm did not find the expected padding bytes when unpadding some data.
BasePad: An abstract class to facilitate implementing padding algorithms.
PadFactory: A Factory to instantiate padding schemes.

Home | Contact Us | Privacy Policy | Terms of Service