The document describes a statistical pattern generator and mathematical trend analyzer called COMP-U-STAT. It consists of over 3470 modular programs to generate novel statistical patterns and analyze trends from random variables. The document provides an abstract for programs 2593 through 2596, which relate to alphanumeric and non-alphanumeric encryption and decryption algorithms using techniques like congruences and binary addition modulo 2.

1. COMP-U-STAT
STATISTICAL PATTERN GENERATOR AND MATHEMATICAL TREND ANALYZER
(c) Copyright 2015 by James Ervin Glover, Ph.D.
All Rights Reserved
Part VII(b) ( STAT 2593 ----> STAT 2596 )
The COMP-U-STAT System consists of a cluster of more than 3470
modular programs, providing the analyst with a clear and distinct
scientific and mathematical edge in generating novel and useful
statistical patterns for analyzing trends from random variables.
The following is a glossary describing the functions of all
routines in the sequence. There are many statistical applications
of the COMP-U-STAT cluster. The serious analyst is herein presented
a blueprint for a strictly scientific approach to analyzing and
solving a series of these veru fascinating and challenging problems.
=========================================================================
* * * ABSTRACTS OF COMP-U-STAT PROGRAMS 2593 ---> 2596 * * *
=========================================================================
-- L 2593 --
( ALPHANUMERIC ENCRYPTION ALGORITHM )
I
( STAT2593 ENCRYPTS AN ALPHANUMERIC FILE WITH LINES OF
LENGTH 72 CHARACTERS FROM PLAINTEXT TO CIPHERTEXT )
STAT2593 READS AN ALPHANUMERIC FILE FROM STAT2495.INP, A PRIVATE
KEY FROM STAT2594.KEY (PROVIDED BY THE TRANSMITTER TO THE USER),
UTILIZING AN INTERNALLY CREATED ALGORITHM TO ENCRYPT THE FILE FOR
SECURITY PURPOSES. EACH LINE OF STAT2594.INP IS RESTRICTED TO 72
CHARACTERS. THE ENCRYPTED OUPUT FILE IS RECORDED AS STAT2594.OUT,
UTILIZING THE CONGRUENCES C1 = aP1 + bP2 (mod 51) AND
C2 = cP1 + dP2 (mod 51) TO CONVERT CHARACTER BLOCKS OF SIZE n = 2
WITH, E.G., a = 2 , b = 3 , c = 5 AND d = 8 TO CONVERT 2-ELEMENT
STRINGS FROM PLAINTEXT TO CIPHERTEXT, WITH gcd(ad-bc,51) = 1. THUS
(ad-bc) AND 51 ARE TAKEN TO BE RELATIVELY PRIME FOR THE 26 INPUT
ALPHABETIC CHARACTERS, A ---> Z, IN UNION WITH A BLANK CHARACTER,
DIGITS 0 --> 9, AND A SELECTED SEQUENCE OF SPECIAL CHARACTERS.
=========================================================================
-- L 2594 --
( ALPHANUMERIC DECRYPTION ALGORITHM )
II
( STAT2594 DECRYPTS AN ALPHANUMERIC FILE WITH LINES OF
LENGTH 72 CHARACTERS FROM CIPHERTEXT TO PLAINTEXT )
STAT2594 READS AN ALPHANUMERIC FILE FROM STAT2495.INP, A PRIVATE
KEY FROM STAT2594.KEY (PROVIDED TO THE USER FROM THE TRANSMITTER),

