619 search results - page 74 / 124 » Generic Extensions and Generic Polynomials |
128
Voted
ICS
2010
Tsinghua U.
16 years 21 hour ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
109
Voted
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
124
Voted
CSCLP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
121
Voted
EUROCRYPT
2003
Springer
15 years 7 months ago
2003
Springer
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...
119
Voted
ITC
1998
IEEE
15 years 6 months ago
1998
IEEE
This paper presents a logic synthesis tool called BETSY (BIST Environment Testable Synthesis) for synthesizing circuits that achieve complete (100%)fault coverage in a user specif...