{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T09:29:48Z","timestamp":1743326988081},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1007\/bf01418530","type":"journal-article","created":{"date-parts":[[2005,4,12]],"date-time":"2005-04-12T15:02:01Z","timestamp":1113318121000},"page":"333-345","source":"Crossref","is-referenced-by-count":11,"title":["Self-dual bases in $$\\mathbb{F}_{q^n } $$"],"prefix":"10.1007","volume":"3","author":[{"given":"Willi","family":"Geiselmann","sequence":"first","affiliation":[]},{"given":"Dieter","family":"Gollmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TIT.1982.1056591","volume":"28","author":"E.R. Berlekamp","year":"1982","unstructured":"E.R. Berlekamp, Bit-serial Reed-Solomon encoders,IEEE Trans. Inf. Th., IT-28, (1982) pp. 869?874.","journal-title":"IEEE Trans. Inf. Th."},{"key":"CR2","volume-title":"Algebraic coding theory","author":"E.R. Berlekamp","year":"1984","unstructured":"E.R. Berlekamp,Algebraic coding theory, Revised Edition, Aegean Park Press, Laguna Hills, CA (1984).","edition":"Revised Edition"},{"issue":"No. 1","key":"CR3","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BF01199114","volume":"55","author":"T. Beth","year":"1990","unstructured":"T. Beth and W. Geiselmann, Selbstduale Normalbasen inGF(q), Archiv der Mathematik, Vol. 55, No. 1, (1990), pp. 44?48.","journal-title":"Archiv der Mathematik"},{"issue":"No. 4","key":"CR4","first-page":"458","volume":"7","author":"T. Beth","year":"1989","unstructured":"T. Beth and D. Gollmann Algorithm Engineering for Public Key Algorithms,IEEE JSAC, Vol. 7, No. 4, (1989) pp. 458?466.","journal-title":"IEEE JSAC"},{"key":"CR5","unstructured":"W. Fumy, \u00dcber orthogonale Transformationen and fehlerkorrigierende Codes. Dissertation, Universit\u00e4t Erlangen, (1986)."},{"key":"CR6","unstructured":"S. Gao and H.W. Lenstra, Jr., Optimal normal bases, to appear inDesigns, Codes and Cryptography."},{"key":"CR7","first-page":"230","volume-title":"Proc. of AAECC-6, Rome","author":"W. Geiselmann","year":"1989","unstructured":"W. Geiselmann and D. Gollmann, Symmetry and Duality in Normal Basis Multiplication,Proc. of AAECC-6, Rome, (T. Mora, ed.), LNCS 357, Springer: Berlin, (1989) pp. 230?238."},{"issue":"No. 6","key":"CR8","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1109\/12.2212","volume":"37","author":"I.S. Hsu","year":"1988","unstructured":"I.S. Hsu, T.K. Truong, L.J. Deutsch, and I.S. Reed, A comparison of VLSI architecture of finite field multipliers using dual, normal, or standard basesIEEE Trans. Comp., Vol. C-37, No. 6, (1988) pp. 735?739.","journal-title":"IEEE Trans. Comp."},{"key":"CR9","first-page":"717","volume":"66","author":"I. Imamura","year":"1983","unstructured":"I. Imamura, On self-complementary bases of GF(q n ) overGF(q), Trans. IECE Japan (Section E), Vol. 66 (1983) pp. 717?721.","journal-title":"Trans. IECE Japan (Section E)"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1137\/0209059","volume":"9","author":"G. Seroussi","year":"1980","unstructured":"G. Seroussi and A. Lempel, Factorization of symmetric matrices and trace-orthogonal bases in finite fields,SIAM J. Comput., Vol. 9, (1980) pp. 758?767.","journal-title":"SIAM J. Comput."},{"key":"CR11","unstructured":"R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications, Cambridge University Press, (1986)."},{"key":"CR12","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North Holland: Amsterdam (1977)."},{"key":"CR13","unstructured":"J.L. Massey and J.K. Omura,Computational method and apparatus for finite field arithmetic U.S. Patent, Number 4 587 627, (1986)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1109\/18.45274","volume":"35","author":"M. Morri","year":"1989","unstructured":"M. Morri, M. Kasahara, and D.L. Whiting, Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields,IEEE Trans. Inf. Th., IT-35, (1989) pp. 1177?1184.","journal-title":"IEEE Trans. Inf. Th."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","volume":"22","author":"R.C. Mullin","year":"1988\/1989","unstructured":"R.C. Mullin, I.M. Onyszchuk, S.A. Vanstone, and R.M. Wilson, Optimal Normal Bases inGF(p n ),Discrete Applied Mathematics, Vol. 22, (1988\/1989) pp. 149?161.","journal-title":"Discrete Applied Mathematics"},{"issue":"No. 10","key":"CR16","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1109\/12.35840","volume":"38","author":"C.C. Wang","year":"1989","unstructured":"C.C. Wang, An algorithm to design finite field multipliers using a self-dual normal basis,IEEE Trans. Comp., Vol. 38, No. 10, (1989) pp. 1457?1460.","journal-title":"IEEE Trans. Comp."},{"issue":"No. 1","key":"CR17","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1137\/0403012","volume":"3","author":"M.Z. Wang","year":"1990","unstructured":"M.Z. Wang and I.F. Blake, Bit-Serial Multiplication,SIAM J. Disc. Math., Vol. 3, No. 1, (1990) pp. 140?148.","journal-title":"SIAM J. Disc. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01418530.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01418530\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01418530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:12:54Z","timestamp":1556802774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01418530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["BF01418530"],"URL":"https:\/\/doi.org\/10.1007\/bf01418530","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}