Sciweavers

COGSCI
2011
115views more  COGSCI 2011»
13 years 1 months ago
A Computational Cognitive Model of Syntactic Priming
The psycholinguistic literature has identified two syntactic adaptation effects in language production: rapidly decaying short-term priming and long-lasting adaptation. To explai...
David Reitter, Frank Keller, Johanna D. Moore
COGSCI
2011
64views more  COGSCI 2011»
13 years 1 months ago
Structural Priming as Structure-Mapping: Children Use Analogies From Previous Utterances to Guide Sentence Production
What mechanisms underlie children’s language production? Structural priming—the repetition of sentence structure across utterances—is an important measure of the developing ...
Micah B. Goldwater, Marc T. Tomlinson, Catharine H...
CODCRY
2011
Springer
264views Cryptology» more  CODCRY 2011»
13 years 1 months ago
Algorithms for the Shortest and Closest Lattice Vector Problems
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
CODCRY
2011
Springer
247views Cryptology» more  CODCRY 2011»
13 years 1 months ago
List Decoding for Binary Goppa Codes
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n − p n(n − 2t − 2) err...
Daniel J. Bernstein
CODCRY
2011
Springer
242views Cryptology» more  CODCRY 2011»
13 years 1 months ago
Faster 2-Regular Information-Set Decoding
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
AFRICACRYPT
2011
Springer
13 years 1 months ago
Really Fast Syndrome-Based Hashing
Abstract. The FSB (fast syndrome-based) hash function was submitted to the SHA-3 competition by Augot, Finiasz, Gaborit, Manuel, and Sendrier in 2008, after preliminary designs pro...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
ACNS
2011
Springer
283views Cryptology» more  ACNS 2011»
13 years 1 months ago
On Hiding a Plaintext Length by Preencryption
It is a well known fact that encryption schemes cannot hide a plaintext length when it is unbounded. We thus admit that an approximation of it may leak and we focus on hiding its p...
Cihangir Tezcan, Serge Vaudenay
ACNS
2011
Springer
244views Cryptology» more  ACNS 2011»
13 years 1 months ago
Quantitatively Analyzing Stealthy Communication Channels
Abstract. Attackers in particular botnet controllers use stealthy messaging systems to set up large-scale command and control. Understanding the capacity of such communication chan...
Patrick Butler, Kui Xu, Danfeng (Daphne) Yao
ACNS
2011
Springer
254views Cryptology» more  ACNS 2011»
13 years 1 months ago
Linear Analysis of Reduced-Round CubeHash
Abstract. Recent developments in the field of cryptanalysis of hash functions has inspired NIST to announce a competition for selecting a new cryptographic hash function to join t...
Tomer Ashur, Orr Dunkelman
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
13 years 1 months ago
Cold Boot Key Recovery by Solving Polynomial Systems with Noise
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
Martin Albrecht, Carlos Cid