Results 1  10
of
304
The RC5 Encryption Algorithm
, 1995
"... Abstract. This document describes the RC5 encryption algorithm. RC5 is a fast symmetric block cipher suitable for hardware or software implementations. A novel feature of RC5 is the heavy use of datadependent rotations. RC5 has a variable word size, a variable number of rounds, and a variablelengt ..."
Abstract

Cited by 363 (7 self)
 Add to MetaCart
length secret key. 1 AParameterized Family of Encryption Algorithms RC5 is wordoriented: all of the primitive operations work on wbit words as their basic unit of information. Here we assume w = 32, although the formal speci cation of RC5 admits variants for other word lengths, such asw = 64 bits. RC5 has twoword
TransDichotomous Algorithms without Multiplication  some Upper and Lower Bounds
, 1997
"... We show that on a RAM with addition, subtraction, bitwise Boolean operations and shifts, but no multiplication, there is a transdichotomous solution to the static dictionary problem using linear space and with query time . On the way, we show that two wbit words can be multiplied in time ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
We show that on a RAM with addition, subtraction, bitwise Boolean operations and shifts, but no multiplication, there is a transdichotomous solution to the static dictionary problem using linear space and with query time . On the way, we show that two wbit words can be multiplied
unknown title
, 2012
"... We continue our analysis of integer data structures, focusing this lecture on fusion trees. This structure employs some neat bit tricks and wordlevel parallelism. In particular, we discuss the following techniques necessary to understand the workings of a fusion tree: sketching, which allows certai ..."
Abstract
 Add to MetaCart
certain wbit words to be compressed to less than w bits, parallel comparison, where multiple words
Abstract
"... We introduce NSABC/w NiceStructured Algebraic Block Cipher using wbit word arithmetic, a 4wbit analogous of Skipjack [NSA98] with 5wbit key. The Skipjack's internal 4round Feistel structure is replaced with a wbit, 2round cascade of a binary operation (x, z) ↦ → (x ⊡ z) ≪ (w/2) that per ..."
Abstract
 Add to MetaCart
We introduce NSABC/w NiceStructured Algebraic Block Cipher using wbit word arithmetic, a 4wbit analogous of Skipjack [NSA98] with 5wbit key. The Skipjack's internal 4round Feistel structure is replaced with a wbit, 2round cascade of a binary operation (x, z) ↦ → (x ⊡ z) ≪ (w/2
Subquadratic algorithms for 3SUM
 In Proc. 9th Worksh. Algorithms & Data Structures, LNCS 3608
, 2005
"... We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with wbit words, we obtain a running time of O(n 2 / max { w lg 2 w, lg 2 n (lg lg n) 2}). In the circuit RAM with one nonstandard AC0 operation, we obtain O(n2 / w2 lg2). In external w me ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with wbit words, we obtain a running time of O(n 2 / max { w lg 2 w, lg 2 n (lg lg n) 2}). In the circuit RAM with one nonstandard AC0 operation, we obtain O(n2 / w2 lg2). In external w
FPGA Implementations of the RC6 Block Cipher
 FieldProgrammable Logic and Applications, number 2778 in Lecture
, 2003
"... RC6 is a symmetrickey algorithm which encrypts 128bit plaintext blocks to 128bit ciphertext blocks. The encryption process involves four operations: integer addition modulo 2 , bitwise exclusive or of two wbit words, rotation to the left, and computation of f(X)= (X(2X + 1)) mod 2 , which i ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
RC6 is a symmetrickey algorithm which encrypts 128bit plaintext blocks to 128bit ciphertext blocks. The encryption process involves four operations: integer addition modulo 2 , bitwise exclusive or of two wbit words, rotation to the left, and computation of f(X)= (X(2X + 1)) mod 2 , which
Lower Bounds for Dynamic Partial Sums
"... Let G be a group. The partial sums problem asks to maintain an array A[1.. n] of group elements, initialized to zeroes (a.k.a. the identity), under the following operations: update(k, ∆): modify A[k] ← ∆, where ∆ ∈ G. query(k): returns the partial sum ∑ k i=1 A[i]. For concreteness, let us work on ..."
Abstract
 Add to MetaCart
on a machine with wbits words (w ≥ lg n), and take G to be Z/2 w Z, i.e. integer arithmetic on machine words (modulo 2 w). Then, the partial sums problem can be solved trivially in O(lg n) time per operation, using augmented binary trees. In this note, we describe a simple lower bound, originating
Secure and Efficient Constructions of Hash, MAC and PRF for Mobile Devices
"... AbstractNumerous cryptographic techniques have been developed to be used on mobile devices for various security and privacy protections. However, these cryptographic primitives, working under different mathematical assumptions, tend to become more and more complex and intricate, which makes it incr ..."
Abstract
 Add to MetaCart
problem and hardcore predicate of oneway function. We also show that the proposed schemes achieve better performance with a complexity reduction from O(n2) to O(knjw) for n·bit message, k·bit output and w·bit word size.
Adaptive Range Counting and Other FrequencyBased Range Query Problems
, 2012
"... I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii We consider variations of range searching in which, gi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
adaptive and approximate data structures for the 2D orthogonal range counting problem under the wbit word RAM model. The query time of an adaptive range counting data structure is sensitive to k, the number of points being counted. We give an adaptive data structure that requires O(n log log n) space
On Dynamic Range Reporting in One Dimension
, 2008
"... We consider the problem of maintaining a dynamic set of integers and answering queries of the form: report a point (equivalently, all points) in a given interval. Range searching is a natural and fundamental variant of integer search, and can be solved using predecessor search. However, for a RAM wi ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
with wbit words, we show how to perform updates in O(lg w) time and answer queries in O(lg lg w) time. The update time is identical to the van Emde Boas structure, but the query time is exponentially faster. Existing lower bounds show that achieving our query time for predecessor search requires doubly
Results 1  10
of
304