2010/04/21 by Subhash Kak, Kak, Subhash
Computer Science · Mathematics · #Algebraic and Geometric Analysis #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #History and Overview (math.HO) #History and Theory of Mathematics #Mathematics and Applications #cs.CR #math.HO
paper · pdf · doi:10.48550/arxiv.1004.3770
11 pages
openalex publication_date 2010/04/21 · arxiv created 2010/09/30 · arxiv updated 2010/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.