Sciweavers

22 search results - page 4 / 5
» fse 2010
Sort
View
INTERSPEECH
2010
13 years 4 months ago
Convexity and fast speech extraction by split bregman method
A fast speech extraction (FSE) method is presented using convex optimization made possible by pause detection of the speech sources. Sparse unmixing filters are sought by l1 regul...
Meng Yu, Wenye Ma, Jack Xin, Stanley Osher
FSE
2010
Springer
146views Cryptology» more  FSE 2010»
14 years 28 days ago
A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
Mridul Nandi
FSE
2010
Springer
144views Cryptology» more  FSE 2010»
14 years 2 months ago
Pseudo-cryptanalysis of the Original Blue Midnight Wish
The hash function Blue Midnight Wish (BMW) is a candidate in the SHA-3 competition organised by the U.S. National Institute of Standards and Technology (NIST). BMW was selected fo...
Søren S. Thomsen
FSE
2010
Springer
140views Cryptology» more  FSE 2010»
14 years 2 months ago
Cryptanalysis of ESSENCE
ESSENCE is a hash function submitted to the NIST Hash Competition that stands out as a hardware-friendly and highly parallelizable design. Previous analysis showed some non-randomn...
María Naya-Plasencia, Andrea Röck, Jea...
FSE
2011
Springer
264views Cryptology» more  FSE 2011»
13 years 1 months ago
An Improved Algebraic Attack on Hamsi-256
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...
Itai Dinur, Adi Shamir