Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
An Improvement of Pseudorandomization against Unbounded Attack Algorithms – The Case of Fingerprint Codes
verfasst von : Koji Nuida, Goichiro Hanaoka
Erschienen in: Information Theoretic Security
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Recently, the authors proposed an evaluation technique for pseudorandom generator-based randomness reduction of cryptographic schemes against computationally unbounded attack algorithms. In this article, we apply the technique to the case of fingerprint codes and verify the effectiveness. Then we propose a technique that improves the randomness reduction by dividing the target randomness into suitable parts and using a separate pseudorandom generator for each part. Considering fingerprint codes as a typical example, we give a theoretical evaluation of the proposed technique, and also a numerical evaluation showing that our technique improves the effect of randomness reduction to about 29 times as good as the plain randomness reduction in a reasonable setting.