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.
As a generalization of double base chains, multi-base number system is very suitable for efficient computation of scalar multiplications of elliptic curves because of shorter representation length and less Hamming weight. In this paper, combined with the given formulas for computing the 5-fold of an elliptic curve point P, an efficient scalar multiplication algorithm of elliptic curve is proposed...
By applying interleaving to Window TNAF Algorithm, this paper advances a new scalar multiplication algorithm. The algorithm has no precomputation, just exerts interleaving at the evaluation stage. Because of high performance of Frobenius map, additionally making use of interleaving, efficiency of the new algorithm is higher than traditional window algorithm.
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.