检索结果-南通市图书馆

A New Fast modular arithmetic Method in Public Key Cryptography

Wuhan University Journal of Natural Sciences 2006年第6期11卷 1645-1648页

作者： WANG Bangju ZHANG Huanguo School of Computer Wuhan University Wuhan 430072 Hubei China School of Science Huazhong Agricultural University Wuhan 430070 Huhei China

modular arithmetic is a fundamental operation and plays an important role in public key cryptosystem. A new method and its theory evidence on the basis of modular arithmetic with large integer modulus-changeable modulus algorithm is proposed to improve the speed of the modular arithmetic in the presented paper. For changeable modulus algorithm, when modular computation of modulo n is difficult, it can be realized by computation of modulo n-1 and n-2 on the perquisite of easy modular computations of modulo n-1 and modulo n-2. The conclusion is that the new method is better than the direct method by computing the modular arithmetic operation with large modulus. Especially, when computations of modulo n-1 and modulo n-2 are easy and computation of modulo n is difficult, this new method will be faster and has more advantages than other algorithms on modular arithmetic. Lastly, it is suggested that the proposed method be applied in public key cryptography based on modular multiplication and modular exponentiation with large integer modulus effectively

关键词： public key cryptography modular arithmetic modular multiplication modular exponentiation

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Efficient CRT-based residue-to-binary converter for the arbitrary moduli set

引用

Science China(Information Sciences) 2011年第1期54卷 70-78页

作者： CHEN JianWen & YAO RuoHe School of Electronic and Information Engineering,South China University of Technology, Guangzhou 510640,China School of Electronic and Information Engineering South China University of Technology

The conversion from residue to weighted binary representation plays an important role in the residue number *** on Chinese Remainder Theorem,a new residue-to-binary converter using arbitrary moduli set is *** new converter uses the difference-correction algorithm for the conversion output and eliminates the modulo M operation,where M is the dynamic range of the residue number *** sizes of the multipliers and modular multipliers in the new converter are small,thereby reducing the area and delay of the proposed *** and synthesis results indicate that the new converter is more area-time effcient than the published converters based on Chinese Remainder Theorem.

关键词： RNS Chinese Remainder Theorem difference correction modular arithmetic residue-to-binary arbitrary moduli set

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Improved Software Implementation for Montgomery Elliptic Curve Cryptosystem

引用

Computers, Materials & Continua 2022年第3期70卷 4847-4865页

作者： Mohammad Al-Khatib Wafaa Saif Computer Science Department College of Computer and Information SciencesImam Mohammad Ibn Saud Islamic University(IMSIU)RiyadhSaudi Arabia

The last decade witnessed rapid increase in multimedia and other applications that require transmitting and protecting huge amount of data streams *** such applications,a high-performance cryptosystem is compulsory to provide necessary security *** curve cryptosystem(ECC)has been introduced as a considerable ***,the usual sequential implementation of ECC and the standard elliptic curve(EC)form cannot achieve required performance ***,the widely used Hardware implementation of ECC is costly option and may be not *** research aims to develop a high-performance parallel software implementation for *** achieve this,many experiments were performed to examine several factors affecting ECC performance including the projective coordinates,the scalar multiplication algorithm,the elliptic curve(EC)form,and the parallel *** ECC performance was analyzed using the different factors to tune-up them and select the best choices to increase the speed of the *** results illustrated that parallel Montgomery ECC implementation using homogenous projection achieves the highest performance level,since it scored the shortest time delay for ECC *** addition,results showed thatNAF algorithm consumes less time to perform encryption and scalar multiplication operations in comparison withMontgomery ladder and *** multi-threading technique was adopted to implement ECC computations in *** proposed multithreaded Montgomery ECC implementation significantly improves the performance level compared to previously presented parallel and sequential implementations.

关键词： Elliptic curve cryptosystem parallel software implementation multi-threading scalar multiplication algorithms modular arithmetic

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Diophantine Quotients and Remainders with Applications to Fermat and Pythagorean Equations

引用

American Journal of Computational Mathematics 2023年第1期13卷 199-210页

作者： Prosper Kouadio Kimou François Emmanuel Tanoé Department of Mathematics and Computer Science Félix Houphouet-Boigny National Polytechnic Institute Yamoussoukro Ivory Coast UFR Mathematics of Computer Science Université Félix Houphouet-Boigny Abidjan Ivory Coast

Diophantine equations have always fascinated mathematicians about existence, finitude, and the calculation of possible solutions. Among these equations, one of them will be the object of our research. This is the Pythagoras’- Fermat’s equation defined as follows. (1) when , it is well known that this equation has an infinity of solutions but has none (non-trivial) when . We also know that the last result, named Fermat-Wiles theorem (or FLT) was obtained at great expense and its understanding remains out of reach even for a good fringe of professional mathematicians. The aim of this research is to set up new simple but effective tools in the treatment of Diophantine equations and that of Pythagoras-Fermat. The tools put forward in this research are the properties of the quotients and the Diophantine remainders which we define as follows. Let a non-trivial triplet () solution of Equation (1) such that . and are called the Diophantine quotients and remainders of solution . We compute the remainder and the quotient of b and c by a using the division algorithm. Hence, we have: and et with . We prove the following important results. if and only if and if and only if . Also, we deduce that or for any hypothetical solution . We illustrate these results by effectively computing the Diophantine quotients and remainders in the case of Pythagorean triplets using a Python program. In the end, we apply the previous properties to directly prove a partial result of FLT. .

关键词： Diophantine Equation modular arithmetic Fermat-Wiles Theorem Pythagorean Triplets Division Theorem Division Algorithm Python Program Diophantine Quotients Diophantine Remainders

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

模n的原根快速查找算法

模n的原根快速查找算法

引用

2006年全国理论计算机科学学术年会

作者：徐子珊重庆工商大学

＜正＞若模n有原根,则原根有很多优良性质,在很多场合中需要找到模n的原根。然而,如何有效地查找模n的原根却被认为是很无奈的。 1 预备

关键词： modular arithmetic Primitive root Randomized algorithm Probability distribute Expectation

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：