A Smart Card Implementation of the McEliece PKC

Strenzke, Falko

doi:10.1007/978-3-642-12368-9_4

Cited by 18 publications

(16 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…S t r e n z k e in [60] describes an implementation of MECS on a smart card with an Infineon SLE 76 chip. Strenzke tested two instances of MECS based on irreducible Goppa codes with systematic public key: m = 10, n = 1024, t = 40 errors (62-bit security, 93kB key structures), and m = 11, n = 2048, t = 50 (102-bit security, 257 kB key structures).…”

Section: Mecs On Embedded and Hardware Platformmentioning

confidence: 99%

Overview of the Mceliece Cryptosystem and its Security

Repka

Zajac

2014

Tatra Mountains Mathematical Publications

View full text Add to dashboard Cite

ABSTRACT. McEliece cryptosystem (MECS) is one of the oldest public key cryptosystems, and the oldest PKC that is conjectured to be post-quantum secure. In this paper we survey the current state of the implementation issues and security of MECS, and its variants. In the first part we focus on general decoding problem, structural attacks, and the selection of parameters in general. We summarize the details of MECS based on irreducible binary Goppa codes, and review some of the implementation challenges for this system. Furthermore, we survey various proposals that use alternative codes for MECS, and point out some attacks on modified systems. Finally, we review notable existing implementations on low-resource platforms, and conclude with the topic of side channels in the implementations of MECS.

show abstract

Section: Mecs On Embedded and Hardware Platformmentioning

confidence: 99%

Overview of the Mceliece Cryptosystem and its Security

Repka

Zajac

2014

Tatra Mountains Mathematical Publications

View full text Add to dashboard Cite

show abstract

“…The first truly practical scheme using error-correcting codes is due to J. Stern [101]. The scheme uses a fixed binary (k, n) parity check matrix H which is common to all users.…”

Section: Stern's Schemementioning

confidence: 99%

Code Based Cryptography and Steganography

Véron

2013

Algebraic Informatics

View full text Add to dashboard Cite

“…The second part of this work shows a solution for the McEliece private key, which in previously published implementations [21,18,19,22] of the McEliece PKC features the parity check matrix, the size of which is similar to that of the McEliece public key. The benefit of the parity check matrix, which is not an essential part of the private key, but a precomputation that allows faster computation of the so called syndrome vector.…”

Section: Introductionmentioning

confidence: 99%

“…Specifically, the public keys will be at least 100 KB large for reasonable security parameters, as we will see in Section 2.2. For instance, the works [18,19,20] all describe implementations of code-based encryption schemes on embedded devices, where the public key is stored in the devices NVM. The drawbacks of storing such an amount of data in the device's NVM are first of all the cost of keeping such a large amount of memory available for this purpose and also the much slower writing speed compared to RAM access.…”

Section: Introductionmentioning

confidence: 99%

Solutions for the Storage Problem of McEliece Public and Private Keys on Memory-Constrained Platforms

Strenzke

2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. While it is generally believed that due to their large public and private key sizes code based public key schemes like the McEliece PKC cannot be conveniently implemented on memory-constrained devices, we demonstrate otherwise. We show that for the public key we face rather a transmission problem than a storage problem: we propose an approach for Public Key Infrastructure (PKI) scenarios which totally eliminates the need to store public keys of communication partners. Instead, all the necessary computation steps are performed during the transmission of the key. We show the feasibility of the approach through an example implementation and give arguments that it will be possible for a smart card controller to carry out the associated computations fast enough to sustain the transmission rates of possible future high speed contactless interfaces. Concerning the McEliece private key, we demonstrate, contrasting to previously published implementations, that the parity check matrix, which is by far the largest part of this key, is not necessary to achieve fast decryption on embedded systems.

show abstract

A Smart Card Implementation of the McEliece PKC

Cited by 18 publications

References 15 publications

Overview of the Mceliece Cryptosystem and its Security

Overview of the Mceliece Cryptosystem and its Security

Code Based Cryptography and Steganography

Solutions for the Storage Problem of McEliece Public and Private Keys on Memory-Constrained Platforms

Contact Info

Product

Resources

About