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.
This paper introduces an improved high-performance elliptic curve cryptographic processor for general curves over GF(p), which is based on affine coordinates and systolic modular division and multiplication units. In this paper, we introduces a unified modular division and Montgomery multiplication algorithm, and make an improvement of the systolic modular division and multiplication unit to reduce...
Modular inversion in the Galois field GF(p) is a part of the kernel arithmetic operations used by many public key cryptosystems, and its high-speed hardware design is necessary. A fast algorithm and its hardware architecture for modular inversion in GF(p) are proposed in this work. The algorithm reduces 30 percent iteration cycles compared with previous algorithms reported in the literature. The proposed...
The longest common subsequence (LCS) problem is to find an LCS of two strings and the length of the LCS (LLCS). Many previous works focused on reducing the processing time. However, most require too large memory space in total, resulting in being not suitable for hardware implementation. In this paper, we propose a hardware-implementable algorithm and its systolic architecture. The algorithm achieves...
String matching is one of hot spots in computer science. Many algorithms for string matching have been proposed, but designing an efficient and practical string matching architecture to satisfy high-speed data streaming is difficult and needs further study. In this paper we propose a high throughput configurable string matching architecture based on Aho-Corasick algorithm. The architecture can be...
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.