Reducing the Complexity in the Distributed Computation of Private RSA Keys

Lory, Peter (2009) Reducing the Complexity in the Distributed Computation of Private RSA Keys. In: Boyd, Colin and Nieto, Juan Gonzales, (eds.) Information Security and Privacy: Proceedings of the 14th Australasian Conference, ACISP 2009. Lecture Notes in Computer Science, 5594. Springer, Berlin, pp. 250-263. ISBN 3-642-02619-2.

[img]
PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
184Kb

Other URL: http://www.springer.com/computer/security+and+cryptology/book/978-3-642-02619-5

Item Type:Book Section
Institutions: Business, Economics and Information Systems > Institut für Wirtschaftsinformatik > Professur für Wirtschaftsinformatik & Wirtschaftsmathematik (Prof. Dr. Peter Lory)
Subjects:000 Computer science, information & general works > 004 Computer science
Status:Published
Refereed:Yes, this version has been refereed
Created at the University of Regensburg:Yes
Owner:Peter Lory
Deposited On:17 Sep 2009 11:50
Last Modified:20 Jul 2011 23:43
Item ID:9413
Owner Only: item control page