Sciweavers

6 search results - page 1 / 2
» Almost Boolean Functions: The Design of Boolean Functions by...
Sort
View
CI
2004
79views more  CI 2004»
13 years 5 months ago
Almost Boolean Functions: The Design of Boolean Functions by Spectral Inversion
John A. Clark, Jeremy L. Jacob, Subhamoy Maitra, P...
DAC
1993
ACM
13 years 9 months ago
Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping
The Walsh transform has numerous applications in computer-aided design, but the usefulness of these techniques in practice has been limited by the size of the boolean functions th...
Edmund M. Clarke, Kenneth L. McMillan, Xudong Zhao...
CRYPTO
2000
Springer
108views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers
Abstract. This paper investigates the design of S-boxes used for combining linear feedback shift register (LFSR) sequences in combination generators. Such combination generators ha...
Muxiang Zhang, Agnes Hui Chan
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
13 years 11 months ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich
ASIACRYPT
2005
Springer
13 years 11 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
Vladimir Kolesnikov