Introduction to finite fields and their applications

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Introduction to finite fields and their applications

Source

Pages: 407

Year of Publication: 1986

ISBN:0-521-30706-6

Authors

Rudolf Lidl	Univ. of Tasmania, Hobart, Australia
Harald Niederreiter	Austrian Academy of Science, Vienna

Publisher

Cambridge University Press New York, NY, USA

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 142

Additional Information:

cited by index terms review collaborative colleagues

Tools and Actions:	Review this Book Save this Book to a Binder Display Formats: BibTeX EndNote ACM Ref

CITED BY 143

	Pierre L'Ecuyer, Random numbers for simulation, Communications of the ACM, v.33 n.10, p.85-97, Oct. 1990
	Shu Tezuka , Pierre L'Ecuyer , Raymond Couture, On the lattice structure of the add-with-carry and subtract-with-borrow random number generators, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.3 n.4, p.315-331, Oct. 1993
	Shu Tezuka , Pierre L'Ecuyer, Efficient and portable combined Tausworthe random number generators, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.1 n.2, p.99-112, April 1991
	László Babai , Anna Gál , János Kollár , Lajos Rónyai , Tibor Szabó , Avi Wigderson, Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.603-611, May 22-24, 1996, Philadelphia, Pennsylvania, United States
	Claudia Bertram-Kretzberg , Thomas Hofmeister , Hanno Lefmann, Sparse 0-1-matrices and forbidden hypergraphs, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.181-187, January 25-27, 1998, San Francisco, California, United States
	Andrew D. Myers , Stefano Basagni, Wireless media access control, Handbook of wireless networks and mobile computing, John Wiley & Sons, Inc., New York, NY, 2002
	Michael Mascagni , Ashok Srinivasan, Algorithm 806: SPRNG: a scalable library for pseudorandom number generation, ACM Transactions on Mathematical Software (TOMS), v.26 n.3, p.436-461, Sept. 2000
	Tong Zhang , Keshab K. Parhi, Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials, IEEE Transactions on Computers, v.50 n.7, p.734-749, July 2001
	Piere L'Ecuyer , Christiane Lemieux, Quasi-Monte Carlo via linear shift-register sequences, Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future, p.632-639, December 05-08, 1999, Phoenix, Arizona, United States
	F. Montoya Vitini , J. Muñoz Masqué , A. Peinado Domínguez, A factoring algorithm in F2[x], Proceedings of the 1998 ACM symposium on Applied Computing, p.672-676, February 27-March 01, 1998, Atlanta, Georgia, United States
	Lih-Yuan Deng , Cecil Rousseau , Yilian Yuan, Generalized Lehmer-Tausworthe random number generators, Proceedings of the 30th annual Southeast regional conference, April 08-10, 1992, Raleigh, North Carolina
	Jürgen Eichenauer-Herrmann , Harald Niederreiter, Digital inversive pseudorandom numbers, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.4 n.4, p.339-349, Oct. 1994
	Mun-Kyu Lee , Yoonjeong Kim , Kunsoo Park , Yookun Cho, Efficient parallel exponentiation in GF(2n) using normal basis representations, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, p.179-188, July 2001, Crete Island, Greece
	Pierre L'Ecuyer , François Blouin , Raymond Couture, A search for good multiple recursive random number generators, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.3 n.2, p.87-98, April 1993
	T. Beth , W. Geiselmann , F. Meyer, Finding (good) normal bases in finite fields, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.173-178, July 15-17, 1991, Bonn, West Germany
	László Györfi , István Vajda, Analysis of protocol sequences for slow frequency hopping, Wireless Networks, v.4 n.5, p.411-418, Aug. 1998
	Harald Niederreiter, Pseudorandom vector generation by the inversive method, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.4 n.2, p.191-212, April 1994
	Dieter Gollmann, Equally Spaced Polynomials, Dual Bases, and Multiplication in F2^n, IEEE Transactions on Computers, v.51 n.5, p.588-591, May 2002
	A. Reyhani-Masoleh , M. A. Hasan, A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m}), IEEE Transactions on Computers, v.51 n.5, p.511-520, May 2002
	Raghav Bhaskar , Pradeep K. Dubey , Vijay Kumar , Atri Rudra, Efficient galois field arithmetic on SIMD architectures, Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, June 07-09, 2003, San Diego, California, USA
	Hui-Chin Tang, Symmetry properties of multiple recursive random number generators in full period and spectral test, Applied Mathematics and Computation, v.142 n.2-3, p.291-303, 10 October 2003
	Christophe Mouaha , Gerhard Schiffels, All $q^m$ -ary CyclicCodes with Cyclic $q$ -ary Image AreKnown, Designs, Codes and Cryptography, v.23 n.1, p.81-98, May 2001
	M. A. Hasan , M. Z. Wang , V. K. Bhargava, A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields, IEEE Transactions on Computers, v.42 n.10, p.1278-1280, October 1993
	Chang Han Kim , Sangho Oh , Jongin Lim, A New Hardware Architecture for Operations in GF(2m), IEEE Transactions on Computers, v.51 n.1, p.90-92, January 2002
	Christopher Jagger , Andrew Thomason, Wavelength routing in optical networks of diameter two, Journal of Computational and Applied Mathematics, v.142 n.1, p.115-124, 1 May 2002
	W. K. Wootters, Picturing qubits in phase space, IBM Journal of Research and Development, v.48 n.1, p.99-110, January 2004
	V. k. Bhargava , M. a. Hasan, Architecture For A Low Complexity Rate-Adaptive Reed-Solomon Encoder, IEEE Transactions on Computers, v.44 n.7, p.938-942, July 1995
	Ç. K. Koç , B. Sunar, Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields, IEEE Transactions on Computers, v.47 n.3, p.353-356, March 1998
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003
	François Panneton , Pierre L'ecuyer, On the xorshift random number generators, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.15 n.4, p.346-361, October 2005
	Manindra Agrawal , Somenath Biswas, Primality and identity testing via Chinese remaindering, Journal of the ACM (JACM), v.50 n.4, p.429-443, July 2003
	Martin Sauerhoff, Approximation of boolean functions by combinatorial rectangles, Theoretical Computer Science, v.301 n.1-3, p.45-78, 14 May 2003
	Richard P. Brent , Samuli Larvala , Paul Zimmermann, A fast algorithm for testing reducibility of trinomials mod 2 and some new primitive trinomials of degree 3021377, Mathematics of Computation, v.72 n.243, p.1443-1452, July 2003
	Dimitri Kagaris, Multiple-Seed TPG Structures, IEEE Transactions on Computers, v.52 n.12, p.1633-1639, December 2003
	Lih-Yuan Deng , Hongquan Xu, A system of high-dimensional, efficient, long-cycle and portable uniform random number generators, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.13 n.4, p.299-309, October 2003
	Sandeep K. Gupta , Mody Lempel, Zero-Aliasing for Modeled Faults, IEEE Transactions on Computers, v.44 n.11, p.1283-1295, November 1995
	Houda Lahouar, Fonctions de partitions à parité périodique, European Journal of Combinatorics, v.24 n.8, p.1089-1096, November 2003
	B. Sunar , Ç. K. Koç, Mastrovito Multiplier for All Trinomials, IEEE Transactions on Computers, v.48 n.5, p.522-527, May 1999
	Chang Han Kim , Sangho Oh , Jongin Lim, A new hardware architecture for operations In GF (2^m), IEEE Transactions on Computers, v.51 n.1, p.92, January 2002
	M. Panella , G. Martinelli, An RNS Architecture for Quasi-Chaotic Oscillators, Journal of VLSI Signal Processing Systems, v.33 n.1, p.199-22, January-February 2003
	S. R. Blackburn, A Note on Sequences with the Shift and Add Property, Designs, Codes and Cryptography, v.9 n.3, p.251-256, Nov. 1996
	María A. Aviñó , Edward Green , Oscar Moreno, Applications of finite fields to dynamical systems and reverse engineering problems, Proceedings of the 2004 ACM symposium on Applied computing, March 14-17, 2004, Nicosia, Cyprus
	M. Anwarul Hasan , Muzhong Wang , Vijay K. Bhargava, Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2/sup m/), IEEE Transactions on Computers, v.41 n.8, p.962-971, August 1992
	Berk Sunar , Erkay Savas , Çetin K. Koç, Constructing Composite Field Representations for Efficient Conversion, IEEE Transactions on Computers, v.52 n.11, p.1391-1398, November 2003
	Sebastian T. J. Fenn , Mohammed Benaissa , David Taylor, GF(2m) Multiplication and Division Over the Dual Basis, IEEE Transactions on Computers, v.45 n.3, p.319-327, March 1996
	Arash Reyhani-Masoleh , M. Anwar Hasan, Efficient digit-serial normal basis multipliers over binary extension fields, ACM Transactions on Embedded Computing Systems (TECS), v.3 n.3, p.575-592, August 2004
	Arash Reyhani-Masoleh , M. Anwar Hasan, Towards fault-tolerant cryptographic computations over finite fields, ACM Transactions on Embedded Computing Systems (TECS), v.3 n.3, p.593-613, August 2004
	J. Reger , K. Schmidt, Modeling and analyzing finite state automata in the finite field F2, Mathematics and Computers in Simulation, v.66 n.2-3, p.193-206, 29 June 2004
	Pierre L'Ecuyer , Francois Panneton, A new class of linear feedback shift register generators, Proceedings of the 32nd conference on Winter simulation, December 10-13, 2000, Orlando, Florida
	Kevin Cattell , Shujian Zhang , Micaela Serra , Jon C. Muzio, 2-by-n$n$ Hybrid Cellular Automata with Regular Configuration: Theory and Application, IEEE Transactions on Computers, v.48 n.3, p.285-295, March 1999
	Sangho Oh , Chang Han Kim , Jongin Lim , Dong Hyeon Cheon, Efficient Normal Basis Multipliers in Composite Fields, IEEE Transactions on Computers, v.49 n.10, p.1133-1138, October 2000
	Kevin Cattell , Jon C. Muzio, Analysis of One-Dimensional Linear Hybrid Cellular Automata over GF(q), IEEE Transactions on Computers, v.45 n.7, p.782-792, July 1996
	A. Halbutoğullari , Çetin K. Koç, Mastrovito Multiplier for General Irreducible Polynomials, IEEE Transactions on Computers, v.49 n.5, p.503-518, May 2000
	M. a. Hasan , A. g. Wassal, VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2m) Processor, IEEE Transactions on Computers, v.49 n.10, p.1064-1073, October 2000
	Ç. K. Koç , B. Sunar, An Efficient Optimal Normal Basis Type II Multiplier, IEEE Transactions on Computers, v.50 n.1, p.83-87, January 2001
	Arash Reyhani-Masoleh , M. Anwar Hasan, Low Complexity Word-Level Sequential Normal Basis Multipliers, IEEE Transactions on Computers, v.54 n.2, p.98-110, February 2005
	Stefano Basagni, Remarks on ad hoc networking, Advanced lectures on networking, Springer-Verlag New York, Inc., New York, NY, 2002
	Guido Bertoni , Luca Breveglieri , Israel Koren , Paolo Maistri , Vincenzo Piuri, Error Analysis and Detection Procedures for a Hardware Implementation of the Advanced Encryption Standard, IEEE Transactions on Computers, v.52 n.4, p.492-505, April 2003
	Eli Ben-Sasson , Madhu Sudan, Simple PCPs with poly-log rate and query complexity, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, May 22-24, 2005, Baltimore, MD, USA
	Wilfried Meidl , Harald Niederreiter, Linear complexity, k-error linear complexity, and the discrete Fourier transform, Journal of Complexity, v.18 n.1, p.87-103, March 2002
	Xiutao Feng , Quanlong Wang , Zongduo Dai, Multi-sequences with d-perfect property, Journal of Complexity, v.21 n.2, p.230-242, April 2005
	Mun-Kyu Lee , Yoonjeong Kim , Kunsoo Park , Yookun Cho, Efficient parallel exponentiation in GF(qⁿ) using normal basis representations, Journal of Algorithms, v.54 n.2, p.205-221, February 2005
	Ku-Young Chang , Dowon Hong , Hyun-Sook Cho, Low Complexity Bit-Parallel Multiplier for GF(2^m) Defined by All-One Polynomials Using Redundant Representation, IEEE Transactions on Computers, v.54 n.12, p.1628-1630, December 2005
	Chiou-Yng Lee , Che Wun Chiou , Jim-Min Lin, Concurrent Error Detection in a Bit-Parallel Systolic Multiplier for Dual Basis of GF(2m), Journal of Electronic Testing: Theory and Applications, v.21 n.5, p.539-549, October 2005
	Z. Yan , D. V. Sarwate , Z. Liu, High-speed systolic architectures for finite field inversion, Integration, the VLSI Journal, v.38 n.3, p.383-398, January 2005
	Mingyuan Xia , Tianbing Xia , Jennifer Seberry, A New Method for Constructing Williamson Matrices, Designs, Codes and Cryptography, v.35 n.2, p.191-209, May 2005
	William Stallings, The advanced encryption standard, Cryptologia, v.XXVI n.3, p.165-188, July 2002
	Alina Beygelzimer , Mitsunori Ogihara, The enumerability of P collapses P to NC, Theoretical Computer Science, v.345 n.2-3, p.248-259, 22 November 2005
	Sumit Ganguly , Minos Garofalakis , Amit Kumar , Rajeev Rastogi, Join-distinct aggregate estimation over update streams, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 13-15, 2005, Baltimore, Maryland
	Jean Guillaume Dumas , Thierry Gautier , Clément Pernet, Finite field linear algebra subroutines, Proceedings of the 2002 international symposium on Symbolic and algebraic computation, p.63-74, July 07-10, 2002, Lille, France
	Lih-Yuan Deng, Efficient and portable multiple recursive generators of large order, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.15 n.1, p.1-13, January 2005
	Xiaoqun Wang, Strong tractability of multivariate integration using quasi-Monte Carlo algorithms, Mathematics of Computation, v.72 n.242, p.823-838, 1 April 2003
	P. Caballero-Gil , A. Fúster-Sabater, A wide family of nonlinear filter functions with a large linear span, Information Sciences—Informatics and Computer Science: An International Journal, v.164 n.1-4, p.197-207, 2 August 2004
	Johann Großschädl , Paolo Ienne , Laura Pozzi , Stefan Tillich , Ajay K. Verma, Combining algorithm exploration with instruction set design: a case study in elliptic curve cryptography, Proceedings of the conference on Design, automation and test in Europe: Proceedings, March 06-10, 2006, Munich, Germany
	Khoongming Khoo , Guang Gong , Douglas R. Stinson, A New Characterization of Semi-bent and Bent Functions on Finite Fields*, Designs, Codes and Cryptography, v.38 n.2, p.279-295, February 2006
	R. Safavi-Naini , C. Charnes, MRD Hashing, Designs, Codes and Cryptography, v.37 n.2, p.229-242, November 2005
	Marek Jackiewicz , Eugeniusz Kuriata, Analysis of non-linear pseudo-noise sequences, Enhanced methods in computer security, biometric and artificial intelligence systems, Springer-Verlag, London, 2005
	Tomasz Hebisz , Eugeniusz Kuriata, The capacity of ciphers fulfilling the accessibility of cryptograms, Enhanced methods in computer security, biometric and artificial intelligence systems, Springer-Verlag, London, 2005
	Chiou-Yng Lee , Che Wun Chiou , Jim-Min Lin, Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m), Journal of Electronic Testing: Theory and Applications, v.22 n.2, p.143-150, April 2006
	M. Anwarul Hasan , Vijay K. Bhargava, Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2/sup m/), IEEE Transactions on Computers, v.41 n.8, p.972-980, August 1992
	Alice E. D. Houston, On the limit of maximal density of sequences with a PerfectLinear Complexity Profile, Designs, Codes and Cryptography, v.10 n.3, p.351-359, March 1997
	A. V. Kelarev, A polynomial algorithm for codes based on directed graphs, Proceedings of the 12th Computing: The Australasian Theroy Symposium, p.87-92, January 16-19, 2006, Hobart, Australia
	Haibin Shen , Yier Jin, Low complexity bit parallel multiplier for GF (2m) generated by equally-spaced trinomials, Information Processing Letters, v.107 n.6, p.211-215, August, 2008
	H. Rahaman , J. Mathew , D. K. Pradhan , A. M. Jabir, C-testable bit parallel multipliers over GF(2^m), ACM Transactions on Design Automation of Electronic Systems (TODAES), v.13 n.1, p.1-18, January 2008
	Kenneth G. Paterson, Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering, Designs, Codes and Cryptography, v.14 n.3, p.247-259, Sept. 1998
	Sebastian Fenn , Michael Gossel , Mohammed Benaissa , David Taylor, On-Line Error Detection for Bit-Serial Multipliers in GF(2m), Journal of Electronic Testing: Theory and Applications, v.13 n.1, p.29-40, Aug. 1, 1998
	Michael Dewar , Lucia Moura , Daniel Panario , Brett Stevens , Qiang Wang, Division of trinomials by pentanomials and orthogonal arrays, Designs, Codes and Cryptography, v.45 n.1, p.1-17, October 2007
	Byeong-Kweon Oh , Jangheon Oh , Hoseog Yu, New infinite families of 3-designs from algebraic curves over Fq, European Journal of Combinatorics, v.28 n.4, p.1262-1269, May, 2007
	Frédérique Oggier , Emanuele Viterbo, Algebraic number theory and code design for Rayleigh fading channels, Communications and Information Theory, v.1 n.3, p.333-416, December 2004
	John A. Ryan , Patrick Fitzpatrick, Enumeration of inequivalent irreducible Goppa codes, Discrete Applied Mathematics, v.154 n.2, p.399-412, 1 February 2006
	Subhamoy Maitra , Kishan Chand Gupta , Ayineedi Venkateswarlu, Results on multiples of primitive polynomials and their products over GF(2), Theoretical Computer Science, v.341 n.1, p.311-343, 5 September 2005
	Phillip Wong , Mengjie Zhang, Algebraic simplification of GP programs during evolution, Proceedings of the 8th annual conference on Genetic and evolutionary computation, July 08-12, 2006, Seattle, Washington, USA
	Venkatesan Guruswami , Atri Rudra, Explicit capacity-achieving list-decodable codes, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
	Jenn-Shyong Horng , I-Chang Jou , Chiou-Yng Lee, On complexity of normal basis multiplier using modified Booth's algorithm, Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Informatics and Communications, p.12-17, August 24-26, 2007, Vouliagmeni, Athens, Greece
	Michael Aschbacher , Andrew M. Childs , Paweł Wocjan, The limitations of nice mutually unbiased bases, Journal of Algebraic Combinatorics: An International Journal, v.25 n.2, p.111-123, March 2007
	Nathan Jachimie , Fernando Martinez-Vallin , Jafar Saniie, CReconfigurable finite field instruction set architecture, Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays, February 18-20, 2007, Monterey, California, USA
	Ming-Haw Jing , Zih-Heng Chen , Jian-Hong Chen , Yan-Haw Chen, Reconfigurable system for high-speed and diversified AES using FPGA, Microprocessors & Microsystems, v.31 n.2, p.94-102, March, 2007
	Venkatesan Guruswami, Algorithmic results in list decoding, Foundations and Trends® in Theoretical Computer Science, v.2 n.2, p.107-195, January 2007
	Wen-Ai Jackson , S. Murphy, Projective aspects of the AES inversion, Designs, Codes and Cryptography, v.43 n.2-3, p.167-179, June 2007
	Neeraj Kayal , Nitin Saxena, Complexity of Ring Morphism Problems, Computational Complexity, v.15 n.4, p.342-390, December 2006
	R. D. Baker , J. M. Dover , G. L. Ebert , K. L. Wantz, Perfect Baer Subplane Partitions and Three-DimensionalFlag-Transitive Planes, Designs, Codes and Cryptography, v.21 n.1-3, p.19-39, October 2000
	Ueli M. Maurer , Stefan Wolf, The Diffie–Hellman Protocol, Designs, Codes and Cryptography, v.19 n.2-3, p.147-171, March 2000
	Xukai Zou , Yogesh Karandikar , Elisa Bertino, A dynamic key management solution to access hierarchy, International Journal of Network Management, v.17 n.6, p.437-450, November 2007
	Cetin K. Koc , Tolga Acar, Montgomery Multiplication in GF(2 $^k$ , Designs, Codes and Cryptography, v.14 n.1, p.57-69, April 1998
	Ka Hin Leung , Bernhard Schmidt, The Field Descent Method, Designs, Codes and Cryptography, v.36 n.2, p.171-188, August 2005
	Sanming Zhou, A distance-labelling problem for hypercubes, Discrete Applied Mathematics, v.156 n.15, p.2846-2854, August, 2008
	Jose Luis Imana , Juan Manuel Sanchez , Francisco Tirado, Bit-Parallel Finite Field Multipliers for Irreducible Trinomials, IEEE Transactions on Computers, v.55 n.5, p.520-533, May 2006
	A. Fúster-Sabater , P. Caballero-Gil, Linear cellular automata as discrete models for generating cryptographic sequences, Proceedings of the sixth Australasian conference on Information security, January 01-01, 2008, Wollongong, NSW, Australia
	Chiou-Yng Lee, Multiplexer-based bit-parallel systolic multipliers over GF(2m), Computers and Electrical Engineering, v.34 n.5, p.392-405, September, 2008
	Jose-vicente Aguirre , Rafael Álvarez , Leandro Tortosa , Antonio Zamora, An optimized pseudorandom generator using packed matrices, WSEAS Transactions on Information Science and Applications, v.5 n.4, p.487-496, April 2008
	Chiou-Yng Lee, Low-complexity bit-parallel systolic multipliers over GF(2m), Integration, the VLSI Journal, v.41 n.1, p.106-112, January, 2008
	Xukai Zou , Yogesh Karandikar, A novel Conference Key Management solution for Secure Dynamic Conferencing, International Journal of Security and Networks, v.3 n.1, p.47-53, December 2008
	Frederik Armknecht , Dirk Westhoff , Joao Girao , Alban Hessler, A lifetime-optimized end-to-end encryption scheme for sensor networks allowing in-network processing, Computer Communications, v.31 n.4, p.734-749, March, 2008
	A. Fúster-Sabater , P. Caballero-Gil, Strategic attack on the shrinking generator, Theoretical Computer Science, v.409 n.3, p.530-536, December, 2008
	Palash Sarkar, A general mixing strategy for the ECB-Mix-ECB mode of operation, Information Processing Letters, v.109 n.2, p.121-123, December, 2008
	Ashkan Hosseinzadeh Namin , Huapeng Wu , Majid Ahmadi, Comb Architectures for Finite Field Multiplication in F(2^m), IEEE Transactions on Computers, v.56 n.7, p.909-916, July 2007
	Mengjie Zhang , Phillip Wong, Genetic programming for medical classification: a program simplification approach, Genetic Programming and Evolvable Machines, v.9 n.3, p.229-255, September 2008
	Jong Yoon Hyun , Hyun Kwang Kim, Maximum distance separable poset codes, Designs, Codes and Cryptography, v.48 n.3, p.247-261, September 2008
	Rafael Alvarez , Francisco-Miguel Martinez , Jose-Francisco Vicent , Antonio Zamora, A matricial public key cryptosystem with digital signature, WSEAS Transactions on Mathematics, v.7 n.4, p.195-204, April 2008
	Chiou-Yng Lee , Che Wun Chiou, New Bit-Parallel Systolic Architectures for Computing Multiplication, Multiplicative Inversion and Division in GF(2m) Under Polynomial Basis and Normal Basis Representations, Journal of Signal Processing Systems, v.52 n.3, p.313-324, September 2008
	Felipe Ghellar , Marcelo S. Lubaszewski, A novel AES cryptographic core highly resistant to differential power analysis attacks, Proceedings of the 21st annual symposium on Integrated circuits and system design, September 01-04, 2008, Gramado, Brazil
	Ali A. Kanso, An efficient cryptosystem Delta for stream cipher applications, Computers and Electrical Engineering, v.35 n.1, p.126-140, January, 2009
	Lih-Yuan Deng , Huajiang Li , Jyh-Jen Horng Shiau, Scalable parallel multiple recursive generators of large order, Parallel Computing, v.35 n.1, p.29-37, January, 2009
	Ali A. Kanso, Modified clock-controlled alternating step generators, Computer Communications, v.32 n.5, p.787-799, March, 2009
	P. K. Meher , Yajun Ha , Chiou-Yng Lee, An optimized design for serial-parallel finite field multiplication over GF(2^m) based on all-one polynomials, Proceedings of the 2009 Conference on Asia and South Pacific Design Automation, January 19-22, 2009, Yokohama, Japan
	George N. Selimis , Apostolos P. Fournaris , Harris E. Michail , Odysseas Koufopavlou, Improved throughput bit-serial multiplier for GF(2m) fields, Integration, the VLSI Journal, v.42 n.2, p.217-226, February, 2009
	Chin-Chin Chen , Chiou-Yng Lee , Erl-Huei Lu, Scalable and Systolic Montgomery Multipliers over GF(2m), IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E91-A n.7, p.1763-1771, July 2008
	Chin-Chin Chen , Chiou-Yng Lee , Erl-Huei Lu, Combined circuit architecture for computing normal basis and montgomery multiplications over GF(2^m), Proceedings of the International Conference on Mobile Technology, Applications, and Systems, September 10-12, 2008, Yilan, Taiwan
	Chiou-Yng Lee , Jenn-Shyong Horng , I-Chang Jou, Low-complexity bit-parallel multiplier over GF(2m) using dual basis representation, Journal of Computer Science and Technology, v.21 n.6, p.887-892, November 2006
	Venkatesan Guruswami, Artin automorphisms, cyclotomic function fields, and folded list-decodable codes, Proceedings of the 41st annual ACM symposium on Theory of computing, May 31-June 02, 2009, Bethesda, MD, USA
	Reza Rezaeian Farashahi , Ruud Pellikaan , Andrey Sidorenko, Extractors for binary elliptic curves, Designs, Codes and Cryptography, v.49 n.1-3, p.171-186, December 2008
	Maria Christopoulou , Theo Garefalakis , Daniel Panario , David Thomson, The trace of an optimal normal element and low complexity normal bases, Designs, Codes and Cryptography, v.49 n.1-3, p.199-215, December 2008
	Neeraj Kayal , Nitin Saxena, Polynomial Identity Testing for Depth 3 Circuits, Computational Complexity, v.16 n.2, p.115-138, May 2007
	Sergei Evdokimov , Ilia Ponomarenko, Permutation group approach to association schemes, European Journal of Combinatorics, v.30 n.6, p.1456-1476, August, 2009
	A. V. Kelarev, Algorithms for computing parameters of graph-based extensions of BCH codes, Journal of Discrete Algorithms, v.5 n.3, p.553-563, September, 2007
	Venkatesan Guruswami , Christopher Umans , Salil Vadhan, Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes, Journal of the ACM (JACM), v.56 n.4, p.1-34, June 2009
	Arash Reyhani-Masoleh, Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases, IEEE Transactions on Computers, v.55 n.1, p.34-47, January 2006
	Xiuni Wang , Xiao Ma, A class of generalized LDPC codes with fast parallel decoding algorithms, IEEE Communications Letters, v.13 n.7, p.531-533, July 2009
	Yassir Nawaz , Kishan Chand Gupta , Guang Gong, Algebraic immunity of S-boxes based on power mappings: analysis and construction, IEEE Transactions on Information Theory, v.55 n.9, p.4263-4273, September 2009
	Ana Salagean, An algorithm for computing minimal bidirectional linear recurrence relations, IEEE Transactions on Information Theory, v.55 n.10, p.4695-4700, October 2009
	Palash Sarkar, Efficient tweakable enciphering schemes from (block-wise) universal hash functions, IEEE Transactions on Information Theory, v.55 n.10, p.4749-4760, October 2009
	Chiou-Yng Lee , Che Wun Chiou , Jim-Min Lin, Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm, Computers and Electrical Engineering, v.31 n.7, p.444-459, October, 2005
	Ashkan Hosseinzadeh Namin , Huapeng Wu , Majid Ahmadi, A high-speed word level finite field multiplier in F2^m using redundant representation, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, v.17 n.10, p.1546-1550, October 2009

INDEX TERMS

Classification:
F. Theory of Computation
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY

G. Mathematics of Computing
G.1 NUMERICAL ANALYSIS
G.2 DISCRETE MATHEMATICS

General Terms:
Algorithms, Theory

REVIEW

"George James Davis : Reviewer"

This is a textbook edition of the monograph Finite Fields [1]. The emphasis is on applications, and thus many of the more theoretical topics found in that earlier volume are not included here. The stated prerequisites include a first more...

Collaborative Colleagues:

Rudolf Lidl: colleagues

Harald Niederreiter: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player