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.
The paper proposes improving methods to advance the matching rate for multi-pattern string matching algorithm Wu-Manber. First, string abstract value matching method advances the precision of the first matching, and reduces the string comparing times; second, heuristic matching method increases the safe moving distance when the matching of string matched is successful; third, multi-level cache parallel...
This paper describes an efficient hardware implementation of Elliptic Curve Cryptography (ECC) over GF(p). First it introduces an improved Montgomery modular multiplication method for efficient hardware implementation. The method velocity is faster compared to published implementations under equivalent cost. Then, the paper presents a fast mechanism of accelerating the elliptic curve point operation...
This page presents an improving method which realizes parallel operation in cell arithmetic unit and between cell arithmetic units to improve the speed of Montgomery modular multiplication algorithmic. Firstly, every cycle of Montgomery modular multiplication algorithmic has two parallel multiplication by improving Montgomery algorithmic; secondly, multi-cycle pipelining parallel computers by making...
This paper describes a hardware implementation of modular multiplication coprocessor for both RSA and ECC Cryptosystems. Using a self-improvement Montgomery modular multiplication algorithm, the coprocessor completes a modular multiplication with less clock cycles under the equivalent circumstance of the other designs. This modular multiplier can deal with variable operand lengths, from 128 to 2048...
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.