scispace - formally typeset
Open AccessBook ChapterDOI

Efficient implementation of a CCA2-Secure variant of mceliece using generalized srivastava codes

Reads0
Chats0
TLDR
This paper provides secure parameters for a classical McEliece encryption scheme based on quasi-dyadic generalized Srivastava codes, and successively converts the scheme to a CCA2-secure protocol in the random oracle model applying the Fujisaki-Okamoto transform.
Abstract
In this paper we present efficient implementations of McEliece variants using quasi-dyadic codes. We provide secure parameters for a classical McEliece encryption scheme based on quasi-dyadic generalized Srivastava codes, and successively convert our scheme to a CCA2-secure protocol in the random oracle model applying the Fujisaki-Okamoto transform. In contrast with all other CCA2-secure code-based cryptosystems that work in the random oracle model, our conversion does not require a constant weight encoding function. We present results for both 128-bit and 80-bit security level, and for the latter we also feature an implementation for an embedded device.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Devising a method for segmenting complex structured images acquired from space observation systems based on the particle swarm algorithm

TL;DR: The improved segmentation method based on the particle swarm algorithm makes it possible to segment complex structured images acquired from space surveillance systems and reduces segmentation errors of the first kind by an average of 12 % and that of the second kind by 8 %.
Book ChapterDOI

Embedded Syndrome-Based Hashing

TL;DR: Novel implementations of the syndrome-based hash function RFSB on an Atmel ATxmega128A1 microcontroller and a low-cost Xilinx Spartan-6 FPGA are presented, the first time the RfsB hash function is implemented on either of these wide-spread platforms.
Book ChapterDOI

Cryptography Based on Error Correcting Codes : A Survey

TL;DR: This chapter surveys the more recent developments in code-based cryptography as well as implementations and side channel attacks, and recalls briefly the basic ideas, and provides a roadmap to readers.
Book ChapterDOI

Evolution of the McEliece Public Key Encryption Scheme

TL;DR: This article analyzes the evolution of the main encryption variants coming from the Rank based cryptography and stresses out the main security issues and point out some new ideas coming from this field.
Dissertation

An algebraic approach for the resolution of algorithmic problems raised by cryptography and coding theory

Vlad Dragoi
TL;DR: This research was naturally directed to the study of the McEliece based encryption schemes, among which the latest MDCP based variant [MTSB13] and Polar codes variant [SK14] and an important weakness regarding the key pairs are revealed.
References
More filters
Book

The Theory of Error-Correcting Codes

TL;DR: This book presents an introduction to BCH Codes and Finite Fields, and methods for Combining Codes, and discusses self-dual Codes and Invariant Theory, as well as nonlinear Codes, Hadamard Matrices, Designs and the Golay Code.
Journal ArticleDOI

On the inherent intractability of certain coding problems (Corresp.)

TL;DR: The fact that the general decoding problem for linear codes and the general problem of finding the weights of a linear code are both NP-complete is shown strongly suggests, but does not rigorously imply, that no algorithm for either of these problems which runs in polynomial time exists.
Book ChapterDOI

Polynomial reconstruction based cryptography

TL;DR: A short overview of recent works on the problem of Decoding Reed Solomon Codes (aka Polynomial Reconstruction) and the novel applications that were enabled due to this development.
Book

Public-Key Cryptography

TL;DR: This book gives a broad overview of public-key cryptography - its essence and advantages, various public- key cryptosystems, and protocols - as well as a comprehensive introduction to classical cryptography and cryptoanalysis.