New Design of Blockwise Interleaved Ideal Low-Rank Parity-Check Codes for Fast Post-Quantum Cryptography-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

New Design of Blockwise Interleaved Ideal Low-Rank Parity-Check Codes for Fast Post-Quantum Cryptography

Published:2023-05 Issue:5 Volume:27 Page:1277-1281
ISSN:1089-7798
Container-title:IEEE Communications Letters
language:
Short-container-title:IEEE Commun. Lett.

Author:

Kim Chanki¹^ORCID,Kim Young-Sik²^ORCID,No Jong-Seon³^ORCID

Affiliation:

1. Department of Computer Science and Artificial Intelligence, Jeonbuk National University, Deokjin-gu, Jeollabuk-do, Jeonjusi, Republic of Korea

2. Department of Information and Communication Engineering, Chosun University, Gwangju, Republic of Korea

3. Department of Electrical and Computer Engineering INMC, Seoul National University, Seoul, Republic of Korea

Funder

Korea government (MSIT)

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Electrical and Electronic Engineering,Computer Science Applications,Modeling and Simulation

Link

http://xplorestaging.ieee.org/ielx7/4234/10122472/10068546.pdf?arnumber=10068546

Reference12 articles.

1. On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes

2. Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography

3. The rank-based cryptography library;aragon;Proc Code-Based Cryptogr Workshop (CBCrypto),2021

4. Code-based cryptosystems using generalized concatenated codes;puchinger;Applications of Computer Algebra,2015

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP