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

1st International Conference on Computer Science, Engineering and Information Technology (CCSEIT 2011)

作者： Prabu, M. Shanmugalakshmi, R. Anna Univ Coimbatore Coimbatore Tamil Nadu India Govt Coll Technol CSE Coimbatore Tamil Nadu India

ISBN: (纸本)9783642240423;9783642240430

In this paper, we present a background on Elliptic Curve Cryptography, along with the montgomery operation, which plays major role on Elliptic Curve Cryptosystem and side channel attacks on EC-montgomery operations. We have also provided a brief background on File Register architecture and proposed a new design level of EC-montgomery addition algorithm. These design level architecture are designed in an efficient manner. Realizing the proposed design level of FPGA technology. Through this FPGA based technology very advantageous results were found when compared against other existing designs. Even though our design bears an extra computation time. it reduces the area space or register gate area space due to reassigning the design and power analysis attack.

关键词： montgomery algorithm Elliptic Curve Cryptosystem Computation time FPGA technology

来源：评论

学校读者我要写书评

暂无评论

Fast Modular Multiplication Execution in Residue Number System

Fast Modular Multiplication Execution in Residue Number Syst...

引用

IEEE Conference on Quality Management, Transport and Information Security, Information Technologies (IT&MQ&IS)

作者： Chervyakov, Nikolai I. Babenko, Mikhail G. Kuchukov, Viktor A. Deryabin, Maxim A. Kuchukova, Nataliya N. Tchernykh, Andrei N. North Caucasus Fed Univ Math & Math Modelling Stavropol Russia CICESE Res Ctr Ensenada Baja California Mexico

ISBN: (纸本)9781509036806

In the paper, we propose a new method of modular multiplication computation, based on Residue Number System. We use an approximate method to find the approximate method a residue from division of a multiplication on the given module. We substitute expensive modular operations, by fast bit right shift operations and taking low bits. The carried-out simulation on Kintex7 XC7K70T board showed that the offered method allows to win in time on average for 75%, and in the area -- on average for 80% relatively to modified method from work [1] that makes it more applicable for the hardware implementation of the cryptography primitives constructed over a simple finite field.

关键词： approximate method FPGA montgomery algorithm residue number system

来源：评论

学校读者我要写书评

暂无评论

A Novel and Efficient Design for an RSA Cryptosystem With a Very Large Key Size

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2015年第10期62卷 972-976页

作者： Huang, Xinming Wang, Wei Worcester Polytech Inst Dept Elect & Comp Engn Worcester MA 01609 USA

This brief presents a novel and efficient design for a Rivest-Shamir-Adleman (RSA) cryptosystem with a very large key size. A new modular multiplier architecture is proposed by combining the fast Fourier transform-based Strassen multiplication algorithm and montgomery reduction, which is different from the interleaved version of montgomery multiplications used in traditional RSA designs. A new modular exponentiation algorithm is also proposed for the RSA design. Applying this method, we have implemented 8K/12K-bit and 48K-bit RSA on application-specific integrated circuit designs. The results show that the proposed method gains more advantage as the key size increases, which matches the complexity analysis. Performance comparisons show that the 48K-bit design, which is applicable for both RSA and fully homomorphic encryption, outperforms the previous works with respect to throughput and efficiency.

关键词： Application-specific integrated circuit (ASIC) fully homomorphic encryption (FHE) montgomery algorithm Rivest-Shamir-Adleman (RSA) Strassen's multiplication

来源：评论

学校读者我要写书评

暂无评论

FPGA Implementation of Modified Serial montgomery Modular Multiplication for 2048-bit RSA Cryptosystems 16

FPGA Implementation of Modified Serial Montgomery Modular Mu...

引用

International Seminar on Intelligent Technology and Its Applications (ISITIA)

作者： Hanindhito, Bagus Ahmadi, Nur Hogantara, Hafez Arrahmah, Annisa I. Adiono, Trio Bandung Inst Technol Dept Elect Engn Sch Elect Engn & Informat Jl Ganesha 10 Bandung 40132 Indonesia

