A Number-Theoretic Error-Correcting Code

@article{Brier2015ANE,
  title={A Number-Theoretic Error-Correcting Code},
  author={{\'E}ric Brier and Jean-S{\'e}bastien Coron and R{\'e}mi G{\'e}raud and Diana Maimuţ and David Naccache},
  journal={ArXiv},
  year={2015},
  volume={abs/1509.00378}
}
In this paper we describe a new error-correcting code (ECC) inspired by the Naccache-Stern cryptosystem. While by far less efficient than Turbo codes, the proposed ECC happens to be more efficient than some established ECCs for certain sets of parameters. 

Advances in public-key cryptology and computer exploitation. (Avancées en cryptologie à clé publique et exploitation informatique)

This thesis addresses several of these aspects of information security and network intrusion, from a security and cryptography viewpoint, by introducing new cryptographic algorithms, new protocols, improved algorithms, and an efficient integer multiplication algorithm.

Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems

A virtual-black-box (VBB) secure and input-hiding obfuscator for fuzzy matching for Hamming distance, based on certain natural number-theoretic computational assumptions, and can be implemented for a much wider range of parameters.

Polynomial time bounded distance decoding near Minkowski’s bound in discrete logarithm lattices

We propose a concrete family of dense lattices of arbitrary dimension n in which the lattice bounded distance decoding (BDD) problem can be solved in deterministic polynomial time. This construction

Polynomial time bounded distance decoding near Minkowski’s bound in discrete logarithm lattices

We propose a concrete family of dense lattices of arbitrary dimension n in which the lattice bounded distance decoding (BDD) problem can be solved in deterministic polynomial time. This construction

References

SHOWING 1-10 OF 14 REFERENCES

A New Public-Key Cryptosystem

This paper describes a new public-key cryptosystem where the ciphertext is obtained by multiplying the public-keys indexed by the message bits and the cleartext is recovered by factoring the

Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1

A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed. The turbo-code encoder is built using a

A class of multiple-error-correcting codes and the decoding scheme

  • I. Reed
  • Computer Science
    Trans. IRE Prof. Group Inf. Theory
  • 1954
A class of multiple-error-correcting codes and their decoding scheme to device a coding scheme which is able to detect and correct such errors.

A Mathematical Theory of Communication

It is proved that the authors can get some positive data rate that has the same small error probability and also there is an upper bound of the data rate, which means they cannot achieve the data rates with any encoding scheme that has small enough error probability over the upper bound.

Coding for noisy channels with input-dependent insertions

Tree encoding and sequential decoding are considered for noisy channels that respond a random number of times to each input in mathematical models of certain speech recognition systems.

Linear Bandwidth Naccache-Stern Encryption

The Naccache-Stern knapsack cryptosystem is an original yet little-known public-key encryption scheme that features a bandwidth sublinear in log p, namely log p/ log log p.

Error detecting and error correcting codes

The author was led to the study given in this paper from a consideration of large scale computing machines in which a large number of operations must be performed without a single error in the end

Polynomial Codes Over Certain Finite Fields

A programmable logic device (130) as may be used in a communication System device Such as a digital Subscriber line modem (408) to perform Reed-Solomon decoding upon a received frame of digital

CryptoComputing with Rationals

A method to compute with encrypted rational numbers using the Paillier cryptosystem which offers the largest bandwidth among all homomorphic schemes and uses two-dimensional lattices to recover the numerator and denominator of the rationals.

Gauss' Algorithm Revisited