Abstract
We show that analogues of popular public key cryptosystems based on Drinfeld modules are insecure by providing polynomial time algorithms to solve the Drinfeld module versions of the inversion and discrete logarithm problems. © 2001 International Association for Cryptologic Research.
Author supplied keywords
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Insecure, A., & Scanlon, T. (2001). Public key cryptosystems based on drinfeld modules. Journal of Cryptology, 14(4), 225–230. https://doi.org/10.1007/S00145-001-0004-9
Readers over time
Readers' Seniority
Readers' Discipline
