메뉴 건너뛰기




Volumn 49, Issue 1-3, 2008, Pages 199-215

The trace of an optimal normal element and low complexity normal bases

Author keywords

Dual basis; Finite fields; Low complexity; Normal basis

Indexed keywords

DUAL BASIS; FINITE FIELDS; LOW COMPLEXITY; NORMAL BASIS;

EID: 51349114227     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-008-9195-5     Document Type: Article
Times cited : (16)

References (15)
  • 3
    • 0011495286 scopus 로고
    • Ph.D thesis, University of Waterloo, Waterloo, ON, Canada.
    • Gao S. Normal bases over finite fields. Ph.D thesis, University of Waterloo, Waterloo, ON, Canada (1993).
    • (1993) Normal Bases over Finite Fields
    • Gao, S.1
  • 5
    • 0000573183 scopus 로고
    • Über die Darstellung der Zahlen eines Gattungsbereiches für einen beliebigen Primdivisor
    • Hensel K. (1888). Über die Darstellung der Zahlen eines Gattungsbereiches für einen beliebigen Primdivisor. J. Reine Angew. Math. 103: 230-237
    • (1888) J. Reine Angew. Math. , vol.103 , pp. 230-237
    • Hensel, K.1
  • 7
    • 0000749309 scopus 로고
    • On Artin's conjecture and Euclid's algorithm in global fields
    • Lenstra H.W. (1977). On Artin's conjecture and Euclid's algorithm in global fields. Invent. Math. 42: 202-224
    • (1977) Invent. Math. , vol.42 , pp. 202-224
    • Lenstra, H.W.1
  • 10
    • 0002371890 scopus 로고    scopus 로고
    • On primes in arithmetic progression having a prescribed primitive root
    • Moree P. (1999). On primes in arithmetic progression having a prescribed primitive root. J. Number Theory 78: 85-98
    • (1999) J. Number Theory , vol.78 , pp. 85-98
    • Moree, P.1
  • 12
    • 51349151987 scopus 로고    scopus 로고
    • Recommended Elliptic Curves for Federal Government Use, NIST. Available online at
    • Recommended Elliptic Curves for Federal Government Use, NIST. Available online at http://csrc.nist.gov/CryptoToolkit/dss/ecdsa/NISTReCur.pdf (1999).
    • (1999)
  • 13
    • 14844353746 scopus 로고    scopus 로고
    • Low complexity word-level sequential normal-basis multipliers
    • Reyhani-Masoleh A., Hasan A. (2005). Low complexity word-level sequential normal-basis multipliers. IEEE Trans. Comput. 54: 98-110
    • (2005) IEEE Trans. Comput. , vol.54 , pp. 98-110
    • Reyhani-Masoleh, A.1    Hasan, A.2
  • 14
    • 33847298954 scopus 로고    scopus 로고
    • On the complexity of the dual basis of a type i optimal normal basis
    • Wan Z., Zhou K. (2007). On the complexity of the dual basis of a type I optimal normal basis. Finite Fields Appl. 13: 411-417
    • (2007) Finite Fields Appl. , vol.13 , pp. 411-417
    • Wan, Z.1    Zhou, K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.