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

Quick Search    Search Deep

Page 1   2  
gnu.java.awt.* (167)gnu.java.beans.* (85)gnu.java.io.* (23)
gnu.java.lang.* (13)gnu.java.locale.* (284)gnu.java.math.* (1)
gnu.java.net.* (62)gnu.java.nio.* (98)gnu.java.rmi.* (40)
gnu.java.security.* (189)gnu.java.text.* (9)gnu.java.util.* (11)
gnu.javax.crypto.* (261)gnu.javax.imageio.* (25)gnu.javax.net.* (68)

Package Samples:

gnu.java.net.protocol.http.event: This package contains an HTTP/1.1 client, as described in RFC 2616.  
gnu.java.lang.reflect
gnu.java.rmi.dgc
gnu.java.awt.color
gnu.java.awt.peer.gtk
gnu.java.awt.peer
gnu.java.beans.decoder
gnu.java.net.protocol.jar
gnu.java.nio.channels
gnu.java.security.action
gnu.java.security.x509.ext
gnu.java.util.prefs
gnu.java.nio.charset.iconv
gnu.java.awt.peer.qt
gnu.java.net.local
gnu.java.rmi.activation
gnu.java.util.jar
gnu.java.awt
gnu.java.awt.image
gnu.java.beans

Classes:

