Sciweavers

2237 search results - page 275 / 448
» On the Security of Random Sources
Sort
View
ICCAD
2009
IEEE
87views Hardware» more  ICCAD 2009»
15 years 3 months ago
The synthesis of combinational logic to generate probabilities
As CMOS devices are scaled down into the nanometer regime, concerns about reliability are mounting. Instead of viewing nanoscale characteristics as an impediment, technologies suc...
Weikang Qian, Marc D. Riedel, Kia Bazargan, David ...
TSP
2011
165views more  TSP 2011»
15 years 1 months ago
Quaternion ICA From Second-Order Statistics
—This paper addresses the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case and therefore only consider the quaterni...
Javier Vía, Daniel P. Palomar, Luis Vielva,...
ASIACRYPT
2009
Springer
16 years 21 days ago
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
Anja Lehmann, Stefano Tessaro
158
Voted
PLDI
2006
ACM
16 years 1 days ago
DieHard: probabilistic memory safety for unsafe languages
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
Emery D. Berger, Benjamin G. Zorn
155
Voted
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
15 years 11 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith