The security of McEliece public-key cryptosystem is based on the difficulty of the decoding problem which is NP-hard. In this paper we propose a timing attack on the Patterson Algorithm, which is used for efficient decoding in Goppa codes. The attack is based on the relation between the error vector weight and the iteration number of the extended Euclidean algorithm used in Patterson Algorithm. This attack enables the extraction of the secret error vector with minimal overhead. A countermeasure is proposed and verified for a FPGA implementation. © 2010 Springer-Verlag.
CITATION STYLE
Shoufan, A., Strenzke, F., Molter, H. G., & Stöttinger, M. (2010). A timing attack against Patterson algorithm in the McEliece PKC. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5984 LNCS, pp. 161–175). https://doi.org/10.1007/978-3-642-14423-3_12
Mendeley helps you to discover research relevant for your work.