2000 character limit reached
Pythagorean Triples and Cryptographic Coding
Published 21 Apr 2010 in cs.CR and math.HO | (1004.3770v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.