Notes on two methods for direct construction of probabilistic LFSR sequences of third order
Abstract
In Tm, the authors give two public key encryptions based on third order linear sequences modulo n2, where n=pq is an RSA integer. In their scheme (3), there are two mistakes in the decryption procedure
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.