Sciweavers

347 search results - page 53 / 70
» The Berlekamp-Massey Algorithm revisited
Sort
View
76
Voted
JAIR
2010
145views more  JAIR 2010»
14 years 9 months ago
On Action Theory Change
As historically acknowledged in the Reasoning about Actions and Change community, intuitiveness of a logical domain description cannot be fully automated. Moreover, like any other...
Ivan José Varzinczak
87
Voted
SCN
2010
Springer
143views Communications» more  SCN 2010»
14 years 9 months ago
History-Free Aggregate Message Authentication Codes
Aggregate message authentication codes, as introduced by Katz and Lindell (CT-RSA 2008), combine several MACs into a single value, which has roughly the same size as an ordinary MA...
Oliver Eikemeier, Marc Fischlin, Jens-Fabian G&oum...
111
Voted
TIT
2010
130views Education» more  TIT 2010»
14 years 5 months ago
Pseudo-random functions and parallelizable modes of operations of a block cipher
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
Palash Sarkar
GLOBECOM
2008
IEEE
15 years 5 months ago
Distributed Multi-Interface Multi-Channel Random Access
— The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC op...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong
HVC
2005
Springer
160views Hardware» more  HVC 2005»
15 years 4 months ago
Simultaneous SAT-Based Model Checking of Safety Properties
We present several algorithms for simultaneous SAT (propositional satisfiability) based model checking of safety properties. More precisely, we focus on Bounded Model Checking and ...
Zurab Khasidashvili, Alexander Nadel, Amit Palti, ...