Sciweavers

5446 search results - page 308 / 1090
» Mobile computing
Sort
View
IJNSEC
2010
324views more  IJNSEC 2010»
14 years 10 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
CSIE
2009
IEEE
15 years 7 months ago
An Efficient Mixed-Mode Execution Environment for C on Mobile Phone Platforms
Mobile devices are constrained in terms of computational power, battery lifetime and memory sizes. Software development for mobile devices is further complicated by application co...
Taekhoon Kim, Sungho Kim, Kirak Hong, Hwangho Kim,...
PERCOM
2003
ACM
16 years 3 months ago
Location-Based E-Campus Web Services: From Design to Deployment
In our previous work, we have designed, using a network-based approach, and are currently deploying on Purdue wireless Infrastructure, a Web service for location discovery of 802....
Simon G. M. Koo, Catherine Rosenberg, Hoi-Ho Chan,...
109
Voted
SACRYPT
2004
Springer
15 years 9 months ago
On Proactive Secret Sharing Schemes
Abstract. This paper investigates the security of Proactive Secret Sharing Schemes. We start with revision of the mobile adversary model of Herzberg’s et al. imposing less restri...
Ventzislav Nikov, Svetla Nikova
ICPPW
2002
IEEE
15 years 8 months ago
ARA - The Ant-Colony Based Routing Algorithm for MANETs
A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kind of networks are very flexible, thus they do not require any existing infr...
Mesut Günes, Udo Sorges, Imed Bouazizi