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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是81-90 订阅

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

详细简洁

排序：

FPGA implementation of BIKE for quantum-resistant TLS 25

FPGA implementation of BIKE for quantum-resistant TLS

引用

25th Euromicro Conference on Digital System Design (DSD)

作者： Galimberti, Andrea Galli, Davide Montanaro, Gabriele Fornaciari, William Zoni, Davide Politecn Milan DEIB Milan Italy

ISBN: (纸本)9781665474047

The recent advances in quantum computers impose the adoption of post-quantum cryptosystems into secure communication protocols. This work proposes two FPGA-based, client- and server-side hardware architectures to support the integration of the BIKE post-quantum KEM within TLS. Thanks to the parametric hardware design, the paper explores the best option between hardware and software implementations, given a set of available hardware resources and a realistic use-case scenario. The experimental evaluation comparing our client and server designs against the reference AVX2 and hardware implementations of BIKE highlighted two aspects. First, the proposed client and server architectures outperform the reference hardware implementation of BIKE by eight and four times, respectively. Second, the performance comparison between our client and server designs against the reference AVX2 implementation strongly depends on the available resource. Our solution is almost twice as fast as the AVX2 implementation while implemented on the Artix-7 200 FPGA, while it is up to six times slower when targeting smaller FPGAs, thus motivating a careful analysis of the available hardware resources and the optimization of the design's parallelism before opting for hardware support.

关键词： Post-quantum cryptography code-based cryptography QC-MDPC codes hardware accelerators BIKE FPGA

来源：评论

学校读者我要写书评

暂无评论

An IND-CCA-Secure code-based Encryption Scheme Using Rank Metric 1

引用

11th International Conference on the Theory and Application of Cryptographic Techniques in Africa (AFRICACRYPT)

作者： Al Shehhi, Hamad Bellini, Emanuele Borba, Filipe Caullery, Florian Manzano, Marc Mateu, Victor Darkmatter LLC Abu Dhabi U Arab Emirates Univ Fed Santa Catarina Florianopolis SC Brazil

ISBN: (数字)9783030236960

ISBN: (纸本)9783030236953;9783030236960

The use of rank instead of Hamming metric has been proposed to address the main drawback of code-based cryptography: large key sizes. There exist several Key Encapsulation Mechanisms (KEM) and Public Key Encryption (PKE) schemes using rank metric including some submissions to the NIST call for standardization of Post-Quantum cryptography. In this work, we present an IND-CCA PKE scheme based on the McEliece adaptation to rank metric proposed by Loidreau at PQC 2017. This IND-CCA PKE scheme based on rank metric does not use a hybrid construction KEM + symmetric encryption. Instead, we take advantage of the bigger message space obtained by the different parameters chosen in rank metric, being able to exchange multiple keys in one ciphertext. Our proposal is designed considering some specific properties of the random error generated during the encryption. We prove our proposal IND-CCA-secure in the QROM by using a security notion called disjoint simulatability introduced by Saito et al. in Eurocrypt 2018. Moreover, we provide security bounds by using the semi-oracles introduced by Ambainis et al.

关键词： Post Quantum cryptography code-based cryptography Rank metric IND-CCA PKE QROM

来源：评论

学校读者我要写书评

暂无评论

Strong Designated Verifier Signature based on the Rank Metric 1

引用

13th International Conference on Information Security Theory and Practices (WISTP)

作者： Assidi, Hafsa Souidi, El Mamoun Mohammed V Univ Rabat Fac Sci Lab Math Comp Sci Applicat & Informat Secur BP 1014 RP Rabat 10000 Morocco

ISBN: (数字)9783030417024

ISBN: (纸本)9783030417017;9783030417024

Strong designated verifier signatures (SDVS) allows users to produce signatures that are not publicly verifiable, such that no one other than the signer and the designated verifier can check the validity of a given signature, which preserves the privacy of the signer. This cryptographic primitive is very useful in different real life scenarios such as e-voting and e-bidding. In this paper, we propose a strong designated verifier signature scheme (SDVS) based on rank metric error correcting codes. Our construction makes a trade-off between efficiency and security requirements, for instance we achieve a signature of size 3510 bits and a public key of size equal to 23088 bits for the 80 security level. Furthermore, our proposal is quantum computer resistant since it is based on coding theory.

关键词： Strong designated verifier signature Digital signature code-based cryptography LRPC codes Rank metric Post-quantum

来源：评论

学校读者我要写书评

暂无评论

A New Encryption Scheme based on Rank Metric codes 23rd

A New Encryption Scheme Based on Rank Metric Codes

引用

23rd Australasian Conference on Information Security and Privacy (ACISP)

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

ISBN: (纸本)9783319936383;9783319936376

