R. B. Lee, Z. Shi, and X. Yang, "Efficient permutations for fast software cryptography," IEEE Micro, vol. 21, pp. 56--69, Dec. 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Securing Wireless Data: System Architecture Challenges - Srivaths Ravi Anand (2002) (Correct)
....in DES 3DES. Multimedia instruction set architecture (ISA) extensions such as those in PA RISC s Max2 [43] or IA 64 [44] already incorporate instructions for permutations of 8 bit or larger sub words. For arbitrary bit level permutations, only recently have efficient instructions been proposed [45]. Instruction set extensions have also been proposed for other operations such as substitutions, rotates and modular arithmetic present in different private key algorithms [46] Many such extensions have already been applied to embedded processors used in the wireless handset domain. For example, ....
R. B. Lee, Z. Shi, and X. Yang, "Efficient Permutations for Fast Software Cryptography," IEEE Micro, vol. 21, pp. 56--69, Dec. 2001.
Security as a New Dimension in Embedded System Design - Kocher, Lee, McGraw.. (2004) (2 citations) (Correct)
No context found.
R. B. Lee, Z. Shi, and X. Yang, "Efficient permutations for fast software cryptography," IEEE Micro, vol. 21, pp. 56--69, Dec. 2001.
Securing Mobile Appliances: New Challenges for the.. - Raghunathan, Ravi.. (2003) (Correct)
No context found.
R. B. Lee, Z. Shi, and X. Yang, "Efficient Permutations for Fast Software Cryptography," IEEE Micro, vol. 21, pp. 56--69, Dec. 2001.
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