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

A variant rsa acceleration with parallelisation

INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS 2022年第3期37卷 318-332页

作者： Liu, Jun-Jie Tsang, Kang-Too Deng, Yu-Hui BNU HKBU United Int Coll Div Sci & Technol Zhuhai Peoples R China Guangzhou Gaozhuan Informat Technol Ltd Guangzhou Guangdong Peoples R China

The standard rsa relies on multiple big-number modular exponentiation operations and a longer key-length is required for better protection. This imposes a hefty time penalty for encryption and decryption. In this study, we analysed and developed an improved parallel algorithm (PMKrsa) based on the idea of splitting the plaintext into multiple chunks and encrypt the chunks using multiple key-pairs. The algorithm in our new scheme is so natural for parallelised implementation that we also investigated its parallelisation in a GPU environment. In the following, the structure of our new scheme is outlined and its correctness is proved mathematically. Then, with the algorithm implemented and optimised on both CPU and CPU+GPU platforms, we showed that our algorithm shortens the computational time considerably, and it has a security advantage over the standard rsa as it is invulnerable to the common attacks. Finally, we also proved the feasibility of using our algorithm to encrypt large files through simulation. The results show that over the set of file size: 1 MB, 10 MB, 25 MB, 50 MB, 100MB, the average encryption and decryption time of the CPU version is 0.2476 and 9.4476 s, and for the CPU+GPU version, it is 0.0009 and 0.0618 s, respectively.

关键词： Parallel computing GPGPU CUDA implementation asymmetric cryptosystem rsa algorithm

来源：评论

学校读者我要写书评

暂无评论

A VERIFICATION OF BRICKELL FAST MODULAR MULTIPLICATION algorithm

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1990年第3-4期33卷 153-169页

作者： WALTER, CD ELDRIDGE, SE Computation Department UMIST Manchester M60 1QD United Kingdom

This paper refers to the algorithm and its hardware implementation described by Brickell [1] for modular multiplication inN+10 clock pulses whereNis the number of bits in the binary integers involved. Brickell [1] uses a delayed carry representation which consists of two registers ofNbits each—one for the uncarried carries. Of course, up toNclocks ticks may eventually be required to assimilate the carries at the end of the *** sources of possible error are reported here—one in the hardware, one in the specification which the intended hardware satisfies, and one in the definition of the control variablesT1andT2. Our main contributions are the supply of further detail to remove such ambiguities, a determination of the minimum number of extra bits required during the calculation, a verification of the more detailed system, and its extension to an integer division *** existence of a proof enables it to be used reliably for its intended purpose in applications such as cryptography [5]. where attempts have already been made to use the algorithm or similar methods in rsa chips [4]. The reduced number of extra bits required also marginally increases the *** work by J. K. Gibson [2] described different additional detail to make Brickell's algorithm work. What is supplied in this article we believe to be more natural than Gibson's in that the standard delay-carry addition stands unaltered here, and the minimum number of clock pulses required remains clear.

关键词： rsa algorithm fast multiplication verification cryptography computer arithmetic

来源：评论

学校读者我要写书评

暂无评论

Determining the Comparative Value of Pharmaceutical Risk-Sharing Policies in Non-Small Cell Lung Cancer Using Real-World Data

引用

VALUE IN HEALTH 2019年第3期22卷 322-331页

作者： Holleman, Marscha S. Uyl-de Groot, Carin A. Goodall, Stephen van der Linden, Naomi Erasmus Univ Inst Med Technol Assessment Erasmus Sch Hlth Policy & Management Rotterdam Netherlands Univ Technol Sydney Ctr Hlth Econ Res & Evaluat Sydney NSW Australia

Background: Risk-sharing arrangements (rsas) can be used to mitigate uncertainty about the value of a drug by sharing the financial risk between payer and pharmaceutical company. We evaluated the projected impact of alternative rsas for non-small cell lung cancer (NSCLC) therapies based on real-world data. Methods: Data on treatment patterns of Dutch NSCLC patients from four different hospitals were used to perform "what-if" analyses, evaluating the costs and benefits likely associated with various rsas. In the scenarios, drug costs or refunds were based on response evaluation criteria in solid tumors (RECIST) response, survival compared to the pivotal trial, treatment duration, or a fixed cost per patient. Analyses were done for erlotinib, gemcitabine/cisplatin, and pemetrexed/platinum for metastatic NSCLC, and gemcitabine/cisplatin, pemetrexed/cisplatin, and vinorelbine/cisplatin for nonmetastatic NSCLC. Results: Money-back guarantees led to moderate cost reductions to the payer. For conditional treatment continuation schemes, costs and outcomes associated with the different treatments were dispersed. When price was linked to the outcome, the payer's drug costs reduced by 2.5% to 26.7%. Discounted treatment initiation schemes yielded large cost reductions. Utilization caps mainly reduced the costs of erlotinib treatment (by 16%). Given a fixed cost per patient based on projected average use of the drug, risk sharing was unfavorable to the payer because of the lower than projected use. The impact of rsas on a national scale was dispersed. Conclusions: For erlotinib and pemetrexed/platinum, large cost reductions were observed with risk sharing. rsas can mitigate uncertainty around the incremental cost-effectiveness or budget impact of drugs, but only when the type of arrangement matches the setting and type of uncertainty. Copyright (c) 2019, ISPOR-The Professional Society for Health Economics and Outcomes Research. Published by Elsevier Inc.

