| N. Potlapally, S. Ravi, A. Raghunathan, and G. Lakshminarayana, "Optimizing Public-Key Encryption for Wireless Clients," Proc. IEEE Int'l Conf. Comm., pp. 1050-1056, May 2002. |
No context found.
N. Potlapally, S. Ravi, A. Raghunathan, and G. Lakshminarayana, "Optimizing Public-Key Encryption for Wireless Clients," Proc. IEEE Int'l Conf. Comm., pp. 1050-1056, May 2002.
No context found.
N. Potlapally, S. Ravi, A. Raghunathan, and G. Lakshminarayana, "Optimizing public-key encryption for wireless clients," in Proc. IEEE Int. Conf. Communications, pp. 1050--1056, May 2002.
....implementing only a subset of a protocol s many features, it is possible to reduce the security processing workload on a wireless client. The security processing workload of a security protocol can also be reduced by selecting optimal SW implementations for its constituent cryptographic algorithms [37]. Security protocols can also also be made to adapt their encryption policies based on the content of the data being encrypted. Video encryption algorithms such as [38, 39] focus on protecting the more important parts of a video stream, thereby reducing the total amount of data encrypted. Another ....
....a brief overview of various aspects of the MOSES project, including hardware software architectures and design methodologies, and conclude with a performance analysis of the platform when used for accelerating a complete end to end secure wireless transaction. Further details are available in [37, 51, 52]. Program RAM Data Coprocessors Bridge SOC Bus HW Gnu GMP basic ops Security primitives SSL IPSec WTLS Apps. Complex ops. RSA encrypt( DES encrypt( mpn add n( mpn submul 1( udivsi3( Mod exp( Mod mul( Sbox( ....
N. Potlapally, S. Ravi, A. Raghunathan, and G. Lakshminarayana, "Optimizing Public-Key Encryption for Wireless Clients," in Proc. IEEE Int. Conf. Communications, pp. 1050--1056, May 2002.
....public key algorithms. Over 450 candidate algorithms were considered for evaluation due to the permutations arising from five modular multiplication algorithms, five input block sizes, three Chinese Remainder Theorem implementations, two radix sizes and three different software caching options [24]. Performance macro model based evaluation of all the algorithm candidates completes in under 4 hours and 40 minutes. In comparison, only six algorithm candidates could be evaluated in nearly 66 hours of CPU time, using actual ISS runs. On an average, macro model based performance estimation was ....
N. Potlapally, S. Ravi, A. Raghunathan, and G. Lakshminarayana, "Optimizing Public-Key Encryption for Wireless Clients," in Proc. IEEE Int. Conf. Communications, May 2002.
No context found.
N. Potlapally, S. Ravi, A. Raghunathan, and G. Lakshminarayana, "Optimizing Public-Key Encryption for Wireless Clients," Proc. IEEE Int'l Conf. Comm., pp. 1050-1056, May 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC