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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
82 篇 期刊文献
4 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

207 篇 code-based crypt...
63 篇 post-quantum cry...
18 篇 rank metric
15 篇 information set ...
13 篇 mceliece cryptos...
12 篇 decoding
12 篇 cryptanalysis
12 篇 fpga
12 篇 syndrome decodin...
11 篇 public-key encry...
11 篇 digital signatur...
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 篇 key recovery att...
6 篇 public key

机构

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

语言

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

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

共 207 条记录，以下是101-110 订阅

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

详细简洁

排序：

Cryptanalysis of Ivanov-Krouk-Zyablov Cryptosystem 1

引用

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

作者： Vedenev, Kirill Kosolapov, Yury Southern Fed Univ Rostov Na Donu Russia

ISBN: (数字)9783031296895

ISBN: (纸本)9783031296888;9783031296895

Recently, F. Ivanov, E. Krouk and V. Zyablov proposed new cryptosystem based of Generalized Reed-Solomon (GRS) codes over field extensions. In their approach, the subfield images of GRS codes are masked by a special transform, so that the resulting public codes are not equivalent to subfield images of GRS code but burst errors still can be decoded. In this paper, we show that the complexity of message-recovery attack on this cryptosystem can be reduced due to using burst errors, and the secret key of Ivanov-Krouk-Zyablov cryptosystem can successfully recovered in polynomial time with a linear-algebra based attack and a square-based attack.

关键词： code-based cryptography GRS codes Field extensions Subspace subcodes Projected codes Information-set decoding Key-recovery attack

来源：评论

学校读者我要写书评

暂无评论

Efficient Software Implementations of code-based Hash Functions and Stream-Ciphers 5

引用

5th International Workshop on the Arithmetic of Finite Fields (WAIFI)

作者： Cayrel, Pierre-Louis Meziani, Mohammed Ndiaye, Ousmane Santos, Quentin Lab Hubert Curien UMR CNRS 5516 F-42000 St Etienne France CASED Ctr Adv Secur Res Darmstadt D-64293 Darmstadt Germany Univ Cheikh Anta Diop Dakar FST DMI LACGAA Dakar Senegal Ecole Normale Super Lyon F-69007 Lyon France

ISBN: (纸本)9783319162768;9783319162775

In this work, we present a survey on software implementations of two families of cryptographic primitives based on the syndrome decoding problem: hash functions and stream ciphers. We have studied different algorithms, namely, FSB, SFSB, RFSB, SYND, 2SC and XSYND, and tried to improve their performances as software implementations which are done in C language by Using XMM registers from Streaming SIMD Extensions (SSE). We provide a fair comparison of the implementations of those primitives in the same platform and also give links to the codes we have developed. Although we did not reach the speed given in the paper in some cases, we managed to beat the results of the reference implementations when they are available.

关键词： code-based cryptography Software implementations

来源：评论

学校读者我要写书评

暂无评论

Continuous Key Agreement with Reduced Bandwidth 1

引用

3rd International Symposium on Cyber Security cryptography and Machine Learning (CSCML)

作者： Drucker, Nir Gueron, Shay Univ Haifa Haifa Israel Amazon Seattle WA 98109 USA

ISBN: (数字)9783030209513

ISBN: (纸本)9783030209513;9783030209506

Continuous Key Agreement (CKA) is a two-party procedure used by Double Ratchet protocols (e. g., Signal). This is a continuous and synchronous protocol that generates a fresh key for every sent/received message. It guarantees forward secrecy and post-compromise security. Alwen et al. have recently proposed a new KEM-based CKA construction where every message contains a ciphertext and a fresh public key. This can be made quantum-safe by deploying a quantum-safe KEM. They mention that the bandwidth can be reduced when using an ElGamal KEM (which is not quantum-safe). In this paper, we generalized their approach by defining a new primitive, namely Merged KEM (MKEM). This primitive merges the key generation and the encapsulation steps of a KEM. This is not possible for every KEM and we discuss cases where a KEM can be converted to an MKEM. One example is the quantum-safe proposal BIKE1, where the BIKE-MKEM saves 50% of the communication bandwidth, compared to the original construction. In addition, we offer the notion and two constructions for hybrid CKA.

关键词： Double Ratchet protocol Continuous Key Agreement Post Quantum cryptography code-based cryptography BIKE

来源：评论

学校读者我要写书评

暂无评论

Take Your MEDS: Digital Signatures from Matrix code Equivalence 1

引用

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

作者： Chou, Tung Niederhagen, Ruben Persichetti, Edoardo Randrianarisoa, Tovohery Hajatiana Reijnders, Krijn Samardjiska, Simona Trimoska, Monika Acad Sinica Taipei Taiwan Univ Southern Denmark Odense Denmark Florida Atlantic Univ Boca Raton FL 33431 USA Sapienza Univ Rome Italy Umea Univ Umea Sweden Radboud Univ Nijmegen Nijmegen Netherlands

ISBN: (数字)9783031376795

ISBN: (纸本)9783031376788;9783031376795

