Universal Key Management Package (Version YANT 7.1):

This is the latest upgraded version from "key Management Packages YANT Version 6.1". It l incorporate extra tools for generating random secret keys for public key systems (e.g. RSA). Public key systems are used frequently in authentication techniques; digital signatures and key encrypt cipher systems. More over the Universal Key Management Package will incorporate a software tool for distributing the key lists over multiple crypto user environments.

The available platforms to run this package are:

- Any Win9x, WinXP (home edition / professional edition), and Win2K (server / professional).

- 128MB RAM at least.

- 20 MB free HardDisk space.

- Pentium III.

Operational Specifications

1. Initialization Parameters

The Universal Key Management Package may enable the user to specify the initialization of the Linear Feedback Shift Registers (LFSRs) used in the key generation process. The package gives you the ability to initialize the LFSRs using one of two methods:

· Using Random Seed:

The random number the user may specify in the software package will be used as a seed parameter for a random generator function that will start generating random numbers based on this seed. The generated random numbers function as the initial values of the LFSRs.

· Using Initial State :

The initial state method requires the user to specify a string of characters that may be used internally by the package to fill up the initial states of the LFSRs.

Once the LFSRs are given initial values, the generator starts the key

generation process based on these initial values. Note that the same

initial values result in the generation of the same key list each time the

generator functions.

2. Secret Key Parameters

The Universal Key Management Packages provide two parameters for the keys:

· Single key length

This parameter requires that the user may specify the key length of each key he needs to generate. The key length is represented in bits.

· Number of generated key

This parameter refers to the number of generated keys in the Key List. Notice that each of the generated keys will have the same length as you may provide in the previous parameter.

3. Statistical Testing of Secret Keys

One of the main features of this key management package is the application of simple statistical testing to the materials of generated secret keys. This function allows the immediate testing of generated keys before the user may decide upon the validity of those generated keys, hence the user be sure of the quality of generated key lists. The simple statistical key tests used by this package, may be:

· Frequency test.

· Serial test.

· Poker test.

4- Re-initialization and Regeneration Process

The final result of each test may be given in the form of Pass /Fail. If any of the generated keys fails any of the above tests, then the user may do not accept the generated material. Consequently the application should restart the initialization and generation process again.

Re-initialization and re-generation will continue until a valid key list is generated.

5. Display& Save The Generated Keys

The generated key list may be displayed in two different formats, either in Binary Format or in ASCII Format. The user can easily select which display format is required for the generated key list. After the key list file is generated using the specified format. The user can simply save/edit or print the key list.

6. RSA Secret Key Generation:

Since the RSA is a public key algorithm which uses different keys for encryption and decryption operations, this package may generate the public and private keys required by the RSA algorithm. The RSA keys may be generated in a random way, each time the user generates a key, it will be different from the previous one. The keys generated can be copied through the application form or can be saved in a file in the location determined by the application user.

The application can generate lists of keys that may be stored in a file to be used in further operations with another application. The generated RSA keys may be as large as 1024 bits in length.

7. El-Gamal Secret Key Generation

El-Gamal is a public key algorithm, which also uses public and private key pair. The program generates the public and private keys required for El-Gamal algorithm. The program generates the key in a random way, each time the user generates a key, and it will be different from the previous one. The keys generated can be copied through the application form or can be saved in a file in the location determined by the application user.

The application can generate lists of keys that may be stored in a file to be used in further operations with another application using the El-Gamal algorithm.

See Online Demo