مقالههای Ehsan Malekian
توجه: محتویات این صفحه به صورت خودکار پردازش شده و مقالههای نویسندگانی با تشابه اسمی، همگی در بخش یکسان نمایش داده میشوند.
اطلاعات انتشار: شانزدهیمن کنفرانس مهندسی برق ایران، سال ۱۳۸۷
تعداد صفحات: ۶
In this paper, an efficient architecture for the implementation of polynomial basis multipliers over GF(2m) is presented. The proposed architecture provides an efficient execution of the Least Significant Bit (LSB)–first, bit–serial multiplication for different operand lengths. The selection of (LSB)–first over the (MSB)–first, is its implementation suitability with reduced delay time. The main features of the proposed architecture are its hardware simplicity which results in small area implementation, flexible Galois field sizes, and improvement of maximum clock frequency with lessen critical path delay. These abilities achieved by means of employing a binary tree structure of OR gates added to the (LSB)–first multiplier.<\div>
اطلاعات انتشار: هفتمین کنفرانس انجمن رمز ایران، سال ۱۳۸۹
تعداد صفحات: ۷
In this paper, a classic example of a public key cryptosystem with non–associative algebra has been presented in order to show that the non–associative algebra also has the potential to be used in the public key cryptosystems. The proposed scheme is similar to the NTRU public key cryptosystem and can be regarded as a multi–dimensional and probabilistic cryptosystem in which the basic operations are very fast and efficient. The underlying algebra in the proposed scheme is based on the octonions algebra defined over the convolution polynomial ring with coefficients in GF(3)[X]. The most important conclusion of the proposed scheme is that the basic concept behind the NTRU cryptosystem is an abstract concept and it can be generalized to an algebra broader than Dedekind domain.<\div>
اطلاعات انتشار: International Journal of Information Security، سوم،شماره۱، Jan ۲۰۱۱، سال ۰
تعداد صفحات: ۱۴
In this paper we will construct a lattice–based public–key cryptosystem using non–commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice–based cryptosystems such as NTRU. As in NTRU, the proposed public–key cryptosystem relies for its inherent security on the intractability of finding the shortest vector in a certain non–convolutional modular lattice, yet it is efficient and cost effective, contrary to cryptosystems such as RSA or ECC. The detailed specification of the proposed cryptosystem, including the underlying algebraic structure, key generation, encryption and decryption process and also the issues regarding key security, message security, and probability of successful decryption are explained.We will further show, based on the existing results for lattice–reduction algorithms, that the proposed cryptosystem with a dimension of 41 will have a security equal to NTRU–167.
نمایش نتایج ۱ تا ۳ از میان ۳ نتیجه