Sciweavers

128 search results - page 16 / 26
» Fast Integer Multiplication using Modular Arithmetic
Sort
View
FPL
2010
Springer
180views Hardware» more  FPL 2010»
13 years 6 months ago
A Karatsuba-Based Montgomery Multiplier
Abstract--Modular multiplication of long integers is an important building block for cryptographic algorithms. Although several FPGA accelerators have been proposed for large modul...
Gary Chun Tak Chow, Ken Eguro, Wayne Luk, Philip L...
TIT
2011
152views more  TIT 2011»
13 years 2 months ago
Fast Exponentiation Using Split Exponents
Abstract—We propose a new method to speed up discrete logarithm (DL)-based cryptosystems by considering a new variant of the DL problem, where the exponents are formed as e1 + α...
Jung Hee Cheon, Stanislaw Jarecki, Taekyoung Kwon,...
DAGSTUHL
2010
13 years 10 months ago
CSG Operations of Arbitrary Primitives with Interval Arithmetic and Real-Time Ray Casting
We apply Knoll et al.'s algorithm [9] to interactively ray-cast constructive solid geometry (CSG) objects of arbitrary primitives represented as implicit functions. Whereas m...
Younis Hijazi, Aaron Knoll, Mathias Schott, Andrew...
JUCS
2010
124views more  JUCS 2010»
13 years 6 months ago
Performance Optimizations for DAA Signatures on Java enabled Platforms
: With the spreading of embedded and mobile devices, public-key cryptography has become an important feature for securing communication and protecting personal data. However, the c...
Kurt Dietrich, Franz Röck
AUTOMATICA
2002
145views more  AUTOMATICA 2002»
13 years 8 months ago
Analysis of dual-rate inferential control systems
For a dual-rate control system where the output sampling interval is an integer multiple of the control interval, we propose a model-based inferential control scheme which uses a ...
Dongguang Li, Sirish L. Shah, Tongwen Chen