Writing a program to evaluate a given polynomial at a point can be done rather simply. If it has to be done repeatedly, efficiently, and/or accurately, a naive approach may not suffice. There is in fact a huge design space of how to approach this problem [12]. Depending upon one’s criteria, it may be worthwhile to use automated program-generation programs to write source code. Such generated co...

The Simulation based VLSI Implementation of FELICS (Fast Efficient Lossless Image Compression System) Algorithm is proposed to provide the lossless image compression and is implemented in simulation oriented VLSI (Very Large Scale Integrated). To analysis the performance of Lossless image compression and to reduce the image without losing image quality and then implemented in VLSI based FELICS ...

Current state-of-the-art deobfuscation approaches operate on instruction traces and use a mixed approach of symbolic execution and taint analysis; two techniques that require precise analysis of the underlying code. However, recent research has shown that both techniques can easily be thwarted by specific transformations. As program synthesis can synthesize code of arbitrary code complexity, it...

C-XSC [11,12] is a C++ class library for verified computations, using interval arithmetic [2]. C-XSC has been developed and maintained for almost twenty years to enable and facilitate the implementation of reliable numerical methods on computers. Today, it is one of the most sophisticated software libraries available for this purpose (most wide-spread alternatives include INTLAB [19], filib++ [...

A fountain code produces for given set of k input symbols (x1, . . . , xk) a potentially limitless stream of output symbols z1, z2, . . .. The input and output symbols can be binary vectors of arbitrary length. Each output symbol is the sum of a randomly and independently chosen subset of the input symbols. Information describing the relations between input and output symbols is obtained at the...

Introduction: Decompilers are useful tools for software analysis and support in the absence of source code. They available many hardware architectures programming languages. However, none existing decompilers modern AMD GPU such as GCN RDNA. Purpose: We aim at developing first assembly decompiler tool a architecture that generates code OpenCL language, which is widely used GPGPUs. Results: deve...

The Elias source coding scheme is modified to permit a source sequence of practically unlimited length to be coded as a single codeword using arithmetic of only limited precision. The result is shown to be a nonblock arithmetic code of the first in, first out (FIFO) typesource symbols are decoded in the same order as they were encoded. Codeword lengths which are near optimum for the specified s...

We present two algorithms for the arithmetic of cubic curves with a totally ramified prime at infinity. The first algorithm, inspired by Cantor’s reduction for hyperelliptic curves, is easily implemented with a few lines of code, making use of a polynomial arithmetic package. We prove explicit reducedness criteria for superelliptic curves of genus 3 and 4, which show the correctness of the algo...

It is no secret that modern computer systems are vulnerable to threats such as side-channel attack or reverse engineering whereby sensitive data or code could be unintentionally leaked to an adversary. It is the premise of this work that the mitigation of such security threats can be achieved by leveraging the inherent complexity of emerging chaos-based computing (computer systems built from ch...

Aiming at the special demand on SVG_based representation and organization for spatial data in location based services (LBS), the research is made in this article on the conversion method from multiple formats to SVG format, and a harris_corner detector method is proposed and verified to evaluate the conversion result. Based on the above, an optimized compression arithmetic is proposed, which in...