A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences {Xi}lm_, and {x}lm_, is drawn i.i.d. according to joint probability mass function (p.m.f.) p ( z , y); the encoder for each source operates without knowledge of the other source; the decoder jointly decodes the encoded bit streams from both sources. ...

In this work we focus on tailoring and optimizing the computational Private Information Retrieval (cPIR) scheme proposed in WAHC 2014 for efficient execution on graphics processing units (GPUs). Exploiting the mass parallelism in GPUs is a commonly used approach in speeding up cPIRs. Our goal is to eliminate the efficiency bottleneck of the Doröz et al construction which would allow us to take ...

Simulations and prototyping have been a very important part of the electronics industry since a very long time. In recent years, FPGA‘s have become increasingly important and have found their way into all kind of digital system design This paper presents a novel, easy and efficient approach of implementation and verification of VHDL code using Simulink and then to regenerate the optimized VHDL ...

This work presents a formalization of a library for automata on bit strings. It forms the basis of a reflection-based decision procedure for Presburger arithmetic, which is efficiently executable thanks to Isabelle’s code generator. With this work, we therefore provide a mechanized proof of a well-known connection between logic and automata theory. The formalization is also described in a publi...

This paper aims at surveying multipliers based on Horner’s rule for finite field arithmetic. We present a generic architecture based on five processing elements and introduce a classification of several algorithms based on our model. We provide the readers with a detailed description of each scheme which should allow them to write a VHDL description or a VHDL code generator.

The Satisfiability Modulo Theory (SMT) problem over floating-point arithmetic is a major hurdle in applying SMT techniques to real-world floatingpoint code. Solving floating-point constraints is challenging in part because floating-point semantics is difficult to specify or abstract. State-of-the-art SMT solvers still often run into difficulties when solving complex, non-linear floating-

We present a library for finite field arithmetic. The originality of this library lies in the fact that specialized code is automatically produced for the selected finite fields. The opportunity of compile-time optimizations yields substantial performance improvements compared to libraries which initialize the finite field at runtime. This library is used to present benchmarks on some curve-bas...

By Grothedieck's Anabelian conjectures, Galois representations landing in outer automorphism group of the algebraic fundamental group which are associated to hyperbolic smooth curves defined over number fields encode all arithmetic information of these curves. The goal of this paper is to develope and arithmetic teichmuller theory, by which we mean, introducing arithmetic objects summarizing th...

We analyze the arithmetic complexity of the feasibility problem in linear optimization theory as a quantifier-elimination problem. For the case of polyhedra defined by 2n halfspaces in R we prove that, if dense representation is used to code polynomials, any quantifier-free formula expressing the set of parameters describing nonempty polyhedra has size Ω(4).

Program Variables. Bit-precision or mathematical integers? ints used as indices, bit-masks or in arithmetic? Dynamic data structures? Arrays? Program Loops. Reducible loops or goto programs? FOR-loops or advanced ranking functions? Widening, loop acceleration, termination analysis, or loop unrolling? Control Flow. Recursion? Function pointers? Multithreading? Straight-line code or complex branc...