Sciweavers

81 search results - page 5 / 17
» Improving Fast Algebraic Attacks
Sort
View
ICISC
2007
120views Cryptology» more  ICISC 2007»
13 years 9 months ago
Improving the Time Complexity of Matsui's Linear Cryptanalysis
This paper reports on an improvement of Matsui’s linear cryptanalysis that reduces the complexity of an attack with algorithm 2, by taking advantage of the Fast Fourier Transform...
Baudoin Collard, François-Xavier Standaert,...
FSE
2004
Springer
90views Cryptology» more  FSE 2004»
14 years 26 days ago
Fast Software-Based Attacks on SecurID
SecurID is a widely used hardware token for strengthening authentication in a corporate environment. Recently, Biryukov, Lano, and Preneel presented an attack on the alleged SecurI...
Scott Contini, Yiqun Lisa Yin
ICCAD
2006
IEEE
149views Hardware» more  ICCAD 2006»
14 years 1 months ago
Fast decap allocation based on algebraic multigrid
Decap (decoupling capacitor) is an effective technique for suppressing power supply noise. Nevertheless, over-usage of decap usually causes excessive power dissipation. Therefore...
Cheng Zhuo, Jiang Hu, Min Zhao, Kangsheng Chen
INFOCOM
2005
IEEE
14 years 1 months ago
FIT: fast Internet traceback
— Traceback mechanisms are a critical part of the defense against IP spoofing and DoS attacks, as well as being of forensic value to law enforcement. Currently proposed IP trace...
Abraham Yaar, Adrian Perrig, Dawn Xiaodong Song
INFOVIS
2002
IEEE
14 years 12 days ago
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
Yehuda Koren, Liran Carmel, David Harel