최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기電子工學會論文誌. Journal of the Institute of Electronics Engineers of Korea. SC, 시스템 및 제어, v.41 no.1 = no.295, 2004년, pp.33 - 40
장남수 (고려대학교 정보보호대학원) , 한동국 (고려대학교 정보보호대학원) , 정석원 (고려대학교 정보보호대학원) , 김창한 (세명대학교 정보보호학과)
The divide-and-conquer method is efficiently used in parallel multiplier over finite field
ANSI X9.62, 'Public key. cryptography for the financial services industry : The Elliptic Curve Digital Signature Algorithm (ECDSA)', (available from the ANSI X9 catalog), 1999
H. Cohen, 'A Course in Computational Algebric Number Theory', Springer-Verlag, Berlin, Heidelberg, 1993
G. Drolet, 'A New Representation of Elements of Finite Fields $GF(2^m)$ Yielding Small Compl-exity Arithmetic circuit}, IEEE Trans. on Computers, vol 47, 1998, 353-356
M. Ernst, M. Jung, F. Madlener, S. Huss, and R. Blumel, 'A Reconfigurable System on Chip Implementation for Elliptic Curve Ctryptogra-phy over $GF(2^n)$ ', In Work shop on Crypto-graphic Hardware and Embedded Systems (CHES'02), LNCS2523, (2002), 381-399
IEEE 1363, 'Standard Specifications For Public Key Cryptography', http://grouper.ieee.org/groups /136 3/,2000. 381-399
K.O. Geddes, S.R. Czapor, and G.Labahn,'Algorithms for Computer Algebra, Kluwer Aca-demic Publishers', 1992
C. K. Koc, and B. Sunar, 'Low- Complexity Bit-Parallel Canonical and Normal Basis Multi pliers for a Class of Finite Fields', Proceeding of 1998 IEEE International Symposium on Information Theory, MIT, Cambridge, Massachusetts, August 16-21, 1998
N. Koblitz, 'Elliptic Curve Cryptosystems,' Mathematics of Computation, vol. 48, pp. 203-209, 1987
M. Leone, 'A New Low Complexity Parallel Multiplier for a Class of Finite Fields', In Workshop on Cryptographic Hardware and Embedded Systems (CHES'01),LNCS2162, (2001), 160-170
V. Miller, 'Use of Elliptic Curve Cryptosystems', Advances in Cryptology, CRYPTO'85, LNCS 218, H. C. Williams,Ed.,Springer-Verlag, 1986, 417-426
C. Paar, 'Efficient VLSI Architecture for Bit-Parallel Computation in Galois Fields', PhD thesis, (Engl. transl.), Institude for Experimen tal Mathmatics, University of Essen, Essen, Germany, June 1994
C. Paar, 'Low complexity parallel Multipliers for Galois fields $GF((2^n)^4)$ based on special types of primitive polynomials, In 1994 IEEE International Symposium on Information Theory, Trondheim, Norway, June 27-July 1 1994
Paar C., 'A new architecture for a parallel finite fields multiplier with Low Complexity Based on Composite Fields', IEEE Trans. on Computers, vol45, no. 7, July 1996, 846-861
C. Paar, P. Fleischmann, P. Roelse, 'Efficient Multiplier Architectures for Galois Fields $GF((2^n)^4)$ , IEEE Transactions on Compute rs, February 1998, vol. 47, no. 2, 162-170
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.