You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
From the Post-Markov Theorem Through Decision Problems to Public-Key Cryptography
Iris Lee Anshel and Michael Anshel
The American Mathematical Monthly
Vol. 100, No. 9 (Nov., 1993), pp. 835-844
Published by: Mathematical Association of America
Stable URL: http://www.jstor.org/stable/2324657
Page Count: 10
You can always find the topics here!Topics: Word problems, Cryptography, Mathematical theorems, Cryptosystems, Alphabets, Monoids, Mathematical problems, Unsolvability, Ciphers, Applied mathematics
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
The American Mathematical Monthly © 1993 Mathematical Association of America