2. UTILIZING AN INTERNALLY CREATED ALGORITHM TO DECRYPT THE FILE FOR
SECURITY PURPOSES. EACH LINE OF STAT2594.INP IS RESTRICTED TO 72
CHARACTERS. THE DECRYPTED OUPUT FILE IS RECORDED AS STAT2594.OUT,
UTILIZING THE CONGRUENCES P1 = dC1 - bC2 (mod 51) AND
P2 = -cC1 + aC2 (mod 51) TO CONVERT CHARACTER BLOCKS OF SIZE n = 2
WITH, E.G., a = 2 , b = 3 , c = 5 AND d = 8 TO CONVERT 2-ELEMENT
STRINGS FROM CIPHERTEXT TO PLAINTEXT, WITH gcd(ad-bc,51) = 1. THUS
(ad-bc) AND 51 ARE TAKEN TO BE RELATIVELY PRIME FOR THE 26 INPUT
ALPHABETIC CHARACTERS, A ---> Z, IN UNION WITH A BLANK CHARACTER,
DIGITS 0 --> 9, AND A SELECTED SEQUENCE OF SPECIAL CHARACTERS.
=========================================================================
-- L 2595 --
( NON-ALPHABETIC (BINARY) ENCRYPTION ALGORITHM )
III
( STAT2595 ENCRYPTS A NON-ALPHABETIC FILE WITH LINES OF
LENGTH 75 CHARACTERS FROM PLAINTEXT TO CIPHERTEXT )
STAT2595 READS A NON-ALPHABETIC FILE FROM STAT2595.INP, A RANDOMLY
GENERATED BINARY STRING OF LENGTH 75 (THE ENCRYPTION KEY) FROM
STAT2595.KEY, CONSISTING OF ELEMENTS FROM THE SET { 0,1 }, AND USES
AN INTERNALLY CREATED ALGORITHM TO ENCRYPT THE FILE FOR SECURITY.
EACH LINE OF INPUT FILE STAT2595.INP IS RESTRICTED TO 15 CHARACTERS,
EACH OF WHICH IS REPRESENTED INTERNALLY AS A STRING OF 5 BINARY
DIGITS. THE ENCRYPTED OUPUT FILE IS RECORDED AS STAT2595.OUT,
AUTOMATICALLY TRANSFORMING STAT2595.INP INTO A BINARY FILE FOR
PROCESSING. THE CIPHERTEXT IS GENERATED BY ADDING (MOD 2) THE DIGITS
WHICH HAVE EQUIVALENT INDICES IN THE TWO BINARY STRINGS. THE
RECIPIENT MUST POSSESS IN ADVANCE THE ENCRYPTION KEY. THEN THE
NUMERICAL PLAINTEXT CAN BE RECONSTRUCTED BY MERELY ADDING (MOD 2)
THE TWO CORRESPONDING DIGITS OF THE ENCRYPTION KEY AND THE
CIPHERTEXT. A COMPLETE TABLE OF BINARY EQUIVALENCES FOR THE 26
ALPHABETIC CHARACTERS , A ---> Z , IS AUTOMATICALLY INCLUDED IN THE
ALGORITHM AND RECORDED AS
=========================================================================
-- L 2596 --
( NON-ALPHABETIC (BINARY) DECRYPTION ALGORITHM )
IV
( STAT2596 DECRYPTS A NON-ALPHABETIC FILE WITH LINES OF
LENGTH 75 CHARACTERS FROM CIPHERTEXT TO PLAINTEXT )
STAT2596 READS A NON-ALPHABETIC FILE FROM STAT2596.INP, A RANDOMLY
GENERATED BINARY STRING OF LENGTH 75 (THE ENCRYPTION KEY) FROM
STAT2596.KEY, CONSISTING OF ELEMENTS FROM THE SET { 0,1 }, AND USES
AN INTERNALLY CREATED ALGORITHM TO DECRYPT THE FILE FOR SECURITY.
EACH LINE OF INPUT FILE STAT2596.INP IS RESTRICTED TO 15 CHARACTERS,
EACH OF WHICH IS REPRESENTED INTERNALLY AS A STRING OF 5 BINARY
DIGITS. THE DECRYPTED OUPUT FILE IS RECORDED AS STAT2596.OUT,
AUTOMATICALLY TRANSFORMING STAT2596.INP INTO A BINARY FILE FOR
PROCESSING. THE PLAINTEXT IS GENERATED BY ADDING (MOD 2) THE DIGITS
WHICH HAVE EQUIVALENT INDICES IN THE TWO BINARY STRINGS. THE
RECIPIENT MUST POSSESS IN ADVANCE THE ENCRYPTION KEY. THEN THE
NUMERICAL PLAINTEXT CAN BE RECONSTRUCTED BY MERELY ADDING (MOD 2)
THE TWO CORRESPONDING DIGITS OF THE ENCRYPTION KEY AND THE
CIPHERTEXT. A COMPLETE TABLE OF BINARY EQUIVALENCES FOR THE 26

3. ALPHABETIC CHARACTERS , A ---> Z , IS AUTOMATICALLY INCLUDED IN
THE ALGORITHM AND RECORDED AS STAT2596.OT5.
=========================================================================