Author:
Baktır Selçuk,Kumar Sandeep,Paar Christof,Sunar Berk
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Reference20 articles.
1. Bailey DV, Paar C (1998) Optimal extension fields for fast arithmetic in public-key algorithms. In: Krawczyk H (ed) Advances in cryptology—CRYPTO ’98, vol LNCS 1462. Springer, Berlin Heidelberg New York, pp 472–485
2. Bailey DV, Paar C (2001) Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. J Cryptol 14(3):153–176
3. Baktır S, Sunar B (2005) Finite field polynomial multiplication in the frequency domain with application to elliptic curve cryptography. Technical report. Worcester Polytechnic Institute, Worcester
4. Baktır S, Sunar B (2006) Finite field polynomial multiplication in the frequency domain with application to elliptic curve cryptography. In: Proceedings of the 21st international symposium on computer and information sciences (ISCIS 2006). Lecture notes in computer science (LNCS), vol 4263. Springer, Berlin Heidelberg New York, pp 991–1001
5. Batina L, Örs SB, Preneel B, Vandewalle J (2003) Hardware architectures for public key cryptography. Integr VLSI J 34(6):1–64
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献