|
ABSTRACT
Cryptographic long-term security is needed, but difficult to achieve. Use flexible cryptographic tools, and have replacements ready.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Buchmann, J. et al. An evaluated certification services system for the German national root CA---Legally binding and trustworthy transactions in e-business and e-government. In Proceedings of The 2005 International Conference on e-Business, Enterprise Information Systems, e-Government, and Outsourcing (EEE`05), 103--108.
|
| |
2
|
Buchmann, J. and Ludwig, C. Practical lattice basis sampling reduction. To appear in Proceedings of the 7th Algorithmic Number Theory Symposium (ANTS-VII).
|
| |
3
|
Buchmann, J. et al. Post quantum signatures; eprint.iacr.org/2004/297.pdf.
|
| |
4
|
Coronado, C. Provably secure and practical signature schemes. Doctoral Thesis, Technische Universität Darmstadt, 2005; elib.tu-darmstadt.de/diss/000642
|
| |
5
|
FlexiProvider---A Toolkit for the Java Cryptography Architecture (JCA/JCE); www.flexiprovider.de.
|
| |
6
|
German Federal Ministry of Health and Social Security. Information on the electronic health card. www.die-gesundheitsreform.de/presse/publikationen/pdf/flyer_elektronische_gesundheitskarte_en.pdf.
|
| |
7
|
Lenstra, A.K. and Verheul, E.R. Selecting cryptographic key sizes. Journal of Cryptology: The Journal of the International Association for Cryptologic Research 14, 4 (2001), 255--293.
|
| |
8
|
Maseberg, J.S. Fail-safe konzept für public-key infrastrukturen. Doctoral Thesis, Technische Universität Darmstadt, 2002.
|
 |
9
|
|
| |
10
|
Shor, P.W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. In S. Goldwasser, Ed., Proceedings of the 35th Annual Symposium on foundations of Computer Science (FOCS 1994), 124--134
|
|