2,013 research outputs found
Worst case QC-MDPC decoder for McEliece cryptosystem
McEliece encryption scheme which enjoys relatively small key sizes as well as
a security reduction to hard problems of coding theory. Furthermore, it remains
secure against a quantum adversary and is very well suited to low cost
implementations on embedded devices.
Decoding MDPC codes is achieved with the (iterative) bit flipping algorithm,
as for LDPC codes. Variable time decoders might leak some information on the
code structure (that is on the sparse parity check equations) and must be
avoided. A constant time decoder is easy to emulate, but its running time
depends on the worst case rather than on the average case. So far
implementations were focused on minimizing the average cost. We show that the
tuning of the algorithm is not the same to reduce the maximal number of
iterations as for reducing the average cost. This provides some indications on
how to engineer the QC-MDPC-McEliece scheme to resist a timing side-channel
attack.Comment: 5 pages, conference ISIT 201
Error Function Attack of chaos synchronization based encryption schemes
Different chaos synchronization based encryption schemes are reviewed and
compared from the practical point of view. As an efficient cryptanalysis tool
for chaos encryption, a proposal based on the Error Function Attack is
presented systematically and used to evaluate system security. We define a
quantitative measure (Quality Factor) of the effective applicability of a chaos
encryption scheme, which takes into account the security, the encryption speed,
and the robustness against channel noise. A comparison is made of several
encryption schemes and it is found that a scheme based on one-way coupled
chaotic map lattices performs outstandingly well, as judged from Quality
Factor
- …