A Simple Secure Cryptographic System --by Otway 0"111.Pardee Syracuse, Afew York SING APL M A ~ S IT RATHER SIMPLE to Wl"lte a c r y p t o graphically-secure pair of coding and decoding functions. T h e method used is based on a new principle in cryptography. Instead of having a known method ,0vith secret keys or numbers, the unknown or secret elements are arbitrary, capricious functions ofthe user's invention. It stands in place of using the usual pseudo-random dements which can be easily compromised. For known methods see [1], [2]. These functions are used to determine a set of permutation vectors such that each successive d e m e n t of the original message, called plaintext, has a different permutation to encrypt it. ActuaUy the functions act on an existent random link or seed, DRL, to produce a new DRL. T h e n the new ERL is used in the APL Deal function to generate a permutation vector which is further manipulated to produce the final permutation applied to the message dement. For security purposes, some small refinements are necessary in the functions used. T h e final permutations used should not be
/lp/association-for-computing-machinery/a-simple-secure-cryptographic-system-tFRoA7f0LI