Sciweavers

81 search results - page 10 / 17
» Improving Fast Algebraic Attacks
Sort
View
ASIACRYPT
2005
Springer
14 years 1 months ago
Fast Computation of Large Distributions and Its Cryptographic Applications
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
Alexander Maximov, Thomas Johansson
ICSM
1999
IEEE
13 years 11 months ago
A Two-Phase Process for Software Architecture Improvement
Software architecture is important for large systems in which it is the main means for, among other things, controlling complexity. Current ideas on software architectures were no...
René L. Krikhaar, André Postma, M. P...
CORR
2010
Springer
184views Education» more  CORR 2010»
13 years 7 months ago
Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
We consider a Gaussian two-hop network where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine adversary. Both the s...
Xiang He, Aylin Yener
BWCCA
2010
13 years 2 months ago
Comments on a One-Way Hash Chain Based Authentication for FMIPv6
In this paper, we analyze a one-way hash chain based authentication scheme proposed by Haddad and Krishnan. The authentication scheme has been introduced for improving handover per...
Ilsun You, Jong-Hyouk Lee
LISA
2008
13 years 9 months ago
Fast Packet Classification for Snort by Native Compilation of Rules
Signature matching, which includes packet classification and content matching, is the most expensive operation of a signature-based network intrusion detection system (NIDS). In t...
Alok Tongaonkar, Sreenaath Vasudevan, R. Sekar