Pythagorean Triples and Cryptographic Coding
classification
💻 cs.CR
math.HO
keywords
classescryptographicpptssequenceapplicationbasicbelongscoding
read the original abstract
This paper summarizes basic properties of PPTs and shows that each PPT belongs to one of six different classes. Mapping an ordered sequence of PPTs into a corresponding sequence of these six classes makes it possible to use them in cryptography. We pose problems whose solution would facilitate such cryptographic application.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.