ISBN: (纸本)9781479977116

RSA (Rivest, Shamir, Adleman) is one of the most widely used cryptographic algorithms worldwide to perform data encryption and decryption. An essential step in RSA computation lies on its modular multiplication which is relatively expensive and time consuming to be implemented in hardware. This paper proposes two modular multiplication architectures based on modified serial montgomery algorithm for 2048-bit RSA. By limiting the integer modulo that has sequence of A094358, a very simple and fast modular multiplication hardware can be developed. The first archictecture which incorporates 2048-bit adders performes better in term of latency (19010 Logic Cells, 2048 clock cycles or 0.0022 s), while the second architecture utilizing multiple smaller 128-bit adders offers less area consumption (8926 Logic Cells, 36864 clock cycles or 0.0031 s). An area multiplied with squared latency (AT(2)) can be used as trade-off parameter for choosing the most suitable design for certain need. For prototyping purpose, we have successfully synthesized and implemented our proposed designs written in VHDL using Altera Quartus II with Cyclone II EP2C70F896C6 FPGA as a target board.

关键词： RSA Modular Multiplication montgomery algorithm Sequence of A094358 FPGA

来源：评论

学校读者我要写书评

暂无评论

Research and Implementation of Four-prime RSA Digital Signature algorithm 14

Research and Implementation of Four-prime RSA Digital Signat...

引用

14th IEEE/ACIS International Conference on Computer and Information Science (ICIS)

作者： Xiao, Zhenjiu Wang, Yongbin Jiang, Zhengtao Commun Univ China Sch Comp Sci Beijing Peoples R China Liaoning Tech Univ Coll Software Huludao Peoples R China

ISBN: (纸本)9781479986798

Big module RSA signature algorithm is very popular these years. We try to improve it and get more operation efficiency. We proposed a four-prime Chinese Remainder Theorem (CRT)-RSA digital signature algorithm in this paper. We used the Hash function SHA512 to make message digest. We optimized large number modular exponentiation with CRT combining in montgomery algorithm. Our experiment shows that our method got good performance. The security analysis shows higher signature efficiency on resistance of common attacks.

关键词： RSA encryption algorithm Four prime Chinese remainder theorem montgomery algorithm Hash function Digital signature

来源：评论

学校读者我要写书评

暂无评论

Implementation of Cryptography algorithm for E-Passport Security

Implementation of Cryptography Algorithm for E-Passport Secu...

引用

IEEE International Conference on Inventive Computation Technologies (ICICT)

作者： Sharma, Shruti Zodpe, Harshali Maharashtra Inst Technol Dept Elect & Commun Pune Maharashtra India

Information Security is a major issue worldwide. Various steps are being taken to improve and upgrade security measures. Border crossings across countries have become one of them. Therefore the use of traditional passports has lead to an improvement in the name of E-passports. E-passports are a more secured and are denoted by a symbol. E-passports contain a small chip which stores the data of passport holder. To protect this data Cryptography is widely used. This paper shows the comparison of modular multiplication methods used for RSA algorithm for 1024 bit key length. Xilinx ISE 14.3 platform is used to perform this encryption and decryption process targeting Virtex-5 FPGA board.

关键词： Cryptography RSA Security: E-passport VHDL montgomery algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of Multipliers based on Square and Multiply and montgomery algorithms

Performance comparison of Multipliers based on Square and Mu...

引用

International Conference on Green Computing Communication and Electrical Engineering (ICGCCEE)

作者： Gokul, P. R. Prabhu, E. Mangalam, H. Amrita Vishwa Vidyapeetham Elect & Commun Dept Coimbatore Tamil Nadu India Sri Krishna Coll Engn & Technol Elect & Commun Dept Coimbatore Tamil Nadu India

ISBN: (纸本)9781479949816