关键词： rsa algorithm CISPLATIN NON-small-cell lung carcinoma PHARMACEUTICAL policy

来源：评论

学校读者我要写书评

暂无评论

A FASTER MODULAR MULTIPLICATION algorithm

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1991年第1-2期40卷 63-68页

作者： ELDRIDGE, SE Computation Dept UMIST Manchester M60 1QD P. O. Box 88 United Kingdom

This paper describes a method for quickly computing AB modNwhereNis odd. It is shown to have significant advantages over other algorithms which make it suitable for use in hardware for public key encryption. Such hard... 详细信息

关键词： MODULAR MULTIPLICATION FAST COMPUTER ARITHMETIC DIGITAL ARITHMETIC INTEGER DIVISION PARALLEL BIT OPERATIONS REDUNDANT NUMBER SYSTEMS PUBLIC KEY CRYPTOGRAPHY rsa algorithm

来源：评论

学校读者我要写书评

暂无评论

FAST MODULAR MULTIPLICATION USING 2-POWER RADIX

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1991年第1-2期39卷 21-28页

作者： WALTER, CD Computation Department UMIST Manchester M60 LQD United Kingdom

Details are given here of how to generalise Brickell's fast modular multiplication algorithm to when the number representations have a general 2-power radix. Correct action depends upon the satisfaction of a complicated inequality and speed upon the use of a redundant number system to enable parallel digit operations. The effect of varying the radix on the efficiency of hardware implementations is considered. Improved efficiency has repercussions in public key cryptography where the rsa encryption scheme may use this type of algorithm for its modular exponentiations. However, it is shown that there is no advantage in taking a very large radix, although a small increase above 2 is beneficial.

关键词： MODULAR MULTIPLICATION FAST COMPUTER ARITHMETIC DIGITAL ARITHMETIC INTEGER DIVISION PARALLEL BIT OPERATIONS REDUNDANT NUMBER SYSTEMS rsa algorithm CRYPTOGRAPHY

来源：评论

学校读者我要写书评

暂无评论

Low-complexity design of bit-parallel dual-basis multiplier over GF(2^m)

引用

IET INFORMATION SECURITY 2012年第4期6卷 324-328页

作者： Wang, J. -H. Chang, H. W. Chiou, C. W. Liang, W. -Y. Natl Taipei Univ Technol Dept Comp Sci & Informat Engn Taipei 106 Taiwan Chien Hsin Univ Sci & Technol Dept Comp Sci & Informat Engn Chungli 320 Taiwan

Recently, information security is heavily dependent on cryptosystems such as Rivest-Shamir-Adleman algorithm (rsa algorithm) and elliptic curve cryptosystem (ECC). rsa can provide higher security level than ECC, but it is not suitable for the resource-constrained devices such as smart phones or embedded system. Thus, ECC is attracted on application in resource-constrained devices because it can achieve the same security level, but uses less key length than rsa. Galois or finite field multiplication is the core arithmetic operation of ECC. There are three popular bases in the finite field over GF(2(m)),polynomial basis, normal basis and dual basis (DB). Each basis representation has its own advantages. In this study, the authors will introduce a low-complexity bit-parallel DB multiplier using the multiplexer approach. Compared with the related work, our design saves up to 60% of space complexity.

关键词： Galois fields ECC space complexity Galois field multiplication polynomial basis normal basis bit-parallel dual-basis multiplier Rivest-Shamir-Adleman algorithm finite field multiplication Cryptography resource-constrained devices low-complexity bit-parallel DB multiplier information security cryptosystems Algebra rsa algorithm cryptography dual basis elliptic curve cryptosystem Computational complexity Cryptography theory computational complexity Data security

来源：评论

学校读者我要写书评

暂无评论

Hiding Information in the DNA Sequence Using DNA Steganographic algorithms with Double-Layered Security

引用

INTERNATIONAL JOURNAL OF INFORMATION SECURITY AND PRIVACY 2022年第1期16卷 1-20页

作者： Vinodhini, R. E. Malathi, P. Amrita Sch Engn Dept Comp Sci & Engn Coimbatore Tamil Nadu India

Due to the rapid growth of the internet, data can now be stored digitally and exchanged easily by people. While sharing the data through the internet, the attackers can easily access the data. This may cause data privacy issues. Steganography is a kind of information security that makes it possible to hide secret information in a variety of formats like images, text, audio, video, networks, and DNA (deoxyribonucleic acid). Here, DNA steganography is used to protect secret data from intruders. In this paper, three different algorithms of DNA steganography are introduced. The algorithms are an rsa-based insertion algorithm, a complementary algorithm using the addition/subtraction rule, a combination of insertion and substitution method with XOR operation. Cracking probability, payload, capacity, and BPN are calculated to check the performance of the proposed algorithms. As a result, this paper concludes that the proposed techniques yield better results than existing algorithms and have a low cracking probability, in addition to providing double-layered security to the information.

