Eric R. Verheul

Available identifiers

Publication	Date of Publication	Type
An Efficient Self-blindable Attribute-Based Credential Scheme	2021-03-17	Paper
https://portal.mardi4nfdi.de/entity/Q4602280	2018-01-09	Paper
Selecting Secure Passwords	2008-04-17	Paper
An Analysis of the Vector Decomposition Problem	2008-03-05	Paper
Evidence that XTR is more secure than supersingular elliptic curve cryptosystems	2005-04-15	Paper
https://portal.mardi4nfdi.de/entity/Q4665030	2005-04-09	Paper
https://portal.mardi4nfdi.de/entity/Q4474197	2004-08-04	Paper
Looking beyond XTR	2003-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4536791	2002-10-07	Paper
https://portal.mardi4nfdi.de/entity/Q2724583	2002-09-01	Paper
An overview of the XTR public key system	2002-06-13	Paper
https://portal.mardi4nfdi.de/entity/Q2778850	2002-03-21	Paper
Selecting cryptographic key sizes	2002-01-02	Paper
https://portal.mardi4nfdi.de/entity/Q4950064	2001-11-22	Paper
https://portal.mardi4nfdi.de/entity/Q4950050	2001-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q2707417	2001-07-03	Paper
https://portal.mardi4nfdi.de/entity/Q4502510	2000-09-12	Paper
Cryptanalysis of `less short' RSA secret exponents	1998-03-10	Paper
Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes	1997-12-18	Paper
Modular Interval Spaces	1994-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q4281374	1994-02-13	Paper
https://portal.mardi4nfdi.de/entity/Q4014262	1992-10-04	Paper
Elementary proofs concerning results about functions on the n-sphere	1991-01-01	Paper

This page was built for person: Eric R. Verheul