Titlebook: Selected Areas in Cryptography -- SAC 2013; 20th International C Tanja Lange,Kristin Lauter,Petr Lisoněk Conference proceedings 2014 Spring

平項(xiàng)山

Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardwareo far it is known for solid security reductions but implementations of specific instances have often been reported to be too complex beyond any practicability. In this work, we present an efficient and scalable micro-code engine for Ring-LWE encryption that combines polynomial multiplication based o

glucagon

Practical Approaches to Varying Network Size in Combinatorial Key Predistribution Schemesnsor network. Such schemes often inherently suit networks in which the number of nodes belongs to some restricted set of values (such as powers of primes). In a recent paper, Bose, Dey and Mukerjee have suggested that this might pose a problem, since discarding keyrings to suit a smaller network mig

連累

A Group Action on , and the Generalized DLP with Auxiliary Inputsor of a group of order .. In this paper, we introduce a generalized version of this problem, so called the generalized DLPwAI?(GDLPwAI) problem which is asked to compute . for given ., and propose an efficient algorithm when . is a multiplicative subgroup of .. Although the previous algorithms can o

RACE

不幸的人

How to Recover Any Byte of Plaintext on RC4ferent user keys. Their attack is able to recover first 1000 terabytes of a plaintext with probability of almost one, given . ciphertexts encrypted by different keys. Since their attack essentially exploits biases in the initial (1st to 257th) bytes of the keystream, it does not work any more if suc

斗爭(zhēng)

The LOCAL Attack: Cryptanalysis of the Authenticated Encryption Scheme ALE same number of authentication attempts. We use a differential attack based on a local collision, which exploits the availability of extracted state bytes to the adversary. Our approach allows for a time-data complexity tradeoff, with an extreme case of a forgery produced after . attempts and based

DOLT

AEGIS: A Fast Authenticated Encryption Algorithmtable for protecting network packets. AEGIS-128 uses five AES round functions to process a 16-byte message block (one step); AES-256 uses six AES round functions. The security analysis shows that both algorithms offer a high level of security. On the Intel Sandy Bridge Core i5 processor, the speed o

詞匯表

Fast Exhaustive Search for Quadratic Systems in , on FPGAss in 48 variables can be solved on a graphics processing unit (GPU) in 21?min. The research question that we would like to answer in this paper is how specifically designed hardware performs on this task. We approach the answer by solving multivariate quadratic systems on reconfigurable hardware, na

注入

compel