Last update: Sun Apr 22 02:03:34 MDT 2018
@Article{Smith:1979:UFM, author = "Donald R. Smith and James T. Palmer", title = "Universal fixed messages and the {Rivest--Shamir--Adleman} cryptosystem", journal = j-MATHEMATIKA, volume = "26", number = "1", pages = "44--52", year = "1979", CODEN = "MTKAAB", ISSN = "0025-5793", MRclass = "94B99", MRnumber = "80m:94071", bibsource = "http://www.math.utah.edu/pub/tex/bib/cryptography.bib; http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; http://www.math.utah.edu/pub/tex/bib/sigcse1970.bib", acknowledgement = ack-nhfb, fjournal = "Mathematika. A Journal of Pure and Applied Mathematics", remark = "This paper points out that the some keys in the RSA may fail to encrypt: instead, they produce an output ciphertext that is identical to the input plaintext. See also \cite{Blakley:1979:RSA,Bergmann:2009:DKR}", }