Post-Quantum Cryptography最新文献

筛选
英文 中文
Post-Quantum Signatures in DNSSEC via Request-Based Fragmentation 基于请求分片的DNSSEC后量子签名
Post-Quantum Cryptography Pub Date : 2022-11-25 DOI: 10.48550/arXiv.2211.14196
Jason R. Goertzen, D. Stebila
{"title":"Post-Quantum Signatures in DNSSEC via Request-Based Fragmentation","authors":"Jason R. Goertzen, D. Stebila","doi":"10.48550/arXiv.2211.14196","DOIUrl":"https://doi.org/10.48550/arXiv.2211.14196","url":null,"abstract":"The Domain Name System Security Extensions (DNSSEC) provide authentication of DNS responses using digital signatures. DNS operates primarily over UDP, which leads to several constraints: notably, packets should be at most 1232 bytes long to avoid problems during transmission. Larger DNS responses either need to be fragmented into several UDP responses or the request would need to be repeated over TCP, neither of which is sufficiently reliable in today's DNS ecosystem. While RSA or elliptic curve digital signatures are sufficiently small to avoid this problem, even for DNSSEC packets containing both a public key and a signature, this problem is unavoidable when considering the larger sizes of post-quantum schemes. We propose ARRF, a method of fragmenting DNS resource records at the application layer (rather than the transport layer) that is request-based, meaning the initial response contains a truncated fragment and then the requester sends follow-up requests for the remaining fragments. Using request-based fragmentation avoids problems identified for several previously proposed (and rejected) application-level DNS fragmentation techniques. We implement our approach and evaluate its performance in a simulated network when used for the three post-quantum digital signature schemes selected by NIST for standardization (Falcon, Dilithium, and SPHINCS+) at the 128-bit security level. Our experiments show that our request-based fragmentation approach provides substantially lower resolution times compared to standard DNS over UDP with TCP fallback, for all the tested post-quantum algorithms, and with less data transmitted in the case of both Falcon and Dilithium. Furthermore, our request-based fragmentation design can be implemented relatively easily: our implementation is in fact a small daemon that can sit in front of a DNS name server or resolver to fragment/reassemble transparently.","PeriodicalId":228749,"journal":{"name":"Post-Quantum Cryptography","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124817749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Improvement of algebraic attacks for solving superdetermined MinRank instances 求解超确定MinRank实例的代数攻击改进
Post-Quantum Cryptography Pub Date : 2022-08-02 DOI: 10.48550/arXiv.2208.01442
M. Bardet, Manon Bertin
{"title":"Improvement of algebraic attacks for solving superdetermined MinRank instances","authors":"M. Bardet, Manon Bertin","doi":"10.48550/arXiv.2208.01442","DOIUrl":"https://doi.org/10.48550/arXiv.2208.01442","url":null,"abstract":"The MinRank (MR) problem is a computational problem that arises in many cryptographic applications. In Verbel et al. [24], the authors introduced a new way to solve superdetermined instances of the MinRank problem, starting from the bilinear Kipnis-Shamir (KS) modeling. They use linear algebra on specific Macaulay matrices, considering only multiples of the initial equations by one block of variables, the so called “kernel” variables. Later, Bardet et al. [7] introduced a new Support Minors modeling (SM), that consider the Plücker coordinates associated to the kernel variables, i.e. the maximal minors of the Kernel matrix in the KS modeling. In this paper, we give a complete algebraic explanation of the link between the (KS) and (SM) modelings (for any instance). We then show that superdetermined MinRank instances can be seen as easy instances of the SM modeling. In particular, we show that performing computation at the smallest possible degree (the “first degree fall”) and the smallest possible number of variables is not always the best strategy. We give complexity estimates of the attack for generic random instances. We apply those results to the DAGS cryptosystem, that was submitted to the first round of the NIST standardization process. We show that the algebraic attack from Barelli and Couvreur [8], improved in Bardet et al. [5], is a particular superdetermined MinRank instance. Here, the instances are not generic, but we show that it is possible to analyse the particular instances from DAGS and provide a way to select the optimal parameters (number of shortened positions) to solve a particular instance.","PeriodicalId":228749,"journal":{"name":"Post-Quantum Cryptography","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131189188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Time and Query Complexity Tradeoffs for the Dihedral Coset Problem 二面体协集问题的时间和查询复杂度权衡
Post-Quantum Cryptography Pub Date : 2022-06-29 DOI: 10.1007/978-3-031-40003-2_19
Maxime Remaud, A. Schrottenloher, J. Tillich
{"title":"Time and Query Complexity Tradeoffs for the Dihedral Coset Problem","authors":"Maxime Remaud, A. Schrottenloher, J. Tillich","doi":"10.1007/978-3-031-40003-2_19","DOIUrl":"https://doi.org/10.1007/978-3-031-40003-2_19","url":null,"abstract":"","PeriodicalId":228749,"journal":{"name":"Post-Quantum Cryptography","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129780839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
LRPC codes with multiple syndromes: near ideal-size KEMs without ideals 具有多综合征的LRPC代码:接近理想大小的没有理想的kem
Post-Quantum Cryptography Pub Date : 2022-06-23 DOI: 10.48550/arXiv.2206.11961
C. A. Melchor, Nicolas Aragon, Victor Dyseryn, P. Gaborit, Gilles Z'emor
{"title":"LRPC codes with multiple syndromes: near ideal-size KEMs without ideals","authors":"C. A. Melchor, Nicolas Aragon, Victor Dyseryn, P. Gaborit, Gilles Z'emor","doi":"10.48550/arXiv.2206.11961","DOIUrl":"https://doi.org/10.48550/arXiv.2206.11961","url":null,"abstract":"We introduce a new rank-based key encapsulation mechanism (KEM) with public key and ciphertext sizes around 3.5 Kbytes each, for 128 bits of security, without using ideal structures. Such structures allow to compress objects, but give reductions to specific problems whose security is potentially weaker than for unstructured problems. To the best of our knowledge, our scheme improves in size all the existing unstructured post-quantum lattice or code-based algorithms such as FrodoKEM or Classic McEliece. Our technique, whose efficiency relies on properties of rank metric, is to build upon existing Low Rank Parity Check (LRPC) code-based KEMs and to send multiple syndromes in one ciphertext, allowing to reduce the parameters and still obtain an acceptable decoding failure rate. Our system relies on the hardness of the Rank Support Learning problem, a well-known variant of the Rank Syndrome Decoding problem. The gain on parameters is enough to significantly close the gap between ideal and non-ideal constructions. It enables to choose an error weight close to the rank Gilbert-Varshamov bound, which is a relatively harder zone for algebraic attacks. We also give a version of our KEM that keeps an ideal structure and permits to roughly divide the bandwidth by two compared to previous versions of LRPC KEMs submitted to the NIST with a Decoding Failure Rate (DFR) of $2^{-128}$.","PeriodicalId":228749,"journal":{"name":"Post-Quantum Cryptography","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115710327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Interleaved Prange: A New Generic Decoder for Interleaved Codes 交错区间:一种新的交错码通用解码器
Post-Quantum Cryptography Pub Date : 2022-05-27 DOI: 10.48550/arXiv.2205.14068
Anmoal Porwal, Lukas Holzbaur, Hedongliang Liu, Julian Renner, A. Wachter-Zeh, Violetta Weger
{"title":"Interleaved Prange: A New Generic Decoder for Interleaved Codes","authors":"Anmoal Porwal, Lukas Holzbaur, Hedongliang Liu, Julian Renner, A. Wachter-Zeh, Violetta Weger","doi":"10.48550/arXiv.2205.14068","DOIUrl":"https://doi.org/10.48550/arXiv.2205.14068","url":null,"abstract":"Due to the recent challenges in post-quantum cryptography, several new approaches for code-based cryptography have been proposed. For example, a variant of the McEliece cryptosystem based on interleaved codes was proposed. In order to deem such new settings secure, we first need to understand and analyze the complexity of the underlying problem, in this case the problem of decoding a random interleaved code. A simple approach to decode such codes, would be to randomly choose a vector in the row span of the received matrix and run a classical information set decoding algorithm on this erroneous codeword. In this paper, we propose a new generic decoder for interleaved codes, which is an adaption of the classical idea of information set decoding by Prange and perfectly fits the interleaved setting. We then analyze the cost of the new algorithm and a comparison to the simple approach described above shows the superiority of Interleaved Prange.","PeriodicalId":228749,"journal":{"name":"Post-Quantum Cryptography","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134061858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Generating Cryptographically-Strong Random Lattice Bases and Recognizing Rotations of $mathbb {Z}^n$ 生成密码强随机格基和识别$mathbb {Z}^n$的旋转
Post-Quantum Cryptography Pub Date : 2021-02-12 DOI: 10.1007/978-3-030-81293-5_17
Tamar Lichter Blanks, S. Miller
{"title":"Generating Cryptographically-Strong Random Lattice Bases and Recognizing Rotations of $mathbb {Z}^n$","authors":"Tamar Lichter Blanks, S. Miller","doi":"10.1007/978-3-030-81293-5_17","DOIUrl":"https://doi.org/10.1007/978-3-030-81293-5_17","url":null,"abstract":"","PeriodicalId":228749,"journal":{"name":"Post-Quantum Cryptography","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123088778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Rank Attack Against Extension Field Cancellation 对扩展域取消的秩攻击
Post-Quantum Cryptography Pub Date : 2020-04-15 DOI: 10.1007/978-3-030-44223-1_21
Daniel Smith-Tone, Javier A. Verbel
{"title":"A Rank Attack Against Extension Field Cancellation","authors":"Daniel Smith-Tone, Javier A. Verbel","doi":"10.1007/978-3-030-44223-1_21","DOIUrl":"https://doi.org/10.1007/978-3-030-44223-1_21","url":null,"abstract":"","PeriodicalId":228749,"journal":{"name":"Post-Quantum Cryptography","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126716781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption 二秘多项式同构的推广及其在公钥加密中的应用
Post-Quantum Cryptography Pub Date : 2020-04-15 DOI: 10.1007/978-3-030-44223-1_19
Bagus Santoso
{"title":"Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption","authors":"Bagus Santoso","doi":"10.1007/978-3-030-44223-1_19","DOIUrl":"https://doi.org/10.1007/978-3-030-44223-1_19","url":null,"abstract":"","PeriodicalId":228749,"journal":{"name":"Post-Quantum Cryptography","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121341249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions 基于后量子和时间经典假设的紧凑隐私协议
Post-Quantum Cryptography Pub Date : 2020-04-15 DOI: 10.1007/978-3-030-44223-1_13
Jonathan Bootle, Anja Lehmann, Vadim Lyubashevsky, Gregor Seiler
{"title":"Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions","authors":"Jonathan Bootle, Anja Lehmann, Vadim Lyubashevsky, Gregor Seiler","doi":"10.1007/978-3-030-44223-1_13","DOIUrl":"https://doi.org/10.1007/978-3-030-44223-1_13","url":null,"abstract":"","PeriodicalId":228749,"journal":{"name":"Post-Quantum Cryptography","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121610691","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability 基于可分性的3型广义Feistel网络的量子区分符
Post-Quantum Cryptography Pub Date : 2020-04-15 DOI: 10.1007/978-3-030-44223-1_25
S. Hodžić, L. Knudsen, Andreas B. Kidmose
{"title":"On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability","authors":"S. Hodžić, L. Knudsen, Andreas B. Kidmose","doi":"10.1007/978-3-030-44223-1_25","DOIUrl":"https://doi.org/10.1007/978-3-030-44223-1_25","url":null,"abstract":"","PeriodicalId":228749,"journal":{"name":"Post-Quantum Cryptography","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126142465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书