Sciweavers

595 search results - page 91 / 119
» Using Constraints with Memory to Implement Variable Eliminat...
Sort
View
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
14 years 9 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
CC
2001
Springer
121views System Software» more  CC 2001»
14 years 1 months ago
Constant-Time Root Scanning for Deterministic Garbage Collection
Root scanning is the task of identifying references to heap objects that are stored outside of the heap itself, in global and local variables and on the execution stack. Root scann...
Fridtjof Siebert
CISC
2005
Springer
120views Cryptology» more  CISC 2005»
14 years 2 months ago
Towards a General RC4-Like Keystream Generator
RC4 was designed in 1987 when 8-bit and 16-bit processors were commercially available. Today, most processors use 32-bit or 64bit words but using original RC4 with 32/64 bits is in...
Guang Gong, Kishan Chand Gupta, Martin Hell, Yassi...
RTS
2008
131views more  RTS 2008»
13 years 8 months ago
A constant-time dynamic storage allocator for real-time systems
Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst case of spatial and temporal requirements for allocation ...
Miguel Masmano, Ismael Ripoll, Patricia Balbastre,...
INFOCOM
2003
IEEE
14 years 1 months ago
Load optimal MPLS routing with N+M labels
Abstract— MPLS is becoming an important protocol for intradomain routing. MPLS routers are offered by the major vendors and many ISPs are deploying MPLS in their IP backbones, as...
David Applegate, Mikkel Thorup