ScanEngine: The ScanEngine is the main class of the backend of the XML persistence algorithm. It scans java.beans.Expression and java.beans.Statement instances and some raw objects via the writeObject(java.lang.Object) 55 method and feeds it to a state machine. The state machine then constructs and object tree which is finally written as XML by a Writer implementation. How does it work? The ScanEngine sits below the java.beans.XMLEncoder class and is called by it exclusively. The XMLEncoder sends interpretive data by invoking writeExpression(java.beans.Expression) 55 , writeStatement(java.beans.Statement) ...
OFB: The Output Feedback (OFB) mode is a confidentiality mode that requires a unique IV for every message that is ever encrypted under the given key. The OFB mode is defined as follows: OFB Encryption: I 1 = IV; I j = O j -1 for j = 2...n; O j = CIPH K (I j ) for j = 1, 2...n; C j = P j XOR O j for j = 1, 2...n. OFB Decryption: I 1 = IV; I j = O j -1 for j = 2...n; O j = CIPH K (I j ) for j = 1, 2...n; P j = C j XOR O j for j = 1, 2...n. In OFB encryption, the IV is transformed by the forward cipher function to produce the first output block. The first output block is exclusive-ORed with the first plaintext ...
UMac32: The implementation of the UMAC (Universal Message Authentication Code). The UMAC algorithms described are parameterized . This means that various low-level choices, like the endian convention and the underlying cryptographic primitive, have not been fixed. One must choose values for these parameters before the authentication tag generated by UMAC (for a given message, key, and nonce) becomes fully-defined. In this document we provide two collections of parameter settings, and have named the sets UMAC16 and UMAC32 . The parameter sets have been chosen based on experimentation and provide good performance ...
GThreadNativeMethodRunner: Implements pthread_create(), under glib's gthread abstraction, for use with GNU Classpath's --portable-native-sync option. This is used in gthread-jni.c Also implements a registry for threads, mapping Thread objects to small integers. The registry uses weak references for threads that aren't joinable, so that they will be garbage collected. There are a number of possible alternative implementations. The rest of this comment consists of an answer to a question that was raised on the commit-classpath mailing list: Mark Wielaard wrote: > Can't we assume that jobject and gpointer are both (void *) ...
GnuConfiguration: An implementation of the javax.security.auth.login.Configuration class which interprets JAAS Login Configuration files written in the default syntax described in the publicly available documentation of that class. A more formal definition of this syntax is as follows: CONFIG ::= APP_OR_OTHER_ENTRY+ APP_OR_OTHER_ENTRY ::= APP_NAME_OR_OTHER JAAS_CONFIG_BLOCK APP_NAME_OR_OTHER ::= APP_NAME | 'other' JAAS_CONFIG_BLOCK ::= '{' (LOGIN_MODULE_ENTRY ';')+ '}' ';' LOGIN_MODULE_ENTRY ::= MODULE_CLASS FLAG MODULE_OPTION* ';' FLAG ::= 'required' | 'requisite' | 'sufficient' | 'optional' MODULE_OPTION ::= PARAM_NAME ...
DSSSignature: The DSS (Digital Signature Standard) algorithm makes use of the following parameters: p: A prime modulus, where 2 L-1 < p < 2 L for 512 <= L <= 1024 and L a multiple of 64 . q: A prime divisor of p - 1 , where 2 159 < q < 2 160 . g: Where g = h (p-1) /q mod p , where h is any integer with 1 < h < p - 1 such that h (p-1) /q mod p > 1 ( g has order q mod p ). x: A randomly or pseudorandomly generated integer with 0 < x < q . y: y = g x mod p . k: A randomly or pseudorandomly generated integer with 0 < k < q . The integers p , q , and g can be public and can be ...
VirtualMachine: A virtual machine for interpreting TrueType bytecodes. Lack of Thread Safety: The virtual machine is intentionally not safe to access from multiple concurrent threads. Synchronization needs to be performed externally. Usually, the font has already obtained a lock before calling the scaler, which in turn calls the VM. It would be wasteful to acquire additional locks for the VM. Implementation Status: The current implementation can execute pre-programs of fonts, but it does not yet actually move any points. Control flow and arithmeti instructions are implemented, but most geometric instructions are ...
ICMGenerator: Counter Mode is a way to define a pseudorandom keystream generator using a block cipher. The keystream can be used for additive encryption, key derivation, or any other application requiring pseudorandom data. In ICM, the keystream is logically broken into segments. Each segment is identified with a segment index, and the segments have equal lengths. This segmentation makes ICM especially appropriate for securing packet-based protocols. This implementation adheres to the definition of the ICM keystream generation function that allows for any symetric key block cipher algorithm (initialisation parameter ...
PolicyFile: An implementation of a java.security.Policy object whose permissions are specified by a policy file . The approximate syntax of policy files is: policyFile ::= keystoreOrGrantEntries ; keystoreOrGrantEntries ::= keystoreOrGrantEntry | keystoreOrGrantEntries keystoreOrGrantEntry | EMPTY ; keystoreOrGrantEntry ::= keystoreEntry | grantEntry ; keystoreEntry ::= "keystore" keystoreUrl ';' | "keystore" keystoreUrl ',' keystoreAlgorithm ';' ; keystoreUrl ::= URL ; keystoreAlgorithm ::= STRING ; grantEntry ::= "grant" domainParameters '{' permissions '}' ';' domainParameters ::= domainParameter | domainParameter ...
Cast5: An implmenetation of the CAST5 (a.k.a. CAST-128) algorithm, as per RFC-2144 , dated May 1997. In this RFC, Carlisle Adams (the CA in CAST, ST stands for Stafford Tavares ) describes CAST5 as: "...a DES-like Substitution-Permutation Network (SPN) cryptosystem which appears to have good resistance to differential cryptanalysis, linear cryptanalysis, and related-key cryptanalysis. This cipher also possesses a number of other desirable cryptographic properties, including avalanche, Strict Avalanche Criterion (SAC), Bit Independence Criterion (BIC), no complementation property, and an absence of weak ...
UMacGenerator: KDF s (Key Derivation Functions) are used to stretch user-supplied key material to specific size(s) required by high level cryptographic primitives. Described in the UMAC paper, this function basically operates an underlying symmetric key block cipher instance in output feedback mode (OFB), as a strong pseudo-random number generator. UMacGenerator requires an index parameter (initialisation parameter gnu.crypto.prng.umac.kdf.index taken to be an instance of java.lang.Integer with a value between 0 and 255 ). Using the same key, but different indices, generates different pseudorandom outputs. This ...
ICM: An implementation of David McGrew Integer Counter Mode (ICM) as an IMode . ICM is a way to define a pseudorandom keystream generator using a block cipher. The keystream can be used for additive encryption, key derivation, or any other application requiring pseudorandom data. In the case of this class, it is used as additive encryption, XOR-ing the keystream with the input text --for both encryption and decryption. In ICM, the keystream is logically broken into segments. Each segment is identified with a segment index, and the segments have equal lengths. This segmentation makes ICM especially appropriate ...
Transformer: A Transformer is an abstract representation of a two-way transformation that can be chained together with other instances of this type. Examples of such transformations in this library are: Cascade cipher, gnu.crypto.pad.IPad algorithm, and a ZLib-based deflater/inflater algorithm. A special implementation of a Transformer to close a chain is also provided. A Transformer is characterised by the followings: It can be chained to other instances, to form an Assembly . When configured in an Assembly , it can be set to apply its internal transformation on the input data stream before (pre-processing) ...
Stage: A Stage in a Cascade Cipher. Each stage may be either an implementation of a Block Cipher Mode of Operation ( gnu.javax.crypto.mode.IMode ) or another Cascade Cipher ( Cascade ). Each stage has also a natural operational direction when constructed for inclusion within a Cascade . This natural direction dictates how data flows from one stage into another when stages are chained together in a cascade. One can think of a stage and its natural direction as the specification of how to wire the stage into the chain. The following diagrams may help understand the paradigme. The first shows two stages ...
IMac: The basic visible methods of any MAC (Message Authentication Code) algorithm. A MAC provides a way to check the integrity of information transmitted over, or stored in, an unreliable medium, based on a secret key. Typically, MAC s are used between two parties, that share a common secret key, in order to validate information transmitted between them. When a MAC algorithm is based on a cryptographic hash function, it is then called to a HMAC (Hashed Message Authentication Code) --see RFC-2104 . Another type of MAC algorithms exist: UMAC or Universal Message Authentication Code , described in draft-krovetz-umac-01.txt ...
IMode: The basic visible methods of any block cipher mode. Block ciphers encrypt plaintext in fixed size n-bit blocks. For messages larger than n bits, the simplest approach is to segment the message into n-bit blocks and process (encrypt and/or decrypt) each one separately (Electronic Codebook or ECB mode). But this approach has disadvantages in most applications. The block cipher modes of operations are one way of working around those disadvantages. A Mode always employs an underlying block cipher for processing its input. For all intents and purposes, a Mode appears to behave as any other block cipher ...
CALG: A Factory class that returns CALG (Confidentiality Algorithm) instances that operate as described in the draft-burdis-cat-sasl-srp-08. The designated CALG block cipher should be used in OFB (Output Feedback Block) mode in the ISO variant, as described in The Handbook of Applied Cryptography , algorithm 7.20. Let k be the block size of the chosen symmetric key block cipher algorithm; e.g. for AES this is 128 bits or 16 octets. The OFB mode used shall be of length/size k . It is recommended that block ciphers operating in OFB mode be used with an Initial Vector (the mode's IV). In such a mode of ...
ConfigFileParser: A parser that knows how to interpret JAAS Login Module Configuration files written in the default syntax which is interpreted as adhering to the following grammar: CONFIG ::= APP_OR_OTHER_ENTRY+ APP_OR_OTHER_ENTRY ::= APP_NAME_OR_OTHER JAAS_CONFIG_BLOCK APP_NAME_OR_OTHER ::= APP_NAME | 'other' JAAS_CONFIG_BLOCK ::= '{' (LOGIN_MODULE_ENTRY ';')+ '}' ';' LOGIN_MODULE_ENTRY ::= MODULE_CLASS FLAG MODULE_OPTION* ';' FLAG ::= 'required' | 'requisite' | 'sufficient' | 'optional' MODULE_OPTION ::= PARAM_NAME '=' PARAM_VALUE APP_NAME ::= JAVA_IDENTIFIER MODULE_CLASS ::= JAVA_IDENTIFIER ('.' JAVA_IDENTIFIER)* ...
ElGamalKeyAgreement: The ElGamal key agreement, also known as the half-certified Diffie-Hellman key agreement, is described in the Handbook of Applied Cryptography [HAC] as follows: A sends to B a single message allowing one-pass key agreement. A obtains an authentic copy of B's public key (p, g, yb), where yb = g**xb. A chooses a random integer x, 1 <= x <= p-2, and sends B the message g**x. A computes the shared secret key K as yb**x. B computes the same key K on receipt of the previous message as (g**x)**xb. RFC-2631 describes an Ephemeral-Static Mode of operations with Diffie-Hellman keypairs as follows: ...
IRandom: The basic visible methods of any pseudo-random number generator. The [HAC] defines a PRNG (as implemented in this library) as follows: "5.6 Definition: A pseudorandom bit generator (PRBG) is said to pass the next-bit test if there is no polynomial-time algorithm which, on input of the first L bits of an output sequence S , can predict the (L+1) st bit of S with a probability significantly grater than 1/2 ." "5.8 Definition: A PRBG that passes the next-bit test (possibly under some plausible but unproved mathematical assumption such as the intractability of factoring integers) is called a cryptographically ...
DiffieHellmanKeyAgreement: The basic version of the Diffie-Hellman key agreement is described in the Handbook of Applied Cryptography [HAC] as follows: An appropriate prime p and generator g of Z p * (2 <= g <= p-2) are selected and published. A and B each send the other one message over an open channel; as a result, they both can then compute a shared secret key K which they can use to protect their future communication. A chooses a random secret x, 1 <= x <= p-2, and sends B message (1) which is g^x mod p. B chooses a random secret y, 1 <= y <= p-2, and sends A message (2) which is g^y mod p. B receives ...
SwingComponentPeer: The base class for Swing based component peers. This provides the basic functionality needed for Swing based component peers. Many methods are implemented to forward to the Swing component. Others however forward to the component's parent and expect the toplevel component peer to provide a real implementation of it. These are for example the key methods getGraphics() 55 and createImage(int, int) 55 , as well as getLocationOnScreen() 55 . This class also provides the necesary hooks into the Swing painting and event handling system. In order to achieve this, it traps paint, mouse and key events in ...
UHash32: UHASH is a keyed hash function, which takes as input a string of arbitrary length, and produces as output a string of fixed length (such as 8 bytes). The actual output length depends on the parameter UMAC-OUTPUT-LEN. UHASH has been shown to be epsilon-ASU ("Almost Strongly Universal"), where epsilon is a small (parameter-dependent) real number. Informally, saying that a keyed hash function is epsilon-ASU means that for any two distinct fixed input strings, the two outputs of the hash function with a random key "look almost like a pair of random strings". The number epsilon measures how non-random ...
CharData: This contains the info about the unicode characters, that java.lang.Character needs. It is generated automatically from ../doc/unicode/UnicodeData-4.0.0.txt and ../doc/unicode/SpecialCasing-4.0.0.txt , by some perl scripts. These Unicode definition files can be found on the http://www.unicode.org website. JDK 1.5 uses Unicode version 4.0.0. The data is stored as string constants, but Character will convert these Strings to their respective char[] components. The fields are stored in arrays of 17 elements each, one element per Unicode plane. BLOCKS stores the offset of a block of 2 SHIFT characters ...
IBlockCipher: The basic visible methods of any symmetric key block cipher. A symmetric key block cipher is a function that maps n-bit plaintext blocks to n-bit ciphertext blocks; n being the cipher's block size . This encryption function is parameterised by a k-bit key, and is invertible. Its inverse is the decryption function. Possible initialisation values for an instance of this type are: The block size in which to operate this block cipher instance. This value is optional , if unspecified, the block cipher's default block size shall be used. The byte array containing the user supplied key material to use ...

Home | Contact Us | Privacy Policy | Terms of Service