检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

121 篇 会议
83 篇 期刊文献
4 篇 学位论文

馆藏范围

208 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

198 篇 工学
- 177 篇 计算机科学与技术...
- 51 篇 电气工程
- 29 篇 信息与通信工程
- 22 篇 软件工程
- 5 篇 电子科学与技术（可...
- 3 篇 网络空间安全
- 2 篇 控制科学与工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 材料科学与工程（可...
94 篇 理学
- 83 篇 数学
- 15 篇 物理学
- 1 篇 科学技术史(分学科...
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 1 篇 公共管理
1 篇 军事学
- 1 篇 军队指挥学

主题

208 篇 code-based crypt...
63 篇 post-quantum cry...
18 篇 rank metric
15 篇 information set ...
13 篇 decoding
13 篇 mceliece cryptos...
12 篇 digital signatur...
12 篇 cryptanalysis
12 篇 fpga
12 篇 syndrome decodin...
11 篇 public-key encry...
11 篇 post quantum cry...
11 篇 gabidulin codes
8 篇 digital signatur...
8 篇 provable securit...
7 篇 qc-mdpc codes
7 篇 syndrome decodin...
6 篇 rank-metric code...
6 篇 coding theory
6 篇 key recovery att...

机构

7 篇 technol innovat ...
7 篇 natl univ singap...
6 篇 aurel vlaicu uni...
6 篇 univ limoges lim...
5 篇 florida atlantic...
4 篇 city univ hong k...
4 篇 politecn milan m...
4 篇 nankai univ cher...
3 篇 univ limoges xli...
3 篇 tech univ munich...
3 篇 sandboxaq palo a...
3 篇 inria rocquencou...
3 篇 univ politecn ma...
3 篇 sun yat sen univ...
3 篇 ruhr univ bochum...
3 篇 nankai univ lpmc...
3 篇 tech univ munich...
2 篇 natl res univ hi...
2 篇 tech univ munich...
2 篇 guangdong key la...

作者

17 篇 gaborit philippe
13 篇 cayrel pierre-lo...
10 篇 wachter-zeh anto...
10 篇 santini paolo
9 篇 baldi marco
9 篇 lau terry shue c...
8 篇 tan chik how
8 篇 renner julian
7 篇 bellini emanuele
7 篇 tillich jean-pie...
7 篇 chiaraluce franc...
6 篇 aragon nicolas
6 篇 couvreur alain
6 篇 gueye cheikh thi...
6 篇 puchinger sven
6 篇 persichetti edoa...
6 篇 barenghi alessan...
6 篇 pelosi gerardo
6 篇 mateu victor
5 篇 assidi hafsa

语言

203 篇 英文
4 篇 其他
1 篇 中文

检索条件"主题词=code-based cryptography"

共 208 条记录，以下是91-100 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

On Decoding and Applications of Interleaved Goppa codes

On Decoding and Applications of Interleaved Goppa Codes

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Holzbaur, Lukas Liu, Hedongliang Puchinger, Sven Wachter-Zeh, Antonia TUM Inst Commun Engn Munich Germany

ISBN: (纸本)9781538692912

Goppa codes are a well-known class of codes with, among others, applications in code-based cryptography. In this paper, we present a collaborative decoding algorithm for interleaved Goppa codes (IGC). Collaborative decoding increases the decoding radius beyond half of the designed minimum distance. We consider wild Goppa codes and show that we can collaboratively correct more errors for binary Goppa codes than the Patterson decoder. We propose a modified version of the McEliece cryptosystem using wild IGC based on a recently proposed system by Elleuch et al., analyze attacks on the system and present some parameters with the corresponding key sizes.

关键词： Interleaved Goppa codes decoding public-key cryptosystem code-based cryptography McEliece system

来源：评论

学校读者我要写书评

暂无评论

FPGA-based Key Generator for the Niederreiter Cryptosystem Using Binary Goppa codes 19th

FPGA-based Key Generator for the Niederreiter Cryptosystem U...

引用

19th International Conference on Cryptographic Hardware and Embedded Systems (CHES)

作者： Wang, Wen Szefer, Jakub Niederhagen, Ruben Yale Univ New Haven CT 06511 USA Fraunhofer Inst SIT Darmstadt Germany

ISBN: (纸本)9783319667874;9783319667867

This paper presents a post-quantum secure, efficient, and tunable FPGA implementation of the key-generation algorithm for the Niederreiter cryptosystem using binary Goppa codes. Our key-generator implementation requires as few as 896,052 cycles to produce both public and private portions of a key, and can achieve an estimated frequency Fmax of over 240MHz when synthesized for Stratix V FPGAs. To the best of our knowledge, this work is the first hardware-based implementation that works with parameters equivalent to, or exceeding, the recommended 128-bit "post-quantum security" level. The key generator can produce a key pair for parameters m = 13, t = 119, and n = 6960 in only 3.7 ms when no systemization failure occurs, and in 3.5 . 3.7 ms on average. To achieve such performance, we implemented an optimized and parameterized Gaussian systemizer for matrix systemization, which works for any large-sized matrix over any binary field GF(2m). Our work also presents an FPGA-based implementation of the Gao-Mateer additive FFT, which only takes about 1000 clock cycles to finish the evaluation of a degree-119 polynomial at 213 data points. The Verilog HDL code of our key generator is parameterized and partly code-generated using Python and Sage. It can be synthesized for different parameters, not just the ones shown in this paper. We tested the design using a Sage reference implementation, iVerilog simulation, and on real FPGA hardware.

关键词： Post-Quantum cryptography code-based cryptography Niederreiter key generation FPGA Hardware implementation

来源：评论

学校读者我要写书评

暂无评论

A Polynomial-Time Attack on the BBCRS Scheme 18

A Polynomial-Time Attack on the BBCRS Scheme

引用

18th IACR International Conference on Practice and Theory in Public-Key cryptography (PKC)

作者： Couvreur, Alain Otmani, Ayoub Tillich, Jean-Pierre Gauthier-Umana, Valerie INRIA Secret Team F-78153 Le Chesnay France INRIA Grace Team 1 Rue H dEstienne dOrves F-91120 Palaiseau France Ecole Polytech Grace Team F-91120 Palaiseau France Ecole Polytech LIX CNRS UMR 7161 F-91120 Palaiseau France Univ Rouen LITIS F-76821 Mont St Aignan France Univ Rosario Dept Math Fac Nat Sci & Math Bogota Colombia

ISBN: (纸本)9783662464472;9783662464465

The BBCRS scheme is a variant of the McEliece public-key encryption scheme where the hiding phase is performed by taking the inverse of a matrix which is of the form T vertical bar R where T is a sparse matrix with average row/column weight equal to a very small quantity m, usually m < 2, and R is a matrix of small rank z >= 1. The rationale of this new transformation is the reintroduction of families of codes, like generalized Reed-Solomon codes, that are famously known for representin insecure choices. We present a key-recovery attack when z = 1 and m is chosen between 1 and 1+ R+ O(1 /root n) where R denotes the code rate. This attack has complexity O( n(6)) and breaks all the parameters suggested in the literature.

关键词： code-based cryptography Distinguisher Generalized Reed-Solomon codes Key-recovery Component-wise product of codes

来源：评论

学校读者我要写书评

暂无评论

Zero Knowledge Protocols and Signatures from the Restricted Syndrome Decoding Problem 27th

Zero Knowledge Protocols and Signatures from the Restricted ...

引用

27th IACR International Conference on Practice and Theory of Public Key cryptography (PKC)

作者： Baldi, Marco Bitzer, Sebastian Pavoni, Alessio Santini, Paolo Wachter-Zeh, Antonia Weger, Violetta Polytech Univ Marche Dept Informat Engn Brecce Bianche 12 I-60131 Ancona Italy Tech Univ Munich Inst Commun Engn Theresienstr 90 D-80333 Munich Germany

ISBN: (纸本)9783031577215;9783031577222

The Restricted Syndrome Decoding Problem (R-SDP) corresponds to the Syndrome Decoding Problem (SDP) with the additional constraint that all entries of the solution error vector must live in a fixed subset of the finite field. In this paper, we study how this problem can be applied to the construction of signatures derived from Zero-Knowledge (ZK) protocols. First, we show that R-SDP appears to be well-suited for this type of application: ZK protocols relying on SDP can easily be modified to use R-SDP, resulting in significant reductions in the communication cost. We then introduce and analyze a variant of R-SDP, which we call R-SDP(G), with the property that solution vectors can be represented with a number of bits that is slightly larger than the security parameter (which clearly provides an ultimate lower bound). This enables the design of competitive ZK protocols. We show that existing ZK protocols can greatly benefit from the use of R-SDP, achieving signature sizes in the order of 7 kB, which are smaller than those of several other schemes submitted to NIST's additional call for post-quantum digital signatures.

关键词： code-based cryptography Post-Quantum cryptography Restricted Errors Signature Scheme Syndrome Decoding Problem

来源：评论

学校读者我要写书评

暂无评论

Weak Keys in the Faure-Loidreau Cryptosystem 1

引用

7th International Workshop on code-based cryptography (CBC)

作者： Jerkovits, Thomas Bartz, Hannes Deutsch Zentrum Luft & Raumfahrt DLR Inst Commun & Nav D-82234 Wessling Germany

ISBN: (数字)9783030259228

ISBN: (纸本)9783030259228;9783030259211

Some types of weak keys in the Faure-Loidreau (FL) cryptosystem are presented. We show that from such weak keys the private key can be reconstructed with a computational effort that is substantially lower than the security level (approximate to 2(25) operations for 80-bit security). The proposed key-recovery attack is based on ideas of generalized minimum distance (GMD) decoding for rank-metric codes.

关键词： code-based cryptography Rank-metric codes Interleaving Gabidulin codes Generalized minimum distance (GMD) decoding Post-quantum cryptography Faure-Loidreau

来源：评论

学校读者我要写书评

暂无评论

MURAVE: A New Rank code-based Signature with MUltiple RAnk VErification 1

引用

8th International Workshop on code-based cryptography (CBCrypto)

作者： Lau, Terry Shue Chien Tan, Chik How Natl Univ Singapore Temasek Labs 5A Engn Dr 1 09-02 Singapore 117411 Singapore

ISBN: (数字)9783030540746

ISBN: (纸本)9783030540746;9783030540739

We propose a new rank metric code-based signature scheme constructed via the Schnorr approach. Our scheme is designed in a way to avoid leakage of the information on the support for the secret key used in the signature generation. We define some new problems in rank metric code-based cryptography: the Rank Support Basis Decomposition problem and the Advanced Rank Support Basis Decomposition problem. We also discuss their hardness and solving complexity. Furthermore, we give a proof in the EUF-CMA security model, by reducing the security of our scheme to the Rank Syndrome Decoding problem, the Ideal LRPC codes Indistinguishability problem and the Decisional Rank Support Basis Decomposition problem. We analyze the practical security for our scheme against the known attacks on rank metric signature schemes. Our scheme is efficient in terms of key size (5.33 KB) and of signature sizes (9.69KB) at 128-bit classical security level.

关键词： Rank metric Digital signature scheme Provable security code-based cryptography

来源：评论

学校读者我要写书评

暂无评论

Identity-based Encryption from codes with Rank Metric 37th

Identity-Based Encryption from Codes with Rank Metric

引用

37th Annual International Cryptology Conference (Crypto)

作者： Gaborit, Philippe Hauteville, Adrien Duong Hieu Phan Tillich, Jean-Pierre Univ Limoges XLIM DMI 123 Av Albert Thomas F-87060 Limoges France Inria Paris 2 Rue Simone IffCS 42112 F-75589 Paris 12 France

ISBN: (纸本)9783319636979;9783319636962

code-based cryptography has a long history, almost as long as the history of public-key encryption (PKE). While we can construct almost all primitives from codes such as PKE, signature, group signature etc., it is a long standing open problem to construct an identity-based encryption from codes. We solve this problem by relying on codes with rank metric. The concept of identity-based encryption (IBE), introduced by Shamir in 1984, allows the use of users' identifier information such as email as public key for encryption. There are two problems that makes the design of IBE extremely hard: the requirement that the public key can be an arbitrary string and the possibility to extract decryption keys from the public keys. In fact, it took nearly twenty years for the problem of designing an efficient method to implement an IBE to be solved. The known methods of designing IBE are based on different tools: from elliptic curve pairings by Sakai, Ohgishi and Kasahara and by Boneh and Franklin in 2000 and 2001 respectively;from the quadratic residue problem by Cocks in 2001;and finally from the Learning-with-Error problem by Gentry, Peikert, and Vaikuntanathan in 2008. Among all candidates for post-quantum cryptography, there only exist thus lattice-based IBE. In this paper, we propose a new method, based on the hardness of learning problems with rank metric, to design the first code-based IBE scheme. In order to overcome the two above problems in designing an IBE scheme, we first construct a rank-based PKE, called RankPKE, where the public key space is dense and thus can be obtained from a hash of any identity. We then extract a decryption key from any public key by constructing an trapdoor function which relies on RankSign - a signature scheme from PQCrypto 2014. In order to prove the security of our schemes, we introduced a new problem for rank metric: the Rank Support Learning problem (RSL). A high technical contribution of the paper is devoted to study in details the hard

关键词： code-based cryptography Rank metric IBE PKE

来源：评论

学校读者我要写书评

暂无评论

Memory-Efficient Quantum Information Set Decoding Algorithm 28th

Memory-Efficient Quantum Information Set Decoding Algorithm

引用

28th Australasian Conference on Information Security and Privacy (ACISP)

作者： Kimura, Naoto Takayasu, Atsushi Takagi, Tsuyoshi Univ Tokyo Grad Sch Informat Sci & Technol Tokyo Japan Natl Inst Adv Ind Sci & Technol Tokyo Japan

ISBN: (纸本)9783031354854;9783031354861

code-based cryptography is a candidate for post-quantum cryptography and the security of code-based cryptosystems relate to the hardness of the syndrome decoding problem. The Information Set Decoding (ISD) algorithm initiated by Prange is a typical method for solving the syndrome decoding problem. Various methods have been proposed that make use of exponentially large lists to accelerate the ISD algorithm. Furthermore, Bernstein (PQCrypto 2010) and Kachigar and Tillich (PQCrypto 2017) applied Grover's algorithm and quantum walks to obtain quantum ISD algorithms that are much faster than their classical ones. These quantum ISD algorithms also require exponentially large lists as the classical algorithms, and they must be kept in quantum states. In this paper, we propose a new quantum ISD algorithm by combining Both and May's classical ISD algorithm (PQcrypto 2018), Grover's algorithm, and Kirshanova's quantum walk (PQCrypto 2018). The proposed algorithm keeps an exponentially large list in the quantum state just like the existing quantum ISD algorithms, but the list size is much smaller. Although the proposed algorithm is slower than the existing algorithms when there is sufficient quantum memory, it is fastest when the amount of quantum memory is limited. Due to the property, we believe that our algorithm will be the fastest ISD algorithm in actual quantum computing since large-scale quantum computers seem hard to realize.

关键词： code-based cryptography syndrome decoding problem information set decoding quantum algorithm

来源：评论

学校读者我要写书评

暂无评论

Key-Recovery by Side-Channel Information on the Matrix-Vector Product in code-based Cryptosystems 25th

Key-Recovery by Side-Channel Information on the Matrix-Vecto...

引用

25th International Conference on Information Security and Cryptology (ICISC)

作者： Seck, Boly Cayrel, Pierre-Louis Diop, Idy Dragoi, Vlad-Florin Couzon, Kalen Colombier, Brice Grosso, Vincent Lab Imagerie Med & Bioinformat ESP Dakar Senegal Univ Lyon CNRS Lab Hubert Curien UJM St EtienneUMR 5516 F-42023 St Etienne France Univ Versailles St Quentin Yvelines France Aurel Vlaicu Univ Arad Fac Exact Sci Arad Romania

ISBN: (纸本)9783031293702;9783031293719

The modern security protocols in most of our systems rely primarily on three basic functions of asymmetric cryptography: public key encryption, digital signature, and key exchange. Today, we only do key exchange (TLS 1.3) with the ECDH protocol. The confidentiality is persistent because the session keys are discarded at the end and to certify this key exchange, we sign it with RSA or ECDSA. However, these cryptosystems are at least theoretically attackable in a quantum computer model. Thus the NIST PQC standardization process has given significant momentum to research on code-based public-key cryptosystems specifically. Their security is based on the hardness of the syndrome decoding problem. In this article, we first propose a new formalism of the matrix-vector product in based-code cryptography. Second, we present a chosen-ciphertext attack on the first step of Niederreiter decryption by solving the matrix-vector product problem with side-channel information. Finally, we put this result to recover secret information in code-based cryptosystems including some candidates for the extension of the NIST PQC normalization process.

关键词： code-based cryptography Side-channel attack Matrix-vector product problem NIST PQC standardization

来源：评论

学校读者我要写书评

暂无评论

Encryption Schemes Using Random Oracles: From Classical to Post-Quantum Security 11th

Encryption Schemes Using Random Oracles: From Classical to P...

引用

11th International Conference on Post-Quantum cryptography (PQCrypto)

作者： Kraemer, Juliane Struck, Patrick Tech Univ Darmstadt Darmstadt Germany

ISBN: (纸本)9783030442231;9783030442224

The security proofs of post-quantum cryptographic schemes often consider only classical adversaries. Therefore, whether such schemes are really post-quantum secure remains unknown until the proofs take quantum adversaries into account. Switching to a quantum adversary might require to adapt the security notion. In particular, post-quantum security proofs for schemes which use random oracles have to be in the quantum random oracle model (QROM), while classical security proofs are in the random oracle model (ROM). We remedy this state of affairs by introducing a framework to obtain post-quantum security of public key encryption schemes which use random oracles. We define a class of encryption schemes, called oracle-simple, and identify game hops which are used to prove such schemes secure in the ROM. For these game hops, we state both simple and sufficient conditions to validate that a proof also holds in the QROM. The strength of our framework lies in its simplicity, its generality, and its applicability. We demonstrate this by applying it to the code-based encryption scheme ROLLO-II (Round 2 NIST candidate) and the lattice-based encryption scheme LARA (FC 2019). Thereby we prove that both schemes are post-quantum secure, which had not been shown before.

关键词： QROM Game-based proofs code-based cryptography Lattice-based cryptography

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共21页 << < 6 7 8 9 10 11 12 13 14 15 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：