Sciweavers

397 search results - page 24 / 80
» Pseudorandom Functions and Lattices
Sort
View
ICISC
2007
152views Cryptology» more  ICISC 2007»
15 years 2 months ago
Analysis of Multivariate Hash Functions
We analyse the security of new hash functions whose compression function is explicitly defined as a sequence of multivariate equations. First we prove non-universality of certain ...
Jean-Philippe Aumasson, Willi Meier
CTRSA
2010
Springer
169views Cryptology» more  CTRSA 2010»
15 years 8 months ago
Hash Function Combiners in TLS and SSL
Abstract. The TLS and SSL protocols are widely used to ensure secure communication over an untrusted network. Therein, a client and server first engage in the so-called handshake ...
Marc Fischlin, Anja Lehmann, Daniel Wagner
CRYPTO
2012
Springer
262views Cryptology» more  CRYPTO 2012»
13 years 3 months ago
Functional Encryption with Bounded Collusions via Multi-party Computation
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
DFT
2009
IEEE
106views VLSI» more  DFT 2009»
15 years 8 months ago
Reducing Test Point Area for BIST through Greater Use of Functional Flip-Flops to Drive Control Points
Recently, a new test point insertion method for pseudo-random built-in self-test (BIST) was proposed in [Yang 09] which tries to use functional flip-flops to drive control test po...
Joon-Sung Yang, Benoit Nadeau-Dostie, Nur A. Touba
CAV
2008
Springer
99views Hardware» more  CAV 2008»
15 years 3 months ago
Functional Verification of Power Gated Designs by Compositional Reasoning
Power gating is a technique for low power design in which whole sections of the chip are powered off when they are not needed, and powered back on when they are. Functional correct...
Cindy Eisner, Amir Nahir, Karen Yorav