The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Recently, Security requirements forelectronic transactions have become an important concern. RSA is the widely adopted public key algorithms. The RSA public key cryptography uses modular exponentiation operation both for encryption and decryption. A famous approach is Montgomery modular multiplication decreases the multiplication period dramatically. Today's system loses information after every logic...
Since a web-technology has arisen and clouds has come, every application wants to be online and operates with sensitive data that cannot but attract anyone to get an access this data. It means an urgent need in security. Examining the clouds leads us to different visions of security controls and metrics per each cloud vendor while industrial organizations try to help to the vendors and their customers...
Modular exponentiation with large modulus and exponent, which is usually accomplished by repeated modular multiplications, has been widely used in public key cryptosystems. Typically, the Montgomery's modular-multiplication algorithm is used since no trial division is necessary, and the carry-save addition (CSA) is employed to reduce the critical path. In this paper, we optimize the Montgomery's multiplication...
Rivest, Shamir and Adleman (RSA) encryption algorithm is one of the most widely used and popular public-key cryptosystem. The main step in this algorithm is modular exponentiation which can be done by a sequence of modular multiplication. Thus, modular multiplication is the major factor, in many cryptosystems, e.g. the RSA Two-Key system and in the proposed digital signature standard DSS. One of the...
We propose a fast modular arithmetic logic unit (MALU) that is scalable in the digit size (d) and the field size (k). The datapath of MALU has chains of carry save adders (CSAs) to speed up the large integer arithmetic operations over GF(p) and GF(2m). It is well suited and very efficient for the modular multiplication and addition/subtraction which are the computational kernels of elliptic curve...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.