The Veri ed Programming Language Implementation project has developed a formally veri ed implementation of the Scheme programming language. This report documents the byte-code interpreter, which executes a user program presented in the form of a binary image. It speci es several intermediate abstract machines, and proves that they are (successive) faithful implementations of the Vlisp operation...

Byte codes are a practical alternative to the traditional bit-oriented compression approaches when large alphabets are being used, and trade away a small amount of compression effectiveness for a relatively large gain in decoding efficiency. Byte codes also have the advantage of being searchable using standard string matching techniques. Here we describe methods for searching in byte-coded comp...

In the field of cryptography till date the 2-byte in 1-clock is the best known RC4 hardware design [1], while 1-byte in 1-clock [2], and the 1-byte in 3 clocks [3][4] are the best known implementation. The design algorithm in[2] considers two consecutive bytes together and processes them in 2 clocks. The design [1] is a pipelining architecture of [2]. The design of 1-byte in 3-clocks is too muc...

Poly1305-AES is a state-of-the-art message-authentication code suitable for a wide variety of applications. Poly1305-AES computes a 16-byte authenticator of a variable-length message, using a 16-byte AES key, a 16-byte additional key, and a 16-byte nonce. The security of Poly1305-AES is very close to the security of AES; the security gap is at most 14DdL/16e/2 if messages have at most L bytes, ...

Business Data always growth from kilo byte, mega byte, giga byte, tera byte, peta byte, and so far. There is no way to avoid this increasing rate of data till business still running. Because of this issue, database tuning be critical part of a information system. Tuning a database in a costeffective manner is a growing challenge. The total cost of ownership (TCO) of information technology needs...

Past few years have seen an extensive use of RAM chips with wide I/O data (e.g. 16, 32, 64 bits) in computer memory systems. These chips are highly vulnerable to a special type of byte error, called an m-spotty byte error, which can be effectively detected or corrected using byte error-control codes. The MacWilliams identity provides the relationship between the weight distribution of a code an...

Multiple strategies for caching video objects have been proposed in recent years in order to maximize byte-hit ratio and better cope with large sizes of video objects. Usually, a video proxy-cache will use the same strategy when caching all its objects. We propose a new approach, which enables a proxy-cache to decide which strategy to use on a per object basis. In this context we introduce a ne...

HBase supports the BigTable data model [1] that was originally proposed by Google. Figure 1 illustrates this data model. Data are stored in tables; each table contains multiple rows, and a fixed number of column families. For each row, there can be a various number of qualifiers (columns) within each column family, and at the intersections of rows and qualifiers are table cells. Cell contents a...

Embedded microcontroller applications often experience multiple limiting constraints: memory, speed, and for a wide range of portable devices, power. Applications requiring encrypted data must simultaneously optimize the block cipher algorithm and implementation choice against these limitations. To this end we investigate block cipher implementations that are optimized for speed and energy effi...

The use of constraint solvers, such as SATor PseudoBoolean-solvers, allows the extraction of the secret key from one or two side-channel traces. However, to use such a solver the cipher must be represented at bit-level. For byte-oriented ciphers this produces very large and unwieldy instances, leading to unpredictable, and often very long, run times. In this paper we describe a specialized byte...