Home >> All >> com >> ssttr

•	com.ssttr.crypto.* (7)	•	com.ssttr.util.* (13)	•	com.ssttr.util.processor.* (4)
•	com.ssttr.xml.* (6)

Package Samples:

• com.ssttr.xml
• com.ssttr.util.processor
• com.ssttr.util
• com.ssttr.crypto

Classes:

• DH: This class performs the basic essential functions for Diffie-Hellman key genereration. Specifily, given a generator (g), exponent (x), and prime modulus (m), it performs: g x mod m . Of course this could also be done just as easily with the java.math.BigInteger.modPow() method, but that class is rarely included in J2ME and embeded JVMs this can still be usefull. It is worth noting that this class has been tested to reliably work on key sizes >= 64 bits. It will often fail on a keys To generate a shared private key: Jack performs: int keySize = 128; DH dh = new DH(keySize); Random rnd = new Random(); ...
• TEA: This is a 100% Pure Java implementation of the Tiny Encryption Algorithm which can be found http://vader.brad.ac.uk/tea/tea.shtml . Or at least that's where I originaly found it. It appears that it is still available here: http://www.simonshepherd.supanet.com/tea.htm . TEA is only capable of using 128 bit keys. If any other key length is desired you will have to pad or chop (as appropriate) the key to be 128 bits long. It was ported from the ANSI C new variant http://vader.brad.ac.uk/tea/source.shtml#new_ansi . As I mentioned above, that page seems to have disappeard, so here's the new equivelent: ...
• Base64: Encodes and decodes to and from Base64 notation. Change Log: v1.3.6 - Fixed OutputStream.flush() so that 'position' is reset. v1.3.5 - Added flag to turn on and off line breaks. Fixed bug in input stream where last buffer being read, if not completely full, was not returned. v1.3.4 - Fixed when "improperly padded stream" error was thrown at the wrong time. v1.3.3 - Fixed I/O streams which were totally messed up. I am placing this code in the Public Domain. Do with it as you will. This software comes with no guarantees or warranties but with plenty of well-wishing instead! Please visit http://iharder.net/xmlizable ...
• MessageDigest: The MessageDigest class defines a general class for computing digest functions. It is defined as an abstract class that is subclassed by message digest algorithms. In this way the PKCS classes can be built to take a MessageDigest object without needing to know what 'kind' of message digest they are computing. This class defines the standard functions that all message digest algorithms share, and ways to put all Java fundamental types into the digest. It does not define methods for digestifying either arbitrary objects or arrays of objects however.
• SAXParser: Currently supported tags: comments with ANY data in between the <!-- and --> full character data with ANY data between <![CDATA[ and ]]> Currently UNsupported tags: DTD elements (ie: !DOCTYPE, !ELEMENT, & !ATTLIST). These are treated like extended character data (<![CDATA ]]>) tags Currently supported entities: all standard XML entities ( < > " ' and & ). all other entities are left alone Performs validataion on most elements
• QueueProcessor: A QueueProcessor has a fixed number of task processors available. If all processors are in use, and it is asked to process another task, it will simply put the task into a FIFO queue to be processed as soon as a processor becomes available.
• Processor: This is a basic interface for various task processors. A task processor simply accepts a task (a java.lang.Runnable ) and attempts to execute it. The precice behavior of the Processor is not defined here.
• MD5: The MD5 class is used to compute an MD5 message digest over a given buffer of bytes. It is an implementation of the RSA Data Security Inc MD5 algorithim as described in internet RFC 1321.
• MD2: The MD2 class is used to compute an MD2 message digest over a given buffer of bytes. It is an implementation of the RSA Data Security Inc MD2 algorithim as described in internet RFC 1319.
• PoolProcessor: A PoolProcessor has a fixed number of task processors available. If the pool is full, then no more tasks can be processed untill another task is finished and leaves.
• ObjectFactory: A simple interface for an factory-pattern to create new Object s. See ObjectCache for an example of its usage.
• SHA1: This is a simple port of Steve Reid's SHA-1 code into Java. I've run his test vectors through the code and they all pass.
• ObjectCache: Implements a simple Object cache based on a WeakHashMap .
• AbstractProcessor: This class implements the features standard to many other ProcessorS.
• ObjectPool: A simple class that implements a pool of Object s.
• SKEncryption
• EventListener
• Strings
• IllegalPropertyNameException
• EventMultiplexer
• Configuration

Home | Contact Us | Privacy Policy | Terms of Service