![]() |
|||||||
Worked Example Ciphers as One-Way Function Synthesising Vector Cryptography Anatomy of a Vector Cipher (Sourcecode 1) Anatomy of a Vector Cipher (Sourcecode 2) Anatomy of a Vector Cipher (Sourcecode 3) Anatomy of a Vector Cipher (Sourcecode 4) Resume of Entropy Entropy Balances Entropy and Structure Unicode and ASCII Raw Encryption USB's, Flash Memory Factoring Very Large |
Operational Overview Factoring of Vectors. The vector to be factorised (factored if you prefer) is proposed as being the defining normal vector of a plane. If it is stipulated that this plane passes through the origin (0, 0, 0) then the plane is completely defined by the normal vector. This normal vector is a direction vector, or more precisely, a unit direction vector, not to be confused with a unit vector which is the vector quotient obtained when a vector is divided by its magnitude,
The factors of the vector then occur as pairs of vectors in the plane that always multiply out in ‘cross’ or ‘vector’ multiplication to give a product that is equal to the normal vector of the plane. Furthermore, the infinite set of all the possible factors occur as consecutive points on special number lines called factor lines in the same plane such that, Vn × V(n-1) = N where N is the normal vector of the plane. The position vector that is used to define a number on a vector factor-line is called a Pn. A useful thing worth noting about a Pn is that it is comprised of a set of three coprime integers. It might be difficult to prove that it will always be so but results to date seem to indicate this. In general vectors to be factored must have integer coefficients and for the cryptography being discussed here, they, ie the normal vectors, should be non-zero integer coefficient vectors. Integrality of a Plane. Intercepts
Click Here to download the full 7 page PDF file |
Feel free to print these pages or Click Here to download the PDF file.
|
|||||
AdaCrypt
Vector Cryptography ® 2003 Austin O'Byrne |
|||||||