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

22nd Theory of Cryptography Conference, TCC 2024

作者： Watanabe, Shun Yasunaga, Kenji Tokyo University of Agriculture and Technology Tokyo Japan Institute of Science Tokyo Tokyo Japan

ISBN: (纸本)9783031780165

Hardness amplification is one of the important reduction techniques in cryptography, and it has been extensively studied in the literature. The standard XOR lemma known in the literature evaluates the hardness in terms of the probability of correct prediction;the hardness is amplified from mildly hard (close to 1) to very hard 1/2+Ε by inducing Ε2 multiplicative decrease of the circuit size. Translating such a statement in terms of the bit-security framework introduced by Micciancio-Walter (EUROCRYPT 2018) and Watanabe-Yasunaga (ASIACRYPT 2021), it may cause a bit-security loss of log(1/Ε). To resolve this issue, we derive a new variant of the XOR lemma in terms of the Rényi advantage, which directly characterizes the bit security. In the course of proving this result, we prove a new variant of the hardcore lemma in terms of the conditional squared advantage;our proof uses a boosting algorithm that may output the ⊥ symbol in addition to 0 and 1, which may be of independent interest. © International Association for Cryptologic Research 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Bit Security: Optimal Adversaries, Equivalence Results, and a Toolbox for Computational-Statistical Security Analysis 22nd

Bit Security: Optimal Adversaries, Equivalence Results, and...

引用

22nd Theory of Cryptography Conference, TCC 2024

作者： Micciancio, Daniele Schultz-Wu, Mark University of California San Diego United States

ISBN: (纸本)9783031780165

We investigate the notion of bit-security for decisional cryptographic properties, as originally proposed in (Micciancio & Walter, Eurocrypt 2018), and its main variants and extensions, with the goal clarifying the relation between different definitions, and facilitating their use. Specific contributions of this paper include: (1) identifying the optimal adversaries achieving the highest possible MW advantage, showing that they are deterministic and have a very simple threshold structure;(2) giving a simple proof that a competing definition proposed by (Watanabe & Yasunaga, Asiacrypt 2021) is actually equivalent to the original MW definition;and (3) developing tools for the use of the extended notion of computational-statistical bit-security introduced in (Li, Micciancio, Schultz & Sorrell, Crypto 2022), showing that it fully supports common cryptographic proof techniques like hybrid arguments and probability replacement theorems. On the technical side, our results are obtained by introducing a new notion of "fuzzy" distinguisher (which we prove equivalent to the "aborting" distinguishers of Micciancio and Walter), and a tight connection between the MW advantage and the Le Cam metric, a standard quantity used in statistics. © International Association for Cryptologic Research 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Secure Composition of Quantum Key Distribution and Symmetric Key encryption

arXiv

引用

arXiv 2025年

作者： Dey, Kunal Safavi-Naini, Reihaneh University of Calgary AB Canada

Quantum key distribution (QKD) allows Alice and Bob to share a secret key over an insecure channel with proven information-theoretic security against an adversary whose strategy is bounded only by the laws of physics. Composability-based security proofs of QKD ensure that using the established key with a one-time-pad encryption scheme provides information theoretic secrecy for the message. In this paper, we consider the problem of using the QKD established key with a secure symmetric key-based encryption algorithm and use an approach based on hybrid encryption to provide a proof of security for the composition. Hybrid encryption was first proposed as a public key cryptographic algorithm with proven security for messages of unrestricted length. We use an extension of this framework to correlated randomness setting (Sharifian et al. in ISIT 2021) to propose a quantum-enabled Key Encapsulation Mechanism (qKEM) and quantum-enabled hybrid encryption (qHE), and prove a composition theorem for the security of the qHE. We construct a qKEM with proven security using an existing QKD (Portmann et al. in Rev. of Mod. Physics 2022). Using this qKEM with a secure Data Encapsulation Mechanism (DEM), that can be constructed using a one-time symmetric key encryption scheme, results in an efficient encryption system for unrestricted length messages with proved security against an adversary with access to efficient computations on a quantum computer (i.e. post-quantum secure encryption without using any computational assumptions.) © 2025, CC BY.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