In this paper, we show how to use the Matrix code Equivalence (MCE) problem as a new basis to construct signature schemes. This extends previous work on using isomorphism problems for signature schemes, a trend that has recently emerged in post-quantum cryptography. Our new formulation leverages a more general problem and allows for smaller data sizes, achieving competitive performance and great flexibility. Using MCE, we construct a zero-knowledge protocol which we turn into a signature scheme named Matrix Equivalence Digital Signature (MEDS). We provide an initial choice of parameters for MEDS, tailored to NIST's Category 1 security level, yielding public keys as small as 2.8 kB and signatures ranging from 18 kB to just around 6.5 kB, along with a reference implementation in C.

关键词： group action signature scheme code-based cryptography post-quantum cryptography matrix codes

来源：评论

学校读者我要写书评

暂无评论

Repairing the Faure-Loidreau Public-Key Cryptosystem

Repairing the Faure-Loidreau Public-Key Cryptosystem

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Wachter-Zeh, Antonia Puchinger, Sven Renner, Julian TUM Inst Commun Engn Munich Germany

ISBN: (纸本)9781538647813

A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem is proposed. The FL cryptosystem is based on the hardness of list decoding Gabidulin codes which are special rank-metric codes. We prove that the recent structural attack on the system by Gaborit et al. is equivalent to decoding an interleaved Gabidulin code. Since all known polynomial-time decoders for these codes fail for a large constructive class of error patterns, we are able to construct public keys that resist the attack. It is also shown that all other known attacks fail for our repair and parameter choices. Compared to other code-based cryptosystems, we obtain significantly smaller key sizes for the same security level.

关键词： code-based cryptography rank-metric codes interleaving Gabidulin codes

来源：评论

学校读者我要写书评

暂无评论

LRPC codes with Multiple Syndromes: Near Ideal-Size KEMs Without Ideals 13th

LRPC Codes with Multiple Syndromes: Near Ideal-Size KEMs Wit...

引用

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

作者： Aguilar-Melchor, Carlos Aragon, Nicolas Dyseryn, Victor Gaborit, Philippe Zemor, Gilles SandboxAQ Palo Alto CA USA Univ Rennes IRISA INRIA CNRS Rennes France Univ Limoges XLIM Limoges France Inst Math Bordeaux UMR 5251 Bordeaux France

ISBN: (纸本)9783031172342;9783031172335

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 upon 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 also enables to choose an error weight close to the rank Gilbert-Varshamov bound, which is a relatively harder zone for algebraic attacks.

关键词： Rank-based cryptography code-based cryptography Post-quantum cryptography Rank Support Learning LRPC 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Information-Set Decoding with Hints 1

引用

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

作者： Horlemann, Anna-Lena Puchinger, Sven Renner, Julian Schamberger, Thomas Wachter-Zeh, Antonia Univ St Gallen Sch Comp Sci St Gallen Switzerland Tech Univ Munich TUM Munich Germany

ISBN: (数字)9783030983659

ISBN: (纸本)9783030983659;9783030983642

This paper studies how to incorporate small information leakages (called "hints") into information-set decoding (ISD) algorithms. In particular, the influence of these hints on solving the (n, k, t)syndrome-decoding problem (SDP), i.e., generic syndrome decoding of a code of length n, dimension k, and an error of weight t, is analyzed. We motivate all hints by leakages obtainable through realistic side-channel attacks on code-based post-quantum cryptosystems. One class of studied hints consists of partial knowledge of the error or message, which allow to reduce the length, dimension, or error weight using a suitable transformation of the problem. As a second class of hints, we assume that the Hamming weights of sub-blocks of the error are known, which can be motivated by a template attack. We present adapted ISD algorithms for this type of leakage. For each third-round code-based NIST submission (Classic McEliece, BIKE, HQC), we show how many hints of each type are needed to reduce the work factor below the claimed security level. E.g., for Classic McEliece mceliece348864, the work factor is reduced below 2(128) for 9 known error locations, 650 known error-free positions or known Hamming weights of 29 sub-blocks of roughly equal size.

关键词： Post-quantum cryptography code-based cryptography Information set decoding Side-channel attacks

来源：评论

学校读者我要写书评

暂无评论

On codes and Learning with Errors over Function Fields 42nd

On Codes and Learning with Errors over Function Fields

引用

42nd Annual International Cryptology Conference (CRYPTO)

作者： Bombar, Maxime Couvreur, Alain Debris-Alazard, Thomas Ecole Polytech Inst Polytech Paris LIX CNRS UMR 7161 1 Rue Honore Estienne Orves F-91120 Palaiseau France Inria Saclay Palaiseau France

ISBN: (纸本)9783031159787;9783031159794

It is a long standing open problem to find search to decision reductions for structured versions of the decoding problem of linear codes. Such results in the lattice-based setting have been carried out using number fields: Polynomial-LWE, Ring-LWE, Module-LWE and so on. We propose a function field version of the LWE problem. This new framework leads to another point of view on structured codes, e.g. quasi-cyclic codes, strengthening the connection between lattice-based and code-based cryptography. In particular, we obtain the first search to decision reduction for structured codes. Following the historical constructions in lattice-based cryptography, we instantiate our construction with function fields analogues of cyclotomic fields, namely Carlitz extensions, leading to search to decision reductions on various versions of Ring-LPN, which have applications to secure multiparty computation and to an authentication protocol.

关键词： code-based cryptography Search to decision reductions LWE Function fields Carlitz modules

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：