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

8th IEEE International Conference on Communication Software and Networks (ICCSN)

作者： Zhang, Shuo Cao, Wenhui Li, Angyang Dong, Wenjie Shao, Liwei Natl Key Lab Sci & Technol Aerosp Intelligence Co Beijing Peoples R China Beijing Inst Technol Sch Informat & Elect Beijing Peoples R China Res Inst BIT Zhongshan Zhongshan Peoples R China

ISBN: (纸本)9781509017812

The McEliece public-key cryptosystem is believed to resist quantum attacks, but has not been used because of the extremely large public key size. In order to decrease the public key size, quasi-cyclic low-density parity-check (QC-LDPC) codes were used instead of Goppa codes in McEliece cryptosystem. A modified version of QC-LDPC McEliece is quasi-cyclic moderate density parity-check (QC-MDPC) McEliece, which focuses on ensuring fixed security level other than error-correction capability. The QC-MDPC McEliece scheme furtherly reduces the public key size at the cost of higher decryption complexity. However, the decryption algorithm of QC-LDPC McEliece variant has not been optimized. In this paper, we proposed a new decryption algorithm of the QC-LDPC McEliece variant. With the decryption algorithm we proposed, the key size reduces about 20% than the original algorithm, even 8% smaller than QC-MDPC variant.

关键词： McEliece cryptosystem LDPC codes post-quantum cryptography decryption algorithm

来源：评论

学校读者我要写书评

暂无评论

Bstj 60: 5. May-June 1981: B.S.T.J. Briefs: Fast decryption algorithm for the Knapsack Cryptographic System. (Henry, P.S.)

引用

2016年

Bstj 60: 5. May-June 1981: B.S.T.J. Briefs: Fast decryption algorithm for the Knapsack Cryptographic System. (Henry, P.S.) by published by