Modular multiplication is the core arithmetic for most of the Cryptographic applications. montgomery multiplication is one of the fastest methods available for performing modular multiplication. A k - partition method for montgomery multiplication is thoroughly studied and analysed. This method reduces the time complexity of multiplication from O (n) to O (n/k). Another method for modular exponentiation - Square and Multiply method is implemented. As the name suggests, squaring is the main principle behind this method. The implementation results are compared with that of an ordinary montgomery multiplier and the k - partition method in terms of power and area constraints. Results for 128, 256, 512 and 1024 bit input operands show that the Square and Multiply method is more power efficient than the other two.

关键词： Cryptography modular multiplication montgomery algorithm

来源：评论

学校读者我要写书评

暂无评论

Modular Arithmetic Analyses for RSA Cryptosystem

Modular Arithmetic Analyses for RSA Cryptosystem

引用

International Symposium on Computer, Consumer and Control (IS3C)

作者： Wu, Chia-Long Hu, Chen-Hao Air Force Inst Technol Aviat Commun Elect Dept Kaohsiung Taiwan

ISBN: (纸本)9781479952779

In many consumer electronics computation problem, the modular exponentiation is a common operation for scrambling secret data and is used by several public-key cryptosystems, such as the RSA method. In this paper, an algorithm is proposed, which combines binary exponentiation method, the common-multiplicand multiplication (CMM) method, and the signed-digit recoding (SDR) method for fast modular exponentiation consumer electronics application.

关键词： montgomery algorithm multiplication technique signed-digit recoding information security cryptosystems

来源：评论

学校读者我要写书评

暂无评论

Improved RNS montgomery Modular Multiplication with Residue Recovery

Improved RNS Montgomery Modular Multiplication with Residue ...

引用

International Conference on Soft Computing Techniques and Engineering Application (ICSCTEA)

作者： Wu, Tao Li, Shuguo Liu, Litian Tsinghua Univ Dept Microelect & Nanoelect Beijing 100084 Peoples R China Tsinghua Univ Inst Microelect Beijing 100084 Peoples R China

ISBN: (纸本)9788132216957;9788132216940

Finite field arithmetic in residue number system (RNS) necessitates modular reductions, which can be carried out with RNS montgomery algorithm. By transforming long-precision modular multiplications into modular multiplications with small moduli, the computational complexity has decreased much. In this work, two implementation methods of RNS montgomery algorithm, residue recovery as well as parallel base conversion, are reviewed and compared. Then, we propose a new residue recovery method that directly employs binary system rather than mixed radix system to perform RNS modular multiplications. This improvement is appropriate for a series of long-precision modular multiplications with variant operands, in which it is more efficient than parallel base conversion method.

关键词： montgomery algorithm Residue number system Binary system

来源：评论

学校读者我要写书评

暂无评论

A Novel Fast Modular Multiplier Architecture for 8,192-bit RSA Cryposystem

A Novel Fast Modular Multiplier Architecture for 8,192-bit R...

引用

IEEE Conference on High Performance Extreme Computing (HPEC)

作者： Wang, Wei Huang, Xinming Worcester Polytech Inst Dept Elect & Comp Engn Worcester MA 01609 USA

ISBN: (纸本)9781479913657;9781479913640

Modular multiplication is the most crucial component in RSA cryptosystem. In this paper, we present a new modular multiplication architecture using the Strassen multiplication algorithm and montgomery reduction. The architecture is different from the interleaved version of montgomery multiplication traditionally used in RSA design. By selecting different bases of 16 or 24 bits, it could perform 8,192-bit or 12,288-bit modular multiplication. The design was synthesized on the Altera's Stratix-V FPGA using Quartus II. It performs one modular multiplication in 2,030 cycles. When operating at 209 MHz, the execution time for an 8K- or 12K-bit modular multiplication is about 9.7 mu s.

关键词： RSA Strassen Multiplication montgomery algorithm FPGA

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：