关键词： Addition/Subtraction Operator Complementary algorithm DNA Steganography Insertion Method rsa algorithm Triplet DNA Bases XOR Substitution Method

来源：评论

学校读者我要写书评

暂无评论

The quantum computer for accelerating image processing and strengthening the security of information systems

引用

CHINESE JOURNAL OF PHYSICS 2023年 81卷 104-124页

作者： Nouioua, Tarek Belbachir, Ahmed Hafid Univ Tebessa Fac Exact Sci & Sci Nat & life Dept Math & Comp Sci Tebessa Algeria Univ Sci & Technol Oran Mohamed Boudiaf Fac Phys Engn Phys Dept Lab Anal & Applicat Radiat LAAR Bir El Djir Algeria

Many researchers and laboratories have been involved for many years in the development of the quantum computer. In 2019, Google has announced that they have reached quantum supremacy with their quantum computer Sycamore using a 53 qubits processor. On November 2021, IBM also announced that they have built a quantum computer with the highest number of 127 qubits and revealed their ambitious goal of building a 1000 qubits processor by 2023. According to these two giants of the quantum computing field, such a machine can perform an astronomical quantity of calculations significantly faster than any other conventional computer. This technology could be a real revolution in many fields such as computing, artificial intelligence, medicine, chemistry, banking, and experimental techniques, ... etc. Since this technology is still in its infancy in hardware and software, its progress may be slow. However, many working in the field predict that 2,000 to 5,000 quantum computers of a first generation will be operational by 2030, but quantum computers needed to deal with more complex problems may not exist until 2035 or *** this paper, we will go over some of the basic aspects of a quantum computer, in particular the concept of the qubit or the quantum bit and the quantum computer itself. Then we will see how a quantum computer can effectively speed up the processing of large images, reduce the amount of memory needed for computation and storage and even, strengthen the security of information systems. Lastly, we will present and discuss a real hardware implementation of the well-known quantum edge detection, as well as a spy hunter simulation.

关键词： Quantum computer Quantum physics Quantum image processing Quantum edge detection rsa algorithm Information security Post-quantum-cryptography

来源：评论

学校读者我要写书评

暂无评论

An Enhanced and Secured rsa Key Generation Scheme (ESRKGS)

引用

JOURNAL OF INFORMATION SECURITY AND APPLICATIONS 2015年第Feb.期20卷 3-10页

作者： Thangavel, M. Varalakshmi, P. Murrali, Mukund Nithya, K. Anna Univ Dept Informat Technol Madras 600044 Tamil Nadu India

Public-key cryptography can be claimed as the greatest and an excellent revolution in the field of cryptography. A public-key cryptosystem is used for both confidentiality and authentication. One such public-key cryptosystem is the rsa cryptosystem. In this paper, a modified and an enhanced scheme based on rsa public-key cryptosystem is developed. The proposed algorithm makes use of four large prime numbers which increases the complexity of the system as compared to traditional rsa algorithm which is based on only two large prime numbers. In the proposed Enhanced and Secured rsa Key Generation Scheme (ESRKGS), the public component n is the product of two large prime numbers but the values of Encryption (E) and Decryption (D) keys are based on the product of four large prime numbers (N) making the system highly secured. With the existing factorization techniques, it is possible only to find the primes p and q. The knowledge of n alone is not sufficient to find E and D as they are based on N. The time required for cryptanalysis of ESRKGS is higher than traditional rsa cryptosystem. Thus the system is highly secure and not easily breakable. A comparison is done between the traditional rsa scheme, a recent rsa modified scheme and our scheme to show that the proposed technique is efficient. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Cryptosystem rsa algorithm Public key Private key Encryption Decryption

来源：评论

学校读者我要写书评

暂无评论

A new serial/parallel architecture for a low power modular multiplier

A new serial/parallel architecture for a low power modular m...

引用

16th International-Federation-for-Information-Processing World Computer Congress (IFIP 2000)/Annual Conference of TC11 (SEC 2000)

作者： Grossschädl, J Graz Univ Technol Inst Appl Informat Proc & Commun IAIK A-8010 Graz Austria

ISBN: (纸本)0792379144

A new architecture for a modular multiplier is introduced that allows the efficient implementation of a low-power crypto coprocessor for smartcards. The multiplier architecture is optimized for accelerating asymmetric cryptographic operations based on long integer modular;arithmetic. A modular multiplication is performed in a serial/parallel manner, this means the multiplier is scheduled sequentially (bit by bit) and the multiplicand is scheduled fully parallel. The modular reduction operation is integrated within the multiplication by continued modulus subtraction, it is shown that the serial/parallel architecture can be realized very easily in a full custom design methodology due to its high degree of regularity. For a 1024 bit modular multiplication the proposed multiplier requires about 1600 clock cycles, which allows to compute a 1024 bit rsa, exponentiation in approx. 250 ms if the clock frequency is 10 MHz.

关键词： public key cryptography rsa algorithm smartcard crypto coprocessor modular arithmetic serial/parallel multiplier architecture low power VLSI design half bit-level pipelining full custom design methodology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：