We propose a rank metric codes based encryption based on the hard problem of rank syndrome decoding problem. We distort the matrix used for our encryption by adding a random distortion matrix over F-qm. We show that IND-CPA security is achievable for our encryption under assumption of Decisional Rank Syndrome Decoding problem. Our proposal allows the choice of the error terms with rank up to r/2, where r is the error-correcting capability of a code. Our encryption based on Gabidulin codes has public key size of 13.68 KB, which is 82 times smaller than the public key size of McEliece Cryptosystem based on Goppa codes. For similar post-quantum security level of 2(140) bits, our encryption scheme has smaller public key size than key size suggested by LOI17 Encryption [7].

关键词： code-based cryptography Public-key encryption McEliece Provable security

来源：评论

学校读者我要写书评

暂无评论

zk-SNARKs from codes with Rank Metrics 19th

zk-SNARKs from Codes with Rank Metrics

引用

19th IMA International Conference on cryptography and Coding (IMACC)

作者： Xuan-Thanh Do Dang-Truong Mac Quoc-Huy Vu Inst Cryptog Sci & Technol Hanoi Vietnam Leonard de Vinci Pole Univ Res Ctr Paris France

ISBN: (纸本)9783031478178;9783031478185

Succinct non-interactive zero-knowledge arguments of knowledge (zk-SNARKs) are a type of non-interactive proof system enabling efficient privacy-preserving proofs of membership for NP languages. A great deal of works has studied candidate constructions that are secure against quantum attackers, which are based on either lattice assumptions, or post-quantum collision-resistant hash functions. In this paper, we propose a code-based zk-SNARK scheme, whose security is based on the rank support learning (RSL) problem, a variant of the random linear code decoding problem in the rank metric. Our construction follows the general framework of Gennaro et al. (CCS'18), which is based on square span programs (SSPs). Due to the fundamental differences between the hardness assumptions, our proof of security cannot apply the techniques from the lattice-based constructions, and indeed, it distinguishes itself by the use of techniques from coding theory. We also provide the scheme with a set of concrete parameters.

关键词： code-based cryptography Rank support learning problem Square span programs zk-SNARKs

来源：评论

学校读者我要写书评

暂无评论

Quantum Circuit Design for the Lee-Brickell based Information Set Decoding

Quantum Circuit Design for the Lee-Brickell Based Informatio...

引用

22nd International Conference on Applied cryptography and Network Security (ACNS)

作者： Perriello, Simone Barenghi, Alessandro Pelosi, Gerardo Politecn Milan Dept Elect Informat & Bioengn DEIB I-20133 Milan Italy

ISBN: (纸本)9783031614880;9783031614897

In the race for quantum-safe cryptography, fostered by the ongoing National Institute of Standards and Technology (NIST) post-quantum standardization process, it is crucial to assess the security of the emerging schemes. In this work, we propose a fully quantum algorithm to accelerate the Lee-Brickell's Information Set Decoding (ISD)-one of the main cryptanalytic techniques used for assessing the security of code-based schemes-on binary error correcting codes. Our solution relies on a careful scheduling of the quantum gates included in the circuit design, coupled with a strategy that applies multiple times the oracle-reflection, from a Grover-like search, within a single Grover iteration. Compared with the state-of-the-art alternatives, our solution shows a reduction of the circuit depth ranging between 23 and 226, when considering the parameters sets for code-based cryptosystems advanced to the fourth round of the NIST process. Denoting as t and t - p the two sets of bit flips tackled by the Lee-Brickell's strategy, as an additional noteworthy fact we show that our solution exhibits 1 as the best value for p instead of 2 as it is the case for the classic ISD, for all concrete parameter sets considered.

关键词： code-based cryptography post-quantum cryptography quantum computing Information Set Decoding ISD

来源：评论

学校读者我要写书评

暂无评论

A Timing Attack against Patterson Algorithm in the McEliece PKC

A Timing Attack against Patterson Algorithm in the McEliece ...

引用

12th International Conference on Information Security and Cryptology

作者： Shoufan, Abdulhadi Strenzke, Falko Molter, H. Gregor Stoettinger, Marc Ctr Adv Secur Res Darmstadt CASED Darmstadt Germany FlexSecure GmbH Darmstadt Germany Tech Univ Darmstadt Dept Comp Sci Integrated Circuits & Syst Lab Darmstadt Germany

ISBN: (纸本)9783642144226

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.

关键词： Side channel attack timing attack post quantum cryptography code-based cryptography

来源：评论

学校读者我要写书评

暂无评论

Revocable Identity-based Encryption from codes with Rank Metric

Revocable Identity-Based Encryption from Codes with Rank Met...

引用

Cryptographers' Track at the RSA Conference (CT-RSA)

作者： Chang, Donghoon Chauhan, Amit Kumar Kumar, Sandeep Sanadhya, Somitra Kumar Indraprastha Inst Informat Technol IIIT D Delhi India Indian Inst Technol Ropar Rupnagar India Univ Delhi Shaheed Bhagat Singh Coll Dept Math Delhi India

ISBN: (纸本)9783319769530;9783319769523

In this paper, we present an identity-based encryption scheme from codes with efficient key revocation. Recently, in Crypto 2017, Gaborit et al. proposed a first identity-based encryption scheme from codes with rank metric, called RankIBE. To extract the decryption key from any public identity, they constructed a trapdoor function which relies on RankSign, a signature scheme proposed by Gaborit et al. in PQCrypto 2014. We adopt the same trapdoor function to add efficient key revocation functionality in the RankIBE scheme. Our revocable IBE scheme from codes with rank metric makes use of a binary tree data structure to reduce the amount of work in terms of key updates for the key authority. The total size of key updates requires logarithmic complexity in the maximum number of users and linear in the number of revoked users. We prove that our revocable IBE scheme is selective-ID secure in the random oracle model, under the hardness of three problems: the Rank Syndrome Decoding (RSD) problem, the Augmented Low Rank Parity Check code (LRPC+) problem, and the Rank Support Learning (RSL) problem.

关键词： code-based cryptography Identity-based encryption Key revocation Rank metric LRPC codes RSD problem

来源：评论

学校读者我要写书评

暂无评论

Efficient List Decoding Applied to ECC² 22nd

Efficient List Decoding Applied to ECC<SUP>2</SUP>

引用

22nd International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2021)

