최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기Advances in mathematics of communications, v.16 no.3, 2022년, pp.621 -
Wafo-Tapa, Guillaume (Worldline, ZI Rue de la pointe, 59113 Seclin, France) , Bettaieb, Slim (Worldline, ZI Rue de la pointe, 59113 Seclin, France) , Bidoux, Loïc (Worldline, ZI Rue de la pointe, 59113 Seclin, France) , Gaborit, Philippe (University of Limoges, XLIM-DMI, 123, Av. Albert Thomas, 87060 Limoges, France) , Marcatel, Etienne (Atos Trustway, Avenue Jean Jaurè)
In this paper, we present a practicable chosen ciphertext timing attack retrieving the secret key of HQC. The attack exploits a correlation between the weight of the error to be decoded and the running time of the decoding algorithm of BCH codes. For the 128-bit security parameters of HQC, the attac...
C. Aguilar-Melchor, N. Aragon, S. Bettaieb, L. Bidoux, O. Blazy, J.-C. Deneuville, P. Gaborit, E. Persichetti and G. Zémor, Hamming Quasi-Cyclic (HQC) , 2017.
C. Aguilar-Melchor, N. Aragon, S. Bettaieb, L. Bidoux, O. Blazy, J.-C. Deneuville, P. Gaborit and G. Zémor, Rank Quasi-Cyclic (RQC) , 2017.
C. Aguilar-Melchor, O. Blazy, J.-C. Deneuville, P. Gaborit, G. Zémor.Efficient encryption from random quasi-cyclic codes, IEEE Transactions on Information Theory , 64 (2018), 3927-3943. 10.1109/TIT.2018.2804444
E. R. Berlekamp, Non-binary BCH Decoding , Technical report, North Carolina State University. Dept. of Statistics, 1966.
D. J. Bernstein, T. Chou and P. Schwabe, Mcbits: Fast constant-time code-based cryptography, in International Workshop on Cryptographic Hardware and Embedded Systems , Springer, (2013), 250-272. 10.1007/978-3-642-40349-1_15
R. Chandra. Bose, D. K. Ray-Chaudhuri.On a class of error correcting binary group codes, Information and Control , 3 (1960), 68-79. 10.1016/S0019-9958(60)90287-4
J.-P. D'Anvers, F. Vercauteren and Ingrid Verbauwhede, On the impact of decryption failures on the security of LWE/LWR based schemes, IACR Cryptology ePrint Archive, (2018), 1089.
È. M. Gabidulin.Theory of codes with maximum rank distance, Problemy Peredachi Informatsii , 21 (1985), 3-16.
S. Gao, T. Mateer.Additive fast fourier transforms over finite fields, IEEE Transactions on Information Theory , 56 (2010), 6265-6272. 10.1109/TIT.2010.2079016
A. Hocquenghem.Codes correcteurs d'erreurs, Chiffres , 2 (1959), 147-156.
S. Lin and D. J. Costello, in Error control coding , Prentice Hall Englewood Cliffs, (2004).,
X. Lu, Y. Liu, Z. Zhang, D. Jia, H. Xue, J. He, B. Li, K. Wang, Z. Liu and H. Yang, LAC: Practical Ring-LWE based Public-Key Encryption with Byte-Level Modulus, IACR Cryptology ePrint Archive, (2018), 1009.
10.1049/ip-i-2.1991.0018 Y. Xu.Implementation of Berlekamp-Massey algorithm without inversion, IEE Proceedings I-Communications, Speech and Vision , 138 (1991), 138-140.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
오픈액세스 학술지에 출판된 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.