Sciweavers

583 search results - page 64 / 117
» On the Complexity of Matsui's Attack
Sort
View
ASIACRYPT
2006
Springer
14 years 7 days ago
Improved Collision Search for SHA-0
At CRYPTO2005, Xiaoyun Wang, Hongbo Yu and Yiqun Lisa Yin proposed a collision attack on SHA-0 that could generate a collision with complexity 239 SHA-0 hash operations. Although t...
Yusuke Naito, Yu Sasaki, Takeshi Shimoyama, Jun Ya...
TKDE
2008
103views more  TKDE 2008»
13 years 8 months ago
Detecting Word Substitutions in Text
Searching for words on a watchlist is one way in which large-scale surveillance of communication can be done, for example, in intelligence and counterterrorism settings. One obviou...
SzeWang Fong, Dmitri Roussinov, David B. Skillicor...
TSMC
2008
172views more  TSMC 2008»
13 years 8 months ago
AdaBoost-Based Algorithm for Network Intrusion Detection
Abstract--Network intrusion detection aims at distinguishing the attacks on the Internet from normal use of the Internet. It is an indispensable part of the information security sy...
Weiming Hu, Wei Hu, Stephen J. Maybank
ICST
2010
IEEE
13 years 7 months ago
Searching for a Needle in a Haystack: Predicting Security Vulnerabilities for Windows Vista
—Many factors are believed to increase the vulnerability of software system; for example, the more widely deployed or popular is a software system the more likely it is to be att...
Thomas Zimmermann, Nachiappan Nagappan, Laurie A. ...
TIT
2010
160views Education» more  TIT 2010»
13 years 3 months ago
Parameterized splitting systems for the discrete logarithm
Hoffstein and Silverman suggested the use of low Hamming weight product (LHWP) exponents to accelerate group exponentiation while maintaining the security level. With LHWP exponent...
Sungwook Kim, Jung Hee Cheon