期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到4,156篇文章
< 1 2 … 208 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Enhancing Efficiency in Lattice-Based Post-Quantum Cryptography with Systolic Array Polynomial Multiplication 认领 引用
1
作者 Atef Ibrahim Fayez Gebali 《Computers, Materials & Continua》 SCIE EI 2026年第9期1007-1023,共17页
The ongoing expansion of the Internet of Things(IoT)fundamentally alters industrial and economic paradigms by integrating intelligent nodes throughout operational frameworks.Nonetheless,vulnerabilities surrounding sys... The ongoing expansion of the Internet of Things(IoT)fundamentally alters industrial and economic paradigms by integrating intelligent nodes throughout operational frameworks.Nonetheless,vulnerabilities surrounding system integrity and data confidentiality present major bottlenecks to widespread adoption,a dilemma severely intensified by impending quantum computing capabilities.Defending these networks demands the integration of post-quantum cryptographic primitives;yet,the severe hardware constraints characterizing peripheral IoT components complicate practical deployment.Quantum-resistant lattice cryptography offers a highly promising pathway to overcome these limitations,largely because the foundational security and throughput of these protocols hinge on polynomial multiplication performance.Consequently,optimizing the computational speed and architectural efficiency of this specific algebraic operation drastically enhances the viability of lattice-reliant defense mechanisms.To address this need,this study develops a specialized systolic array architecture engineered explicitly as an underlying arithmetic engine for polynomial multiplication within the Binary Ring Learning With Errors(BRLWE)protocol.Tailored for low-power hardware security modules(HSMs)situated at the network edge,the proposed circuit achieves rapid modular multiplication while ensuring a highly compact silicon footprint.By aligning the hardware layout with the precise algebraic properties of the BRLWE variation,this approach delivers a scalable,optimized framework for constructing secure IoT networks capable of resisting quantum adversaries,thereby acting as a pivotal building block for resilient industrial edge protection.Additionally,this study aligns with UN Sustainable Development Goals 8 and 9 by fostering digital trust in emerging technological systems and supporting the safe,adaptive growth of modern electronic economies. 展开更多
关键词 Safeguarding IoT networks post-quantum cryptography IoT edge computing systolic computation structures lattice-based security techniques multiplication of polynomials sustainable development goals future economies
暂未订购 下载PDF
Performance Evaluation of TLS1.3 Based on Post-Quantum Cryptography 认领 引用 被引量：1
2
作者 SONG Zhen-Yu ZHENG Jie-Yu ZHAO Yun-Lei 《密码学报（中英文）》 CSCD 北大核心 2026年第1期199-218,共20页
Post-quantum transport layer security(PQ-TLS)is capable of effectively defending against quantum threats to current network communications,whereas its larger public key and certificate sizes as well as higher computat... Post-quantum transport layer security(PQ-TLS)is capable of effectively defending against quantum threats to current network communications,whereas its larger public key and certificate sizes as well as higher computational overhead may result in a significant performance reduction compared with conventional TLS.In this paper,we present a systematic evaluation of PQ-TLS performance across diverse deployment scenarios to address the following critical research questions.(1)What is the performance behavior of PQ-TLS across different TLS modes?(2)How does PQ-TLS perform across varying client scales?(3)Which network topology is most suitable for PQ-TLS?(4)How does PQ-TLS perform on personal computers(PCs)compared to embedded IoT devices?To the best of our knowledge,this is the first work to comprehensively address these issues,offering implementers some insights into PQ-TLS performance and guidance for optimizing it across diverse scenarios. 展开更多
关键词 quantum security post-quantum cryptography transport layer security network emulation Internet measurement
暂未订购 下载PDF
Towards Post-Quantum Cryptography Using Thermal Noise Theory and True Random Numbers Generation 认领 引用 被引量：1
3
作者 Protais Ndagijimana Fulgence Nahayo +2 位作者 Marc Kokou Assogba Adoté François-Xavier Ametepe Juma Shabani 《Journal of Information Security》 2020年第3期149-160,共12页
The advent of quantum computers and algorithms challenges the semantic security of symmetric and asymmetric cryptosystems. Thus, the implementation of new cryptographic primitives is essential. They must follow the br... The advent of quantum computers and algorithms challenges the semantic security of symmetric and asymmetric cryptosystems. Thus, the implementation of new cryptographic primitives is essential. They must follow the breakthroughs and properties of quantum calculators which make vulnerable existing cryptosystems. In this paper, we propose a random number generation model based on evaluation of the thermal noise power of the volume elements of an electronic system with a volume of 58.83 cm3. We prove through the sampling of the temperature of each volume element that it is difficult for an attacker to carry out an exploit. In 12 seconds, we generate for 7 volume elements, a stream of randomly generated keys of 187 digits that will be transmitted from source to destination through the properties of quantum cryptography. 展开更多
关键词 Thermal Noise True Random Numbers Algorithm Post-Quantum Cryptography
暂未订购 下载PDF
The Mathematical Foundation of Post-Quantum Cryptography 认领 引用
4
作者 Chuanming Zong 《Research》 SCIE EI CSCD 2026年第3期747-758,共12页
In 1994,P.Shor discovered quantum algorithms that can break both the RSA cryptosystem and the ElGamal cryptosystem.In 2007,a Canadian company D-Wave demonstrated the first quantum computer.These events and quick furth... In 1994,P.Shor discovered quantum algorithms that can break both the RSA cryptosystem and the ElGamal cryptosystem.In 2007,a Canadian company D-Wave demonstrated the first quantum computer.These events and quick further developments have brought a crisis to secret communication.In 2022,the National Institute of Standards and Technology(NIST)announced 4 candidates—CRYSTALS-Kyber,CRYSTALS-Dilithium,Falcon,and Sphincs+—for post-quantum cryptography standards.The first 3 are based on lattice theory and the last on Hash functions.In 2024,NIST announced 3 standards:FIPS 203 based on CRYSTALS-Kyber,FIPS 204 based on CRYSTALS-Dilithium,and FIPS 205 based on Sphincs+.The fourth standard based on Falcon is on the way.It is well known that the security of the lattice-based cryptosystems relies on the hardness of the shortest vector problem(SVP),the closest vector problem(CVP),and their generalizations.In fact,the SVP is a ball packing problem and the CVP is a ball covering problem.Furthermore,both SVP and CVP are equivalent to arithmetic problems for positive definite quadratic forms.There are several books and survey papers dealing with the computational complexity of the lattice-based cryptography for classical computers.However,there is no review article to demonstrate the mathematical foundation of the complexity theory.This paper will briefly introduce post-quantum cryptography and demonstrate its mathematical roots in ball packing,ball covering,and positive definite quadratic forms. 展开更多
关键词 quantum computerthese lattice theory elgamal cryptosystemin rsa cryptosystem quantum algorithms Post Quantum Cryptography ElGamal Cryptosystem
Quantum Secure Multiparty Computation:Bridging Privacy,Security,and Scalability in the Post-Quantum Era 认领 引用
5
作者 Sghaier Guizani Tehseen Mazhar Habib Hamam 《Computers, Materials & Continua》 SCIE EI 2026年第4期1-25,共25页
The advent of quantum computing poses a significant challenge to traditional cryptographic protocols,particularly those used in SecureMultiparty Computation(MPC),a fundamental cryptographic primitive for privacypreser... The advent of quantum computing poses a significant challenge to traditional cryptographic protocols,particularly those used in SecureMultiparty Computation(MPC),a fundamental cryptographic primitive for privacypreserving computation.Classical MPC relies on cryptographic techniques such as homomorphic encryption,secret sharing,and oblivious transfer,which may become vulnerable in the post-quantum era due to the computational power of quantum adversaries.This study presents a review of 140 peer-reviewed articles published between 2000 and 2025 that used different databases like MDPI,IEEE Explore,Springer,and Elsevier,examining the applications,types,and security issues with the solution of Quantum computing in different fields.This review explores the impact of quantum computing on MPC security,assesses emerging quantum-resistant MPC protocols,and examines hybrid classicalquantum approaches aimed at mitigating quantum threats.We analyze the role of Quantum Key Distribution(QKD),post-quantum cryptography(PQC),and quantum homomorphic encryption in securing multiparty computations.Additionally,we discuss the challenges of scalability,computational efficiency,and practical deployment of quantumsecure MPC frameworks in real-world applications such as privacy-preserving AI,secure blockchain transactions,and confidential data analysis.This review provides insights into the future research directions and open challenges in ensuring secure,scalable,and quantum-resistant multiparty computation. 展开更多
关键词 Quantum computing secure multiparty computation(MPC) post-quantum cryptography(PQC) quantum key distribution(QKD) privacy-preserving computation quantum homomorphic encryption quantum network security federated learning blockchain security quantum cryptography
暂未订购 下载PDF
Lightweight Hash-Based Post-Quantum Signature Scheme for Industrial Internet of Things 认领 引用
6
作者 Chia-Hui Liu 《Computers, Materials & Continua》 SCIE EI 2026年第2期1041-1058,共18页
TheIndustrial Internet of Things(IIoT)has emerged as a cornerstone of Industry 4.0,enabling large-scale automation and data-driven decision-making across factories,supply chains,and critical infrastructures.However,th... TheIndustrial Internet of Things(IIoT)has emerged as a cornerstone of Industry 4.0,enabling large-scale automation and data-driven decision-making across factories,supply chains,and critical infrastructures.However,the massive interconnection of resource-constrained devices also amplifies the risks of eavesdropping,data tampering,and device impersonation.While digital signatures are indispensable for ensuring authenticity and non-repudiation,conventional schemes such as RSA and ECCare vulnerable to quantumalgorithms,jeopardizing long-termtrust in IIoT deployments.This study proposes a lightweight,stateless,hash-based signature scheme that achieves post-quantum security while addressing the stringent efficiency demands of IIoT.The design introduces two key optimizations:(1)Forest ofRandomSubsets(FORS)onDemand,where subset secret keys are generated dynamically via a PseudoRandom Function(PRF),thereby minimizing storage overhead and eliminating key-reuse risks;and(2)Winternitz One-Time Signature Plus(WOTS+)partial hash-chain caching,which precomputes intermediate hash values at edge gateways,reducing device-side computations,latency,and energy consumption.The architecture integrates a multi-layerMerkle authentication tree(Merkle tree)and role-based delegation across sensors,gateways,and a Signature Authority Center(SAC),supporting scalable cross-site deployment and key rotation.Froma theoretical perspective,we establish a formal(Existential Unforgeability under Chosen Message Attack)EUF-CMA security proof using a game-based reduction framework.The proof demonstrates that any successful forgerymust reduce to breaking the underlying assumptions of PRF indistinguishability,(second)preimage resistance,or collision resistance,thus quantifying adversarial advantage and ensuring unforgeability.On the implementation side,our design achieves a balanced trade-off between postquantum security and lightweight performance,offering concrete deployment guidelines for real-time industrial systems.In summary,the proposed method contributes both practical system design and formal security guarantees,providing IIoT with a deployable signature substrate that enhances resilience against quantum-era threats and supports future extensions such as device attestation,group signatures,and anomaly detection. 展开更多
关键词 Industrial Internet of Things(IIoT) post-quantum cryptography hash-based signatures SPHINCS+
暂未订购 下载PDF
Edge-Fog Enhanced Post-Quantum Network Security: Applications, Challenges and Solutions 认领 引用
7
作者 Seo Yeon Moon Byung Hyun Jo +2 位作者 Abir El Azzaoui Sushil Kumar Singh Jong Hyuk Park 《Computers, Materials & Continua》 SCIE EI 2025年第7期25-55,共31页
With the rapid advancement of ICT and IoT technologies,the integration of Edge and Fog Computing has become essential to meet the increasing demands for real-time data processing and network efficiency.However,these t... With the rapid advancement of ICT and IoT technologies,the integration of Edge and Fog Computing has become essential to meet the increasing demands for real-time data processing and network efficiency.However,these technologies face critical security challenges,exacerbated by the emergence of quantum computing,which threatens traditional encryption methods.The rise in cyber-attacks targeting IoT and Edge/Fog networks underscores the need for robust,quantum-resistant security solutions.To address these challenges,researchers are focusing on Quantum Key Distribution and Post-Quantum Cryptography,which utilize quantum-resistant algorithms and the principles of quantum mechanics to ensure data confidentiality and integrity.This paper reviews the current security practices in IoT and Edge/Fog environments,explores the latest advancements in QKD and PQC technologies,and discusses their integration into distributed computing systems.Additionally,this paper proposes an enhanced QKD protocol combining the Cascade protocol and Kyber algorithm to address existing limitations.Finally,we highlight future research directions aimed at improving the scalability,efficiency,and practicality of QKD and PQC for securing IoT and Edge/Fog networks against evolving quantum threats. 展开更多
关键词 Edge computing fog computing quantum key distribution security post-quantum cryptography cascade protocol
暂未订购 下载PDF
Quantum-Resistant Cryptographic Primitives Using Modular Hash Learning Algorithms for Enhanced SCADA System Security 认领 引用
8
作者 Sunil K.Singh Sudhakar Kumar +5 位作者 Manraj Singh Savita Gupta Razaz Waheeb Attar Varsha Arya Ahmed Alhomoud Brij B.Gupta 《Computers, Materials & Continua》 SCIE EI 2025年第8期3927-3941,共15页
As quantum computing continues to advance,traditional cryptographic methods are increasingly challenged,particularly when it comes to securing critical systems like Supervisory Control andData Acquisition(SCADA)system... As quantum computing continues to advance,traditional cryptographic methods are increasingly challenged,particularly when it comes to securing critical systems like Supervisory Control andData Acquisition(SCADA)systems.These systems are essential for monitoring and controlling industrial operations,making their security paramount.A key threat arises from Shor’s algorithm,a powerful quantum computing tool that can compromise current hash functions,leading to significant concerns about data integrity and confidentiality.To tackle these issues,this article introduces a novel Quantum-Resistant Hash Algorithm(QRHA)known as the Modular Hash Learning Algorithm(MHLA).This algorithm is meticulously crafted to withstand potential quantum attacks by incorporating advanced mathematical and algorithmic techniques,enhancing its overall security framework.Our research delves into the effectiveness ofMHLA in defending against both traditional and quantum-based threats,with a particular emphasis on its resilience to Shor’s algorithm.The findings from our study demonstrate that MHLA significantly enhances the security of SCADA systems in the context of quantum technology.By ensuring that sensitive data remains protected and confidential,MHLA not only fortifies individual systems but also contributes to the broader efforts of safeguarding industrial and infrastructure control systems against future quantumthreats.Our evaluation demonstrates that MHLA improves security by 38%against quantumattack simulations compared to traditional hash functionswhilemaintaining a computational efficiency ofO(m⋅n⋅k+v+n).The algorithm achieved a 98%success rate in detecting data tampering during integrity testing.These findings underline MHLA’s effectiveness in enhancing SCADA system security amidst evolving quantum technologies.This research represents a crucial step toward developing more secure cryptographic systems that can adapt to the rapidly changing technological landscape,ultimately ensuring the reliability and integrity of critical infrastructure in an era where quantum computing poses a growing risk. 展开更多
关键词 Hash functions post-quantum cryptography quantum-resistant hash functions network security supervisory control and data acquisition(SCADA)
暂未订购 下载PDF
Phase-Level Analysis and Forecasting of System Resources in Edge Device Cryptographic Algorithms 认领 引用 被引量：1
9
作者 Ehan Sohn Sangmyung Lee +3 位作者 Sunggon Kim Kiwook Sohn Manish Kumar Yongseok Son 《Computer Modeling in Engineering & Sciences》 SCIE EI 2025年第11期2761-2785,共25页
With the accelerated growth of the Internet of Things(IoT),real-time data processing on edge devices is increasingly important for reducing overhead and enhancing security by keeping sensitive data local.Since these d... With the accelerated growth of the Internet of Things(IoT),real-time data processing on edge devices is increasingly important for reducing overhead and enhancing security by keeping sensitive data local.Since these devices often handle personal information under limited resources,cryptographic algorithms must be executed efficiently.Their computational characteristics strongly affect system performance,making it necessary to analyze resource impact and predict usage under diverse configurations.In this paper,we analyze the phase-level resource usage of AES variants,ChaCha20,ECC,and RSA on an edge device and develop a prediction model.We apply these algorithms under varying parallelism levels and execution strategies across key generation,encryption,and decryption phases.Based on the analysis,we train a unified Random Forest model using execution context and temporal features,achieving R2 values up to 0.994 for power and 0.988 for temperature.Furthermore,the model maintains practical predictive performance even for cryptographic algorithms not included during training,demonstrating its ability to generalize across distinct computational characteristics.Our proposed approach reveals how execution characteristics and resource usage interacts,supporting proactive resource planning and efficient deployment of cryptographic workloads on edge devices.As our approach is grounded in phase-level computational characteristics rather than in any single algorithm,it provides generalizable insights that can be extended to a broader range of cryptographic algorithms that exhibit comparable phase-level execution patterns and to heterogeneous edge architectures. 展开更多
关键词 Internet of Things(IoT) cryptography power efficient computing performance modeling
暂未订购 下载PDF
Enhancing Post-Quantum Information Security: A Novel Two-Dimensional Chaotic System for Quantum Image Encryption 认领 引用 被引量：1
10
作者 Fatima Asiri Wajdan Al Malwi 《Computer Modeling in Engineering & Sciences》 SCIE EI 2025年第5期2053-2077,共25页
Ensuring information security in the quantum era is a growing challenge due to advancements in cryptographic attacks and the emergence of quantum computing.To address these concerns,this paper presents the mathematica... Ensuring information security in the quantum era is a growing challenge due to advancements in cryptographic attacks and the emergence of quantum computing.To address these concerns,this paper presents the mathematical and computer modeling of a novel two-dimensional(2D)chaotic system for secure key generation in quantum image encryption(QIE).The proposed map employs trigonometric perturbations in conjunction with rational-saturation functions and hence,named as Trigonometric-Rational-Saturation(TRS)map.Through rigorous mathematical analysis and computational simulations,the map is extensively evaluated for bifurcation behaviour,chaotic trajectories,and Lyapunov exponents.The security evaluation validates the map’s non-linearity,unpredictability,and sensitive dependence on initial conditions.In addition,the proposed TRS map has further been tested by integrating it in a QIE scheme.The QIE scheme first quantum-encodes the classic image using the Novel Enhanced Quantum Representation(NEQR)technique,the TRS map is used for the generation of secure diffusion key,which is XOR-ed with the quantum-ready image to obtain the encrypted images.The security evaluation of the QIE scheme demonstrates superior security of the encrypted images in terms of statistical security attacks and also against Differential attacks.The encrypted images exhibit zero correlation and maximum entropy with demonstrating strong resilience due to 99.62%and 33.47%results for Number of Pixels Change Rate(NPCR)and Unified Average Changing Intensity(UACI).The results validate the effectiveness of TRS-based quantum encryption scheme in securing digital images against emerging quantum threats,making it suitable for secure image encryption in IoT and edge-based applications. 展开更多
关键词 Information security chaotic map modeling post-quantum security quantum image encryption chaotic map image encryption
暂未订购 下载PDF
Sine-Polynomial Chaotic Map(SPCM):A Decent Cryptographic Solution for Image Encryption in Wireless Sensor Networks 认领 引用
11
作者 David S.Bhatti Annas W.Malik +1 位作者 Haeung Choi Ki-Il Kim 《Computers, Materials & Continua》 SCIE EI 2025年第10期2157-2177,共21页
Traditional chaotic maps struggle with narrow chaotic ranges and inefficiencies,limiting their use for lightweight,secure image encryption in resource-constrained Wireless Sensor Networks(WSNs).We propose the SPCM,a n... Traditional chaotic maps struggle with narrow chaotic ranges and inefficiencies,limiting their use for lightweight,secure image encryption in resource-constrained Wireless Sensor Networks(WSNs).We propose the SPCM,a novel one-dimensional discontinuous chaotic system integrating polynomial and sine functions,leveraging a piecewise function to achieve a broad chaotic range()and a high Lyapunov exponent(5.04).Validated through nine benchmarks,including standard randomness tests,Diehard tests,and Shannon entropy(3.883),SPCM demonstrates superior randomness and high sensitivity to initial conditions.Applied to image encryption,SPCM achieves 0.152582 s(39%faster than some techniques)and 433.42 KB/s throughput(134%higher than some techniques),setting new benchmarks for chaotic map-based methods in WSNs.Chaos-based permutation and exclusive or(XOR)diffusion yield near-zero correlation in encrypted images,ensuring strong resistance to Statistical Attacks(SA)and accurate recovery.SPCM also exhibits a strong avalanche effect(bit difference),making it an efficient,secure solution for WSNs in domains like healthcare and smart cities. 展开更多
关键词 Chaos theory chaotic system image encryption cryptography wireless sensor networks(WSNs)
暂未订购 下载PDF
Consensus⁃Based Cryptographic Framework for Side⁃Channel Attack Resilience in Cloud Environments 认领 引用
12
作者 I.Nasurulla K.Hemalatha +1 位作者 P.Ramachandran S.Parvathi 《Journal of Harbin Institute of Technology(New Series)》 CAS 2025年第2期90-104,共15页
Cloud environments are essential for modern computing,but are increasingly vulnerable to Side-Channel Attacks(SCAs),which exploit indirect information to compromise sensitive data.To address this critical challenge,we... Cloud environments are essential for modern computing,but are increasingly vulnerable to Side-Channel Attacks(SCAs),which exploit indirect information to compromise sensitive data.To address this critical challenge,we propose SecureCons Framework(SCF),a novel consensus-based cryptographic framework designed to enhance resilience against SCAs in cloud environments.SCF integrates a dual-layer approach combining lightweight cryptographic algorithms with a blockchain-inspired consensus mechanism to secure data exchanges and thwart potential side-channel exploits.The framework includes adaptive anomaly detection models,cryptographic obfuscation techniques,and real-time monitoring to identify and mitigate vulnerabilities proactively.Experimental evaluations demonstrate the framework's robustness,achieving over 95%resilience against advanced SCAs with minimal computational overhead.SCF provides a scalable,secure,and efficient solution,setting a new benchmark for side-channel attack mitigation in cloud ecosystems. 展开更多
关键词 Cloud computing side channel attacks HAVAL cryptographic hash Wilcoxon signed⁃rank test consensus mechanism improved schmidt⁃samoa cryptography
暂未订购 下载PDF
Hash-Based Signature Authentication for Scalable and Security-Consistent QKD Post-Processing 认领 引用
13
作者 Chaokun Wang Sijiang Xie +1 位作者 Yalong Yan Hong Zhao 《Computers, Materials & Continua》 SCIE EI 2026年第7期1311-1342,共32页
Quantum Key Distribution(QKD)ensures secure key establishment through the principles of quantum mechanics;however,its effectiveness in practice hinges on dependable identity verification via classical channels during ... Quantum Key Distribution(QKD)ensures secure key establishment through the principles of quantum mechanics;however,its effectiveness in practice hinges on dependable identity verification via classical channels during the post-processing phase.Current QKD implementations typically depend on pre-existing symmetric-key authentication,which suffers from limited scalability and complicated key management in extensive networks.Authentication methods utilizing post-quantum cryptography(PQC)signatures,based on complex mathematical assumptions,introduce extra and uncertain security dependencies,potentially compromising the security model integrity that QKD aims to maintain.This paper explores the application of hash-based signatures(HBS)for identity verification in the post-processing of QKD.HBS methods derive their security from cryptographic hash functions,which are integral to QKD protocols,allowing for scalable public-key-style authentication without the need for new computational assumptions.A detailed authentication framework is proposed,incorporating HBS-based verification into all essential phases of QKD post-processing,such as mutual certificate validation,basis sifting,parameter estimation,error correction verification,and privacy amplification.Security assessments indicate that the suggested framework maintains the security model integrity of QKD by relying cryptographically solely on the collision resistance of hash functions—without introducing new computational assumptions.At the system deployment level,it adheres to standard PKI trust assumptions which are necessary for public-key-style authentication and consistent with practical QKD network operations.Additionally,system-level evaluations affirm the scalability and practical applicability of HBS-based authentication,while also addressing the operational trade-offs among various HBS approaches in realistic QKD deployment contexts. 展开更多
关键词 Quantum key distribution identity authentication hash-based signatures post-processing security security-model consistency post-quantum cryptography
暂未订购 下载PDF
Improving ENUM-Sieve Reduction Algorithm for Prime Cyclotomic Lattices 认领 引用
14
作者 Kazutaka Toda Yuntao Wang +1 位作者 Hyungrok Jo Yang Li 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第7期1406-1426,共21页
The rapid evolution of quantum computing poses a fundamental challenge to classical public-key cryptosystems,accelerating the adoption of lattice-based post-quantum cryptography in large-scale digital infrastructures,... The rapid evolution of quantum computing poses a fundamental challenge to classical public-key cryptosystems,accelerating the adoption of lattice-based post-quantum cryptography in large-scale digital infrastructures,including Future Mobile Internet Technologies(FMIT)and their convergence applications(FMIT-CA).As lattice-based cryptography is expected to play an important role in such environments,accurate hardness estimation and parameter assessment of underlying lattice problems have become increasingly important.Since the security of these cryptographic schemes is closely related to the computational hardness of the Shortest Vector Problem(SVP),improving practical SVP-solving techniques contributes indirectly to the security evaluation of such systems.Among practical SVP solvers,sieve-based approaches such as the General Sieve Kernel(G6K)achieve state-of-the-art performance,yet their exponential complexity and resource demands constrain scalability in high-dimensional settings.In this work,we propose an improved version of the hybrid algorithm ENUM-Sieve Reduction(ESR)proposed by Toda et al.in ProvSec 2025.We refer to our proposal as ENUM-Sieve Reduction 2.0(ESR 2.0).It integrates Block Korkine-Zolotarev 2.0(BKZ 2.0)and extreme-pruning enumeration into the reduction pipeline and introduces a unimodular-matrix-based strategy for partial basis generation.Experimental results suggest that these enhancements enable stronger parameter configurations and more efficient execution in higher dimensions under realistic computational constraints.Experimental evaluations on prime cyclotomic ideal lattices demonstrate the practical usefulness of ESR 2.0 produces vectors equal to or shorter than those obtained by G6K in 75%of the tested instances for dimensions ranging from 96 to 130.Compared with ESR,ESR 2.0 achieves the same or shorter vectors in 62.5%of the tested instances.Although ESR 2.0 requires longer CPU time due to additional enumeration steps,GPU time and peak memory usage remain comparable to those of G6K and ESR.Furthermore,ESR 2.0 renewed record norms in the TU Darmstadt Ideal Lattice Challenge for dimensions 112,126,136,148 and 156.These results indicate the usability of ESR 2.0,providing a competitive and practical framework for high-dimensional SVP solving.The proposed improvements contribute to a more accurate assessment of lattice hardness,which is essential for secure parameter selection in post-quantum cryptographic systems supporting future mobile and converged digital environments. 展开更多
关键词 Post-quantum cryptography ideal lattice shortest vector problem sieve algorithms ENUM-sieve reduction
暂未订购 下载PDF
Constant-Time Symmetry Exploitation for NTT Twiddle Factors in ML-KEM:A Unified Cost Model for Embedded Deployments 认领 引用
15
作者 Xiaobing Liang Yu Qin +1 位作者 Shengdong Pan Liang Tan 《Computers, Materials & Continua》 SCIE EI 2026年第9期2046-2067,共22页
The standardization of the Module-Lattice-Based Key-Encapsulation Mechanism(ML-KEM,FIPS 203)creates urgent demand for efficient post-quantum cryptography on resource-constrained devices.In such deployments,twiddle-fac... The standardization of the Module-Lattice-Based Key-Encapsulation Mechanism(ML-KEM,FIPS 203)creates urgent demand for efficient post-quantum cryptography on resource-constrained devices.In such deployments,twiddle-factor management in the Number Theoretic Transform(NTT)induces a practical trade-off:full tables reduce latency but consume read-only memory(ROM),while on-the-fly generation reduces ROM but increases arithmetic cost.This paper makes two contributions.First,we present a constant-time half-table strategy(S_half)with branchless reconstruction logic and a formal indexing rule consistent with implementation.Second,we develop a Memory-Arithmetic Trade-off(MAT)model that unifies ROM,random-access memory(RAM),latency,energy,and side-channel risk into one device-aware objective.On ARM Cortex-M4,the proposed strategy reduces twiddle-factor ROM by 50%with a cycle overhead of about 3%–6%vs.full-table lookup in the same C framework.We additionally report cross-platform measurements on RISC-V and x86,where empirical best-strategy outcomes match MAT predictions.The resulting framework supports hardware-aware strategy selection with explicit assumptions on threat model and constant-time scope. 展开更多
关键词 Post-quantum cryptography ML-KEM symmetry unified cost model
暂未订购 下载PDF
格基后量子密码双域可重构多项式乘法运算单元架构研究 认领 引用 被引量：1
16
作者 陈韬 赵旺鹏 +4 位作者 别梦妮 李伟 南龙梅 杜怡然 付秋兴 《电子与信息学报》 EI CAS CSCD 北大核心 2026年第4期1646-1658,共13页
多项式乘法作为格密码算法的核心运算,通过快速数论变换(NTT)/快速傅里叶变换(FFT)设计成多项式乘法架构能够降低计算复杂度,提升格密码算法的运算速度。为支持多参数的多项式乘法运算,并提升多项式乘法的运算速度,该文提出一种双域可... 多项式乘法作为格密码算法的核心运算,通过快速数论变换(NTT)/快速傅里叶变换(FFT)设计成多项式乘法架构能够降低计算复杂度,提升格密码算法的运算速度。为支持多参数的多项式乘法运算,并提升多项式乘法的运算速度,该文提出一种双域可重构多项式乘法运算单元架构。首先基于Kyber,Dilithium和Falcon算法中的参数特征,提取多项式乘法的运算网络,并对内部双域乘法运算在算法层进行优化设计。其次,基于多项式乘法运算网络设计出双域可重构多项式乘法运算单元架构,并对双域可重构乘法单元进行优化设计以提升运算速度。最后,为提高运算单元架构的资源利用率,该文对多项式乘法运算单元架构进行并行度分析,当支持1路64 bit、2路32 bit或4路16 bit的运算时,多项式乘法运算架构的面积效率最高。该文在Xilinx FPGA xc7v2000tflg1925上进行实验验证,能够支持Kyber,Dilithium和Falcon算法中所有多项式乘法运算,工作频率达到169 MHz,面积时间积降低了50%以上。 展开更多
关键词 格基后量子密码 多项式乘法 双域可重构 并行化
暂未订购 下载PDF
基于ChatGPT实现格密码与全同态加密 认领 引用 被引量：1
17
作者 陈智罡 宋新霞 CHEN Liqun 《计算机工程与应用》 EI CSCD 北大核心 2026年第3期303-312,共10页
基于ChatGPT实现了环LWE上的格密码以及BFV全同态加密。这是使用ChatGPT来实现这两种加密算法。全同态加密曾经是密码学界的一个开放难题,有广泛的理论与实际应用。当前的全同态加密实现仍然面临挑战,尤其是在计算复杂度和计算效率上。C... 基于ChatGPT实现了环LWE上的格密码以及BFV全同态加密。这是使用ChatGPT来实现这两种加密算法。全同态加密曾经是密码学界的一个开放难题,有广泛的理论与实际应用。当前的全同态加密实现仍然面临挑战,尤其是在计算复杂度和计算效率上。ChatGPT能够根据用户的具体要求生成加密算法的源代码。然而,使用ChatGPT实现高度复杂的程序仍具有挑战性,尤其是全同态加密算法,其以复杂性著称。提出一种新颖的方法,从算法层次和代码层次来设计ChatGPT对格加密和全同态加密的实现方法。从算法层次来说,ChatGPT准确掌握了环LWE格加密算法,但是没有完全掌握BFV全同态加密算法。从代码层次来说,ChatGPT都能完整给出两种加密算法的C++实现代码,而且无需人工编写代码,但是都需要进一步调试和改错才能够正确运行。由于BFV全同态加密算法要比格加密算法复杂,因此所花费的调试工作更多。ChatGPT为实现密码算法提供了新思路,这方面值得进行深入而广泛的研究。该研究结果为ChatGPT在密码算法代码实现方面提供指南。 展开更多
关键词 ChatGPT 全同态加密 格密码 代码实现
暂未订购 下载PDF
A certificateless and KGA-secure searchable encryption scheme with constant trapdoors in smart city 认领 引用
18
作者 Hongjun Li Debiao He +2 位作者 P.Vijayakumar Fayez Alqahtani Amr Tolba 《Digital Communications and Networks》 SCIE EI CSCD 2026年第1期198-209,共12页
Smart cities,as a typical application in the field of the Internet of Things,can combine cloud computing to realize the intelligent control of objects and process massive data.While cloud computing brings convenience ... Smart cities,as a typical application in the field of the Internet of Things,can combine cloud computing to realize the intelligent control of objects and process massive data.While cloud computing brings convenience to smart city services,a serious problem is ensuring that confidential data cannot be leaked to malicious adversaries.Considering the security and privacy of data,data owners transmit sensitive data in its encrypted form to cloud server,which seriously hinders the improvements of potential utilization and efficient sharing.Public key searchable encryption ensures that users can securely retrieve the encrypted data without decryption.However,most existing schemes cannot resist keyword guessing attacks or the size of trapdoors linearly increases with the number of data owners.In this work,by utilizing certificateless encryption and proxy re-encryption,we design an authenticated searchable encryption scheme with constant trapdoors.The designed scheme preserves the privacy of index ciphertexts and keyword trapdoors,and can resist keyword guessing attacks.In addition,data users can generate and upload trapdoors with lower computation and communication overheads.We show that the proposed scheme is suitable for smart city implementations and applications by experimentally evaluating its performance. 展开更多
关键词 Smart city Data retrieval Privacy protection Certificateless cryptography
暂未订购 下载PDF
一种雾计算辅助的工业物联网四方高效认证协议 认领 引用 被引量：1
19
作者 王雄 张泽昊 +2 位作者 胡子宸 李伟麟 王文博 《计算机应用研究》 CSCD 北大核心 2026年第2期588-595,共8页
针对工业物联网逐步向云-雾-端协同架构演进过程中传感器设备面临的窃听、窜改、捕获等攻击威胁及敏感数据泄露问题,提出一种雾辅助下四方分段差异化认证与密钥协商协议。该协议依据云服务器、雾节点、用户端与传感器设备在计算与存储... 针对工业物联网逐步向云-雾-端协同架构演进过程中传感器设备面临的窃听、窜改、捕获等攻击威胁及敏感数据泄露问题,提出一种雾辅助下四方分段差异化认证与密钥协商协议。该协议依据云服务器、雾节点、用户端与传感器设备在计算与存储能力上的差异性,采用不同密码原语分段设计身份认证与密钥协商,即在云服务器和雾节点间采用椭圆曲线加密算法,在传感器设备和雾节点之间以及用户和云服务器之间采用轻量级运算。同时,该协议结合物理不可克隆函数为传感器生成唯一且不可复制的硬件指纹,并引入模糊提取函数以抵御传感器捕获、假冒等攻击。与现有几种认证密钥协商协议相比,所提协议的总计算开销分别降低了93.28%、93.56%、88.44%和86.70%,通信开销相较部分协议分别减少了11.30%、16.02%、19.08%,在安全性对比部分,所提协议满足多种安全属性,整体性能优于对比协议。综上,该协议在保障安全性的同时显著降低了计算与通信开销,满足工业物联网低延时和高效率的实际需求。 展开更多
关键词 雾计算 工业物联网 身份认证协议 椭圆曲线密码学 物理不可克隆函数
暂未订购 下载PDF
列控系统商用密码应用体系研究 认领 引用 被引量：2
20
作者 张浩 胡晓雅 杨雅涵 《铁路通信信号工程技术》 2026年第4期1-7,共7页
列控系统作为保障列车安全运行的核心系统,信息安全至关重要。聚焦于列控系统商用密码应用体系研究,基于列控系统架构和业务特征,深入分析其在数据保护层面所面临的安全风险和挑战,从法律法规、理论技术、制度管理、测试评估4个维度,构... 列控系统作为保障列车安全运行的核心系统,信息安全至关重要。聚焦于列控系统商用密码应用体系研究,基于列控系统架构和业务特征,深入分析其在数据保护层面所面临的安全风险和挑战,从法律法规、理论技术、制度管理、测试评估4个维度,构建列控系统商用密码应用体系,并通过通信网络安全防护、在线密钥管理、安全运维和审计3个典型应用案例,详细说明系统商用密码应用的实现方法和效果,为持续提升列控系统安全保障能力,以及数字化铁路发展筑牢密码安全底座。 展开更多
关键词 列控系统 商用密码应用体系 信息安全
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 208 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