Sciweavers

604 search results - page 1 / 121
» Efficient Computation of Multiplicative Inverses for Cryptog...
Sort
View
DCC
2002
IEEE
14 years 4 months ago
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
This contribution is concerned with a generalization of Itoh and Tsujii's algorithm for inversion in extension fields GF(qm ). Unlike the original algorithm, the method introd...
Jorge Guajardo, Christof Paar
IJNSEC
2010
324views more  IJNSEC 2010»
12 years 11 months ago
Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
Rajaram Ramasamy, Amutha Prabakar Muniyandi
ICMCS
2008
IEEE
336views Multimedia» more  ICMCS 2008»
13 years 11 months ago
SIMD optimization of the H.264/SVC decoder with efficient data structure
H.264/scalable video coding (SVC) is a new compression technique that can adapt to various network environments and applications. However, despite its outstanding performance, H.2...
Joohyun Lee, Gwanggil Jeon, Sangjun Park, Taeyoung...
ARITH
2009
IEEE
13 years 11 months ago
Selected RNS Bases for Modular Multiplication
The selection of the elements of the bases in an RNS modular multiplication method is crucial and has a great impact in the overall performance. This work proposes specific sets ...
Jean-Claude Bajard, Marcelo E. Kaihara, Thomas Pla...