Volume Two is composed of two Issues: Numbers 1 and 2.
Their contents are detailed in the following sections.
|Featured Algorithm:||"Sub-Rosa Cryptosystem"|
|Diskettes:||One DS/HD 3.5" Diskette|
|Programs:||9,408 lines of Pascal in programs SUB-ROSA, LORENZ
337 lines of APL in the ECLIPSE Cryptosystem
102 lines of Assembler routines for SUB-ROSA
54 lines of Basic in the GF_TABLE program
|Number of pages in this issue:||123 including APL printouts|
|Date of Publication:||December 1989|
The SUB-ROSA cryptosystem "breaks" the 64KByte barrier for a crypto-key by utilizing extended memory (complete source code for the extended memory routines is provided of course). Crypto-keys in excess of 39,000,000 bits are supported (depending on the amount of memory in your PC). SUB-ROSA uses 32-bit Long-Integer arithmetic (which is equivalent to the intrinsic integer data type in most mainframe computers). We continue our investigation of Random Number Generators which began in Volume 1 Number 3. Part of the SUB-ROSA cryptosystem is a reusable Turbo Pascal unit which allows the user of a cryptosystem to select and combine a variety of random number generators.
With megabit crypto-keys, the traditional random number generator no longer suffices (they traditionally have a period of "only" 2^32 or less). We build and discuss an inexpensive prototype hardware-based random number generator (the RANGER device) which transmits pseudo-random numbers INTO the parallel port of a PC at a high rate of speed.
This issue also contains 25 pages of worked-through examples, explanations, and information about Galois Fields GF(p) and GF(q^n). I believe that the two complete worked-through examples are particularly valuable in explaining the mysteries of Galois Fields as applied to real cryptosystems. Also, an award-winning Lorenz Attractor program is included.
There are many other fascinating articles, including "Use a NSA Computer!".
|Featured Algorithm:||"SUMMIT Cryptosystem"|
|Diskettes:||1 DS/HD 3.5" Diskette|
|Programs:||16,754 lines of PASCAL in programs SUMMIT, BEST1,|
EULER3D, FREQ, HP_SINE, LIFE, LORENZ3D, MATH_SPD,
RANGER2, RANGER4, SZY, and SZY_HP
126 lines of Modula-2 in program EXAMPLE1
|Number of pages in this issue:||118|
|Date of Publication:||June 1992|
The SUMMIT cryptosystem implements 64-bit integer arithmetic via the COMP data type built into the 80x87 math coprocessor (or supported by software simulation if a math coprocessor is not present). Not even a Cray supercomputer's hardware fully supports 64-bit integer arithmetic! SUMMIT is extensible and can create 47,000,000 bit (and larger) crypto-keys! SUMMIT also allows long-running key- generations to check-pointed, suspended, and restarted at a later time based on timed, manual or automatic (via a BEST UPS) inputs. The RANGER device is significantly enhanced to include 16 crystal oscillators. Over 2 billion bits of the random bit stream which have been output by the enhanced RANGER device have been extensively tested against the statistical tests in the RANDTEST program to confirm that the enhanced RANGER Device produces unpredictable and statistically random bits. A schematic and Printed Circuit Board (PCB) layout for the enhanced RANGER device is included. The parts cost less than $40 to build the Enhanced RANGER Device, so it sets a new standard for fast, high- quality, hardware-based Random Number Generator (software can not generate true randomness). The award-winning Lorenz Attractor program is also enhanced to show true 3-D perspective and allow on- demand rotation around the X,Y, or Z axes (and allow high-resolution output on a HP laser printer). There are other articles covering security topics, chaos/dynamical systems, and computer graphics.
Copyright © 1996 Cryptosystems Journal.
Most recent update on 19-FEB-96.