Sciweavers

247 search results - page 32 / 50
» On Pseudorandom Generators in NC
Sort
View
CMS
2003
148views Communications» more  CMS 2003»
14 years 11 months ago
Computation of Cryptographic Keys from Face Biometrics
We outline cryptographic key–computation from biometric data based on error-tolerant transformation of continuous-valued face eigenprojections to zero-error bitstrings suitable f...
Alwyn Goh, David Ngo Chek Ling
ICMCS
2009
IEEE
130views Multimedia» more  ICMCS 2009»
14 years 7 months ago
On improving the collision property of robust hashing based on projections
In this paper, we study the collision property of one of the robust hash functions proposed in [1]. This method was originally proposed for robust hash generation from blocks of i...
Regunathan Radhakrishnan, Wenyu Jiang, Claus Bauer
TVLSI
2008
140views more  TVLSI 2008»
14 years 9 months ago
A Novel Mutation-Based Validation Paradigm for High-Level Hardware Descriptions
We present a Mutation-based Validation Paradigm (MVP) technology that can handle complete high-level microprocessor implementations and is based on explicit design error modeling, ...
Jorge Campos, Hussain Al-Asaad
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
15 years 10 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
DELTA
2008
IEEE
15 years 4 months ago
High Performance FPGA Implementation of the Mersenne Twister
Efficient generation of random and pseudorandom sequences is of great importance to a number of applications [4]. In this paper, an efficient implementation of the Mersenne Twis...
Shrutisagar Chandrasekaran, Abbes Amira