Publication

Cryptanalysis of an E0-like Combiner with Memory

Publications associées (32)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Cryptanalysis of Plantlet

Subhadeep Banik, Khashayar Barooti

Plantlet is a lightweight stream cipher designed by Mikhalev, Armknecht and Muller in IACR ToSC 2017. It has a Grain-like structure with two state registers of size 40 and 61 bits. In spite of this, the cipher does not seem to lose in security against gene ...

2019

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

Rüdiger Urbanke, Kirill Ivanov

In this paper, we consider the problem of decoding Reed-Muller (RM) codes in binary erasure channel. We propose a novel algorithm, which exploits several techniques, such as list recursive (successive cancellation) decoding based on Plotkin decomposition, ...

IEEE2019

Some Proofs of Conditional and Joint Biases in RC4 Stream Cipher

Subhadeep Banik

In this paper we present proofs for the new biases in RC4 which were experimentally found and listed out (without theoretical justifi- cations and proofs) in a paper by Vanhoef et al. in USENIX 2015. Their purpose was to exploit the vulnerabilities of RC4 ...

2018

Theoretical Understanding of Some Conditional and Joint Biases in RC4 Stream Cipher

Subhadeep Banik

In this paper we present proofs for the new biases in RC4 which were experimentally found and listed out (without theoretical justifications and proofs) in a paper by Vanhoef et al. in USENIX 2015. Their purpose was to exploit the vulnerabilities of RC4 in ...

IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG2018

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Rüdiger Urbanke, Seyed Hamed Hassani, Shrinivas Kudekar, Yury Polyanskiy

Consider a binary linear code of length N, minimum distance d(min), transmission over the binary erasure channel with parameter 0 < epsilon < 1 or the binary symmetric channel with parameter 0 < epsilon < 1/2, and block-MAP decoding. It was shown by Tillic ...

IEEE2018

Estimating Beauty Ratings of Videos using Supervoxels

Sabine Süsstrunk, Appu Shaji, Gökhan Yildirim

The major low-level perceptual components that influence the beauty ratings of video are color, contrast, and motion. To estimate the beauty ratings of the NHK dataset, we propose to extract these features based on supervoxels, which are a group of pixels ...

2013

Correlation Estimation from Compressed Images

Pascal Frossard, Vijayaraghavan Thirumalai

This paper addresses the problem of correlation estimation in sets of compressed images. We consider a framework where images are represented under the form of linear measurements due to low complexity sensing or security requirements. We assume that the i ...

Elsevier2013

Distributed Compressed Representation of Correlated Image Sets

Vijayaraghavan Thirumalai

Vision sensor networks and video cameras find widespread usage in several applications that rely on effective representation of scenes or analysis of 3D information. These systems usually acquire multiple images of the same 3D scene from different viewpoin ...

EPFL2012

Correlation-Aware Reconstruction of Network Coded Sources

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this paper, we consider the problem of decoding network coded correlated data when the decoder does not receive sufficient information for exact decoding. We propose an iterative decoding algorithm based on belief propagation that efficiently exploits t ...

2012

Compute-and-Forward: Harnessing Interference Through Structured Codes

Michael Christoph Gastpar

Abstract—Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The key idea ...

Institute of Electrical and Electronics Engineers2011