k' -Lucas Sequence for Elliptic Curve Cryptography 1

k' -Lucas Sequence for Elliptic Curve Cryptography

引用

1st International Conference on Advances in Computer Science, Electrical, Electronics, and Communication Technologies, CE2CT 2025

作者： Abhinav Gonder, Surjeet Singh Chauhan Garg, Prachi Dubey, Sudhanshu Shekhar Chandigarh University Department of Mathematics Punjab Gharuan140413 India

ISBN: (纸本)9798331518578

The k′-Lucas sequence is a significant generalization of the classical Lucas sequence, exhibiting various intriguing properties and applications across mathematics and cryptography. The study of k′ -Lucas-like sequences on elliptic curves has gained attention recently, which offer unique structural advantages for cryptographic systems. An extension of the k′ -Lucas sequence defined on elliptic curves (EC) is presented in this study, highlighting its recursive nature and algebraic characteristics. Additionally, we suggest an encryption scheme that makes use of this sequence, leveraging the complexities inherent in 'Elliptic Curve Discrete Logarithm Problem (ECDLP)' [1]. Our findings indicate that this approach enhances security and opens new avenues for robust cryptographic protocols. © 2025 IEEE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Reducing the Share Size of Weighted Threshold Secret Sharing Schemes via Chow Parameters Approximation 22nd

Reducing the Share Size of Weighted Threshold Secret Shari...

引用

22nd Theory of Cryptography Conference, TCC 2024

作者： Farràs, Oriol Guiot, Miquel Universitat Rovira i Virgili Tarragona Spain

ISBN: (纸本)9783031780226

A secret sharing scheme is a cryptographic primitive that allows a dealer to share a secret among a set of parties, so that only authorized subsets of them can recover it. The access structure of the scheme is the family of authorized subsets. In a weighted threshold access structure, each party is assigned a weight according to its importance, and the authorized subsets are those in which the sum of their weights is at least the threshold value. For these access structures, the share size of the best known secret sharing schemes is either linear on the weights or quasipolynomial on the number of parties, which leads to long shares, in general. In certain settings, a way to circumvent this efficiency problem is to approximate the access structure by another one that admits more efficient schemes. This work is dedicated to the open problem posed by this strategy: Finding secret sharing schemes with a good tradeoff between the efficiency and the accuracy of the approximation. We present a method to approximate weighted threshold access structures by others that admit schemes with small shares. This method is based on the techniques for the approximation of the Chow parameters developed by De et al. [Journal of the ACM, 2014]. Our method provides secret sharing schemes with share size n1+o(1), where n is the number of parties, and whose access structure is close to the original one. Namely, in this approximation the condition of being authorized or not is preserved for almost all subsets of parties. In addition, we apply the recent results on computational secret sharing schemes by Applebaum et al. [STOC, 2023] to construct computational secret sharing schemes whose share size is polylogarithmic in the number of parties. © International Association for Cryptologic Research 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Singularization: A New Approach to Designing Block Ciphers for Resource-Constrained Devices 7th

Singularization: A New Approach to Designing Block Ciphers ...

引用

7th International Conference on Attacks and Defenses for Internet-of-Things, ADIoT 2024

作者： Macario-Rat, Gilles Plesa, Mihail-Iulian Orange Chatillon France Orange Services Bucharest Romania

ISBN: (纸本)9783031855924