作者： Guan, Peidong Wan, Yunqi Zhang, Zhuoran Zhang, Fangguo Sun Yat Sen Univ Sch Comp Sci & Engn Guangzhou 510006 Peoples R China Guangdong Key Lab Informat Secur Technol Guangzhou 510006 Peoples R China Sun Yat Sen Univ Sch Elect & Informat Technol Guangzhou Peoples R China

ISBN: (纸本)9783030967727;9783030967710

ECC2 is an public key encryption system based on elliptic code. It can resist known attacks based on the special structures of algebraic geometric code. However, the computational overhead of decryption of ECC2 is unsatisfactory, because the list decoding algorithm occupies a major part of the computational overhead of decryption of ECC2. Therefore, we propose our module basis reduction interpolation of list decoding for elliptic code to speed up the decryption of ECC2. The algorithm we proposed is based on the theory of Grobner basis of modules. By implementing our proposed algorithm combined with ECC2, it shows that the proposed algorithm performs better than the list decoding algorithms used in ECC2.

关键词： code-based cryptography Elliptic codes List decoding Grobner Basis ECC2

来源：评论

学校读者我要写书评

暂无评论

SCA-LDPC: A code-based Framework for Key-Recovery Side-Channel Attacks on Post-quantum Encryption Schemes 29th

SCA-LDPC: A Code-Based Framework for Key-Recovery Side-Chann...

引用

29th Annual International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT)

作者： Guo, Qian Nabokov, Denis Nilsson, Alexander Johansson, Thomas Lund Univ Dept Elect & Informat Technol Lund Sweden Advenica AB Malmo Sweden

ISBN: (纸本)9789819987290;9789819987306

Whereas theoretical attacks on standardized cryptographic primitives rarely lead to actual practical attacks, the situation is different for side-channel attacks. Improvements in the performance of side-channel attacks are of utmost importance. In this paper, we propose a framework to be used in key-recovery side-channel attacks on CCA-secure post-quantum encryption schemes. The basic idea is to construct chosen ciphertext queries to a plaintext checking oracle that collects information on a set of secret variables in a single query. Then a large number of such queries is considered, each related to a different set of secret variables, and they are modeled as a low-density parity-check code (LDPC code). Secret variables are finally determined through efficient iterative decoding methods, such as belief propagation, using soft information. The utilization of LDPC codes offers efficient decoding, source coding, and error correction benefits. It has been demonstrated that this approach provides significant improvements compared to previous work by reducing the required number of queries, such as the number of traces in a power attack. The framework is demonstrated and implemented in two different cases. On one hand, we attack implementations of HQC in a timing attack, lowering the number of required traces considerably compared to attacks in previous work. On the other hand, we describe and implement a full attack on a masked implementation of Kyber using power analysis. Using the ChipWhisperer evaluation platform, our real-world attacks recover the long-term secret key of a first-order masked implementation of Kyber-768 with an average of only 12 power traces.

关键词： Lattice-based cryptography code-based cryptography side-channel attacks NIST post-quantum cryptography standardization low-density parity-check codes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：