Sciweavers

1696 search results - page 40 / 340
» Permuted function matching
Sort
View
ICALP
2005
Springer
15 years 3 months ago
Simple Extractors via Constructions of Cryptographic Pseudo-random Generators
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
Marius Zimand
CRYPTO
2001
Springer
155views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
RSA-OAEP Is Secure under the RSA Assumption
Recently Victor Shoup noted that there is a gap in the widely-believed security result of OAEP against adaptive chosen-ciphertext attacks. Moreover, he showed that, presumably, OA...
Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointch...
JCT
2007
112views more  JCT 2007»
14 years 10 months ago
Bruhat intervals as rooks on skew Ferrers boards
We characterise the permutations π such that the elements in the closed lower Bruhat interval [id,π] of the symmetric group correspond to non-taking rook configurations on a sk...
Jonas Sjöstrand
CEC
2007
IEEE
15 years 4 months ago
N-gram fitness function with a constraint in a musical evolutionary system
—This paper describes an evolutionary music composition system that combines trainable music critics with a bag of notes constraint. Unlike many evolutionary composition systems,...
Man Yat Lo, Simon M. Lucas
IRI
2009
IEEE
15 years 4 months ago
OntoMatch: A Monotonically Improving Schema Matching System for Autonomous Data Integration
Traditional schema matchers use a set of distinct simple matchers and use a composition function to combine the individual scores using an arbitrary order of matcher application l...
Anupam Bhattacharjee, Hasan M. Jamil