Running traditional symmetric encryption algorithms, such as AES, on resource-constrained devices presents significant challenges due to the limited computational resources available. A common bottleneck in these algorithms is the number of rounds, which is typically determined through cryptanalysis efforts. In this paper, we introduce a novel framework for designing block ciphers, termed Singularization. This framework is based on a generic Feistel network with dynamically generated pseudorandom functions (PRFs). We demonstrate that Singularization may enable the design of symmetric ciphers with fewer rounds without compromising security. This is evidenced by a case study of a 6-round DES, which is vulnerable to differential cryptanalysis attacks. By redesigning DES using our framework, we mitigate this vulnerability, suggesting that it is possible to achieve almost the same level of security as a full-round DES with a reduced number of rounds. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Hybrid Ultra-Lightweight Algorithm: Hummingbird-2 and PRESENT with a Chaotic System 2nd

Hybrid Ultra-Lightweight Algorithm: Hummingbird-2 and PRESEN...

引用

2nd International Conference on Cyber Intelligence and Information Retrieval, CIIR 2023

作者： Khanjar, Ibtihal Ali Hoomod, Haider K. Yousif, Intisar Abd Education College Mustansiriyah University Baghdad Iraq

ISBN: (纸本)9789819776023

Computing in the cloud is a burgeoning sector that requires architectures that are both lightweight and safe. In this study, we suggest a strong hybrid structure that is created by fusing existing structures of HUMMINGBIRD-2 and PRESENT. With the help of the chaotic system, we have improved and increased the complexity and provided robust architecture that generates keys HUMMINGBIRD-2 by chaos key. and using the PRESENT is also generated by chaotic keys to increase its security and complexity. The PRESENT generated by chaos key into the HUMMINGBIRD-2 algorithm in one round in R3 and K3. we proposed a new modified hybrid two lightweight encryption algorithm for robust design by an amalgam of PRESENT in hummingbird-2. This hybrid cipher design is secure against linear and differential cryptanalysis. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Uncloneable encryption from Decoupling

arXiv

引用

arXiv 2025年

作者： Bhattacharyya, Archishna Culf, Eric Institute for Quantum Computing University of Waterloo Canada Perimeter Institute for Theoretical Physics Canada

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

The Case of Small Prime Numbers Versus the Okamoto-Uchiyama Cryptosystem 4th

The Case of Small Prime Numbers Versus the Okamoto-Uchiyam...

引用

4th International Conference on Number-Theoretic Methods in Cryptology, NuTMiC 2024

作者： Teşeleanu, George Advanced Technologies Institute 10 Dinu Vintilă Bucharest Romania Simion Stoilow Institute of Mathematics of the Romanian Academy 21 Calea Grivitei Bucharest Romania

ISBN: (纸本)9783031823794

In this paper we study the effect of using small prime numbers within the Okamoto-Uchiyama public key encryption scheme. We introduce two novel versions and prove their security. Then we show how to choose the system’s parameters such that the security results hold. Moreover, we provide a practical comparison between the cryptographic algorithms we introduced and the original Okamoto-Uchiyama cryptosystem. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

An Experimental Study on the Performance of Post-quantum Lightweight Cryptosystems in the Context of IoT/NFC

An Experimental Study on the Performance of Post-quantum ...

引用

PhD Symposium, Posters, Demos, and A Web for more inclusive, sustainable and prosperous societies, WEB-for-GOOD 2024 and 1st International Workshop on AI and Web Data Analytics, AIWDA 2024 form the 25th International Conference on Web Information Systems Engineering, WISE 2024

作者： Alonso India, José María Hajjar, Ayman El Kiss, Tamas University of Westminster London United Kingdom

ISBN: (纸本)9789819614820

The rapid advancement of quantum computing poses significant challenges to classical cryptographic systems. In response, the National Institute of Standards and Technology (NIST) initiated a challenge to develop "postquantum" encryption algorithms. This paper presents an empirical comparison of nine finalist algorithms suitable for deployment in IoT/NFC devices, including Ascon, Elephant, Gift-Cofb, Grain aead, ISAP v2.0, Photon Beetle, Romulus, Sparkle, and TinyJambu. These algorithms are evaluated based on their similarities and differences to determine their suitability for such settings. The study aims to identify the most suitable cryptosystems for resource-constrained environments, enhancing cryptographic resilience against advancing quantum computing capabilities. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：