Publications associées à Camellia (algorithme)

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.

Cryptanalysis of the full MMB block cipher

Jorge Nakahara, Yue Sun

The block cipher MMB was designed by Daemen, Govaerts and Vandewalle, in 1993, as an alternative to the IDEA block cipher. We exploit and describe unusual properties of the modular multiplication in

Z_{2^{32} - 1}

, which lead to a differential attack on ...

2009

Camellia (algorithme)

Graph Chatbot

Chattez avec Graph Search

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Inverse Gating for Low Energy Encryption

Breaking The FF3 Format-Preserving Encryption Standard Over Small Domains

The Programmable Logic-in-Memory (PLiM) Computer (Invited)

Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in $\mathbb{F}_{2^{4 \cdot 1223}}$ and $\mathbb{F}_{2^{12 \cdot 367}}$)

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

Cryptanalysis of the full MMB block cipher

Cryptanalysis of the full MMB Block Cipher

Provable security for block ciphers by decorrelation

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Inverse Gating for Low Energy Encryption

The Programmable Logic-in-Memory (PLiM) Computer (Invited)

Cryptanalysis of the full MMB block cipher

Cryptanalysis of the full MMB Block Cipher

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

Breaking The FF3 Format-Preserving Encryption Standard Over Small Domains

Provable security for block ciphers by decorrelation

Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in $\mathbb{F}_{2^{4 \cdot 1223}}$ and $\mathbb{F}_{2^{12 \cdot 367}}$)