关键词： (henry, algorithm b.s.t.j. bell system briefs: cipher components cryptographic decryption decryption algorithm encrypted fast knapsack ieee knapsack knapsack cipher knapsack decryption lookup lookup table mod reduction mod successive system technical

来源：评论

学校读者我要写书评

暂无评论

A New decryption algorithm of the Quasi-Cyclic Low-Density Parity-Check Codes Based McEliece Cryptosystem

A New Decryption Algorithm of the Quasi-Cyclic Low-Density P...

引用

2016 8th IEEE International Conference on Communication Software and Networks(ICCSN 2016)

作者： Shuo Zhang Wenhui Cao Angyang Li Wenjie Dong Liwei Shao National Key Laboratory of Science and Technology on Aerospace Intelligence Control School of Information and Electronics Beijing Institute of Technology Research Institute of BIT in Zhongshan

The McEliece public-key cryptosystem is believed to resist quantum attacks,but has not been used because of the extremely large public key *** order to decrease the public key size,quasi-cyclic low-density parity-check(QC-LDPC)codes were used instead of Goppa codes in McEliece cryptosystem.A modified version of QC-LDPC McEliece is quasi-cyclic moderate density parity-check(QC-MDPC)McEliece,which focuses on ensuring fixed security level other than error-correction *** QC-MDPC McEliece scheme furtherly reduces the public key size at the cost of higher decryption ***,the decryption algorithm of QC-LDPC McEliece variant has not been *** this paper,we proposed a new decryption algorithm of the QC-LDPC McEliece *** the decryption algorithm we proposed,the key size reduces about20%than the original algorithm,even 8% smaller than QC-MDPC variant.

关键词： McEliece cryptosystem LDPC codes postquantum cryptography decryption algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Crypto Engine for Authenticated Encryption, Data Traceability, and Replay Attack Detection Over CAN Bus Network

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2024年第1期11卷 1008-1025页

作者： Rasheed, Amar Baza, Mohamed Badr, Mahmoud. M. Alshahrani, Hani Choo, Kim-Kwang Raymond Sam Houston State Univ Dept Comp Sci Huntsville TX 77340 USA Coll Charleston Dept Comp Sci Charleston SC 29424 USA Suny Polytech Inst Dept Network & Comp Secur Utica NY 13502 USA Najran Univ Coll Comp Sci & Informat Syst Dept Comp Sci Najran 61441 Saudi Arabia Univ Texas San Antonio Dept Informat Syst & Cyber Secur San Antonio TX 78260 USA

Smart vehicles and industrial control systems becoming increasingly complex. They are comprised of a large number of connected intelligence sensor devices. For such systems, Controller Area Network (CAN) bus offer high-integrity serial communication capabilities. It transformed the way how these systems are networked. Due to the lack of data security features on CAN-enabled systems, many of these systems are vulnerable to a wide range of cyber threats. This article proposed the development of a crypto-based subsystem that is capable of supporting CAN authenticated data encryption/decryption, crypto-provable data traceability, and replay attack detection capabilities. Data confidentiality was achieved via the deployment of a lightweight block cipher authenticated encryption scheme based on TinyJAMBU-128. Crypto-provable data traceability was accomplished through the utilization of a block-chaining approach. Meanwhile, an anti-replay attack mechanism that implements CAN message context awareness has been tested and validated under various data infection rates. Our CAN security subsystem was fully implemented and deployed on a testbed with multiple STM32 Nucleo development boards. System performance for our security schemes was analyzed and compared with traditional encryption schemes AES, ARIA, and Camellia with SHA-512 for supporting message authentication. Based on our performance results, the proposed security subsystem achieved the lowest CAN bus load and average message overhead compared to other encryption schemes. In the case of the anti-replay attack mechanism, we were able to reach a detection rate of 99.99% for data infection rate below 20%.

关键词： Security Encryption Cryptography Data communication Protocols Engines Electronic mail CAN Bus authenticated encryption decryption algorithm

来源：评论

学校读者我要写书评

暂无评论

Bidirectional Identity-Based Inner-Product Functional Re-Encryption in Vaccine Data Sharing

引用

IEEE Transactions on Cloud Computing 2025年第2期13卷 617-628页

作者： Wang, Jing Zhou, Yanwei Zhu, Yasi Liu, Zhiquan Yang, Bo Zhang, Mingwu Shaanxi Normal University School of Computer Science Xi’an710119 China Sichuan University Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610017 China Jinan University College of Cyber Security Guangzhou510632 China Hubei University of Technology School of Computer Wuhan430068 China

With the development of cloud computing, more and more data is stored in cloud servers, which leads to an increasing degree of privacy of data stored in cloud servers. For example, in the critical domain of medical vaccine trials, where public health outcomes hinge on the analysis of sensitive patient data, the imperative to safeguard privacy has never been more pronounced. Traditional encryption methods, though effective at protecting data, often expose vulnerabilities during decryption and lack the ability to support granular data access and computation. One-way re-encryption schemes further impede the agility of data sharing, which is indispensable for the collaborative efforts of research institutions. To address these limitations, we propose a novel bidirectional re-encryption scheme for inner-product functional encryption (IPFE). Our scheme secures data while allowing computation and sharing in an encrypted state, preserving patient privacy without hindering research. By harnessing inner-product functional encryption, our approach allows authorized researchers to extract valuable insights from encrypted data, significantly enhancing privacy protections. Our scheme’s security is predicated on the l-ABDHE (augmented bilinear Diffie-Hellman exponent) assumption, ensuring robustness against chosen plaintext attacks within the standard model. This foundation not only secures the data but also yields compact ciphertext length, minimizing storage demands. We introduce a protocol specifically designed for medical vaccine trials, which leverages our bidirectional IB-IPFRE (Identity-Based Inner-Product Functional Re-Encryption) scheme. This protocol enhances data security, supports collaborative research, and maintains patient privacy. Its application in vaccine trials demonstrates the scheme’s effectiveness in protecting sensitive information while enabling critical research insights. © 2013 IEEE.

关键词： Encryption Vaccines Data Privacy Iron Security Protection Vectors Protocols Cloud Computing Access Control Inner Product Function Encryption Identity Based Encryption CPA Security Bidirectional Re Encryption Data Sharing Research Institute Privacy Of Data Collaborative Research Data Security Sensitive Data Privacy Protection Patient Privacy Encrypted Data Chosen Plaintext Computational Cost Medical Data Vector Of Length Access Control Vector Production Original Information Secret Key Public Key Security Requirements Bilinear Map decryption Process Key Generation Information Encryption Round Of Experiments decryption algorithm Encryption And decryption Vaccine Information Evaluation Of Drug Efficacy Public Parameters Cryptographic Primitives

来源：评论

学校读者我要写书评

暂无评论

Solving the Olum 2 cipher: a new approach to cryptanalysis of transposition ciphers

引用

CRYPTOLOGIA 2023年第1期47卷 38-47页

作者： Relkin, Paul W. Mapscall LLC 53 Eckerson Rd Harrington Pk NJ 07640 USA

Olum 2 is one of two ciphers created more than 75 years ago by mathematician Paul Olum to challenge his Manhattan Project officemate, physicist Richard Feynman. In this manuscript, I describe the first successful decryption of Olum 2 using a novel approach to cryptanalysis of transposition ciphers. To decrypt Olum 2, I generated the bigrams and trigrams for all possible transposition intervals. I then identified transposition intervals with multiple bigrams and trigrams that occur frequently in English. I calculated the ratios of their English frequencies to the frequencies of bigrams and trigrams generated by a random reordering of the ciphertext. This enabled me to identify letter sequences with the highest probability of being true cipher message components rather than occurring by chance. In Olum 2, Professor Olum divided the message into sections of thirty-five letters and applied a rotating key to change the order of transposition for each successive section. His strategy not only confounded Professor Feynman but also proved impervious to several decryption programs in use today that assume a uniform transposition has been applied throughout the cipher. The decryption methods described in this manuscript can assist in the decryption of other ciphers employing a variety of transposition methods.

关键词： Transposition cipher decryption algorithm rotating key Manhattan Project Richard Feynman Paul Olum

来源：评论

学校读者我要写书评

暂无评论

Securecipher: An instantaneous synchronization stream encryption system for insider threat data leakage protection

引用

EXPERT SYSTEMS WITH APPLICATIONS 2024年 254卷

作者： Montano, Isabel Herrera Diaz, Juan Ramos Aranda, Jose Javier Garcia Molina-Cardin, Sergio Lopez, Juan Jose Guerrero Diez, Isabel de la Torre Univ Valladolid Dept Signal Theory & Commun & Telemat Engn Paseo Belen 15 Valladolid 47011 Spain Nokia Dept Innovat Maria Tubau St 9 Madrid 28050 Spain

The paper addresses the persistent challenge of insider threat in cybersecurity. Despite advancements in detection and prevention technologies and approaches, the complexity of digital environments and the ingenuity of insiders remain a problem. We propose an encryption algorithm called Securecipher, specifically designed to protect file systems from insider threats. The requirements that an algorithm must meet in this context are outlined, along with a method for its development. A context-based key generation mechanism is introduced, eliminating the need for key storage. A file marking mechanism is proposed that enables protection of the encryption algorithm against specific insider threat attacks. The proposed encryption algorithm meets the requirements posed by insider threats and has successfully passed 87 % of the NIST tests, equivalent to 13 out of 15 tests passed. Compared to conventional algorithms, the proposed encryption algorithm is more efficient in the context of insider threats, allowing access to distant locations instantaneously. In the specific case of the comparison with the RC4 algorithm, it showed a 0.25 s higher speed when accessing the last position of a 128-bytes file. Furthermore, a significant increase in the vocabulary of the encrypted text with Securecipher compared to the original text is observed, approximately 42 times more.

关键词： Encryption algorithm decryption algorithm Secure file system Insider threat Information security

来源：评论

学校读者我要写书评

暂无评论

Session key based fast, secure and lightweight image encryption algorithm

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2021年第7期80卷 10391-10416页

作者： Gupta, Manish Gupta, Kamlesh Kumar Shukla, Piyush Kumar UIT RGPV Dept Comp Sci & Engn Bhopal India RJIT Dept Informat Technol Tekanpur India

Nowadays, most of the communications in IoT enabled devices are done in the form of images. To protect the images from intruders, there is a need for a secure encryption algorithm. Many encryption algorithms have been proposed, some of the algorithms are based on symmetric-key cryptography and others are based on asymmetric key cryptography. This work proposed a fast, secure, and lightweight symmetric image cryptographic algorithm based on the session key. In this work, for every image encryption, a new session key is generated. Here session keys are generated with the help of crossover and mutation operators of genetic algorithm. This proposed algorithm uses a 64-bit plain text and requires an 80-bit key, where 64-bits of a key is generated via symmetric hexadecimal key and the remaining 16-bits of a key are randomly added, to encrypt the image. Here crossover and mutation operators are used to generate random 64-bits of a key. The proposed algorithm will work for both color and grayscale images. The proposed algorithm is simulated on MATLAB 2017 platform and compared with similar types of the existing algorithm on various parameters.

关键词： Encryption algorithm decryption algorithm Session key Crossover operator Mutation operator Block cipher

来源：评论

学校读者我要写书评

暂无评论

Session key based novel lightweight image encryption algorithm using a hybrid of Chebyshev chaotic map and crossover

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2021年第25期80卷 33843-33863页

作者： Gupta, Manish Gupta, Kamlesh Kumar Shukla, Piyush Kumar UIT RGPV Dept Comp Sci & Engn Bhopal MP India RJIT Dept Informat Technol Tekanpur MP India

In the current era, the majority of communication in IoT-enabled devices, such as smartphones, is now done through images. To shield the images from invaders, a reliable encryption algorithm is needed. Several encryption schemes have been developed, some based on private-key and others on public key cryptography. Using a combination of Chebyshev map and crossover function, this work presents a new lightweight encryption method for digital images based on session keys. A completely new session key is investigated in this work. Session keys are created using a hybrid of crossover and Chebyshev map. To maximize diffusion and confusion, the crossover operation is often used during the encryption phase. This presented scheme employs a 64-bit plain text and uses an 80-bit key, with 64 bits drawn from a given symmetric hexadecimal key and the remaining 16 bits added at random. The proposed algorithm's security is improved by using a hybrid of Chebyshev map and crossover to increase the randomness of the produced session key. The presented scheme is also lightweight due to its small key size and small code size. The suggested method is evaluated on the MATLAB 2015 platform with various parameters and measured to similar types of existing methods.

关键词： Session key Encryption algorithm Crossover decryption algorithm Chebyshev map Block cipher

来源：评论

学校读者我要写书评

暂无评论

Efficient decryption algorithms for Extension Field Cancellation Type Encryption Schemes 23rd

Efficient Decryption Algorithms for Extension Field Cancella...

引用

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

作者： Wang, Yacheng Ikematsu, Yasuhiko Dung Hoang Duong Takagi, Tsuyoshi Univ Tokyo Dept Math Informat Bunkyo Ku Hongo 7-3-1 Tokyo 1138656 Japan Kyushu Univ Inst Math Ind Nishi Ku 744 Motooka Fukuoka 8190395 Japan

ISBN: (纸本)9783319936383;9783319936376

Extension Field Cancellation (EFC) was proposed by Alan et al. at PQCrypto 2016 as a new trapdoor for constructing secure multivariate encryption cryptographic schemes. Along with this trapdoor, two schemes EFCp- and EFCpt2- that apply this trapdoor and some modifiers were proposed. Though their security seems to be high enough, their decryption efficiency has room for improvement. In this paper, we introduce a new and more efficient decryption approach for EFCp- and EFCpt2-, which manages to avoid all redundant computation involved in the original decryption algorithms, and theoretically speed up the decryption process of EFCp- and EFCpt2- by around 3.4 and 8.5 times, respectively, under 128-bit security parameters with our new designed private keys for them. Meanwhile, our approach does not interfere with the public key, so the security remains the same. The implementation results of both decryption algorithms for EFCp- and EFCpt2- are also provided.

关键词： Multivariate cryptography Extension field cancellation decryption algorithm Minus

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：