304 research outputs found
Sloppy Alice attacks! Adaptive chosen ciphertext attacks on the McEliece Public-Key Cryptosystem
No full textWe introduce new adaptive chosen ciphertext attacks, called Sloppy Alic Attacks, in which a malicious sender or an adaptive eavesdropper Eve has an oracle which allows her to find out whether a sent encrypted message does, or does not, decrypt properly. From this information she can extract the plaintext that was encrypted. In this paper we show that the McEliece public-key cryptosystem is susceptible to Sloppy Alice attacks
(23,6,5,10) G(23,6,10) =
No full text20) In [13], van Tilborg proved that the [24,5,12] code is unique with weight set {12,16}. Therefore, the weight set of a [23,5,11] code is a subset of {11,12,15,16} and by Theorem 5 it follows that the state complexity of a [23,5,11] code is 5. 21) The matrix G(23,6,10) generates a code with parameter
Results to get Maximal Quasihermitian Curves. New possibilities for AG Codes
No full textFor Quasihermitian curves defined over F₂, with genus g ≥ 1, we present sufficient conditions for getting maximal curves on F₂_(2g). This shows a way to obtain good AG Codes from this class of curves
- …
