See this document in CiteSeerX!

Unknown  (Make Corrections)  
This Thesis Describes Preface This thesis describes the research which I conducted during my three...



  Home/Search   Context   Related

 
View or download:
wpi.edu/Research/c...aar_phd_diss.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wpi.edu/Research/crypt/theses/... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This thesis describes various efficient architectures for computation in Galois fields of the type GF(2^k). (Update)

Active bibliography (related documents):   More   All
2.8:   Efficient Multiplier Architectures for Galois Fields GF(2 4n .. - Paar, Fleischmann, Roelse (1998)   (Correct)
1.9:   A Comparative VLSI Synthesis of Finite Field Multipliers - Paar, Lange (1995)   (Correct)
1.6:   Implementation of a Reprogrammable Reed-Solomon Decoder over.. - Paar, Hooijen (1994)   (Correct)

Similar documents based on text:   More   All
0.3:   Generalizations of the Karatsuba Algorithm for Polynomial.. - Weimerskirch, Paar   (Correct)
0.0:   Exploring Henk - Roorda   (Correct)
0.0:   A Minimally Informative Likelihood for Decision Analysis.. - Yuan, Clarke (1999)   (Correct)

BibTeX entry:   (Update)

@misc{ describes-unknown,
  author = "Christof Paar",
  title = "Efficient VLSI Architectures for Bit Parallel Computation in Galois Fields",
  url = "citeseer.ist.psu.edu/442989.html" }
Citations (may not include all citations):
704   Applied Cryptography (context) - Schneier - 1993
601   A public-key cryptosystem and a signature scheme based on di.. (context) - ElGamal - 1985
428   IEEE Transactions on Information Theory (context) - Diffie, Hellman et al. - 1976
317   Error Control Coding: Fundamentals and Applications (context) - Lin, Costello - 1983
228   Simulated Annealing and Boltzmann Machines (context) - Aarst, Korst - 1989
223   Theory and Practice of Error Control Codes (context) - Blahut - 1983
216   Volume 2: Seminumerical Algorithms (context) - Knuth, of - 1981
200   Principles of CMOS VLSI Design (context) - Weste, Eshraghian - 1992
182   Algebraic Coding Theory (context) - Berlekamp - 1968  ACM
170   Shift Register Sequences (context) - Golomb - 1967  ACM
167   Error-Correcting Codes (context) - Peterson, Weldon - 1972
164   Introduction to Applied Mathematics (context) - Strang - 1986
98   A System for Doing Mathematics by Computer (context) - Wolfram - 1988
68   Prime Numbers and Computer Methods for Factorization (context) - Riesel - 1985  ACM
59   Fast Algorithms for Digital Signal Processing (context) - Blahut - 1985
47   Discrete logarithms in finite fields and their cryptographic.. - Odlyzko - 1984  ACM   DBLP
41   Multiplication of multidigit numbers on automata (context) - Karatsuba, Ofman - 1963
39   A fast algorithm for computing multiplicative inverses in GF (context) - Itoh, Tsujii - 1988
39   Finite Fields for Computer Scientists and Engineers (context) - McEliece - 1987
37   Coding Techniques for Digital Recorders (context) - Schouhamer-Immink - 1991  ACM
25   volume 20 of Encyclopedia of Mathematics and its Application.. (context) - Lidl, Niederreiter - 1983
20   VLSI architectures for computing multiplications and inverse.. (context) - Wang, Truong et al. - 1985
17   Number Theory in Digital Signal Processing (context) - McClellan - 1979  ACM
15   VLSI Architectures for Computation in Galois Fields (context) - Mastrovito - 1991
14   Error-Control Techniques for Digital Communication (context) - Michelson, Levesque - 1985
12   Bit-serial Reed-Solomon encoders (context) - Berlekamp - 1982
12   Modular construction of low complexity parallel multipliers .. (context) - Hasan, Wang et al. - 1992
10   VLSI design for multiplication over finite fields GF (context) - Mastrovito - 1989
10   Discrete Applied Mathematics (context) - Mullin, Onyszchuk et al. - 1988
10   Finite Fields (context) - Jungnickel - 1993  ACM
10   Kluwer Academic Publisher (context) - Gao, Vanstone et al. - 1993
9   the complexity of finite field arithmetic (context) - Afanasyev - 1991
8   A comparison of VLSI architecture of finite field multiplier.. (context) - Hsu, Truong et al. - 1988
7   Structure of parallel multipliers for a class of fields GF (context) - Itoh, Tsujii - 1989
7   A new algorithm for multiplication in finite fields (context) - Pincin - 1989  ACM   DBLP
6   Algebraische Algorithmenentwicklung am Beispiel der Arithmet.. (context) - Geiselmann - 1993
5   Choosing VLSI algorithms for finite field arithmetic (context) - Jeong, Burleson - 1992
5   Tables of finite fields (context) - Alanen, Knuth - 1964
4   VLSI Array Processing (context) - Kung - 1988
4   Reed-Solomon decoder (context) - Politano, Deprey et al. - 1990
4   Efficient construction of gate circuit for computing multipl.. (context) - Morii, Kasahara - 1989
4   Complexity of VLSI implementation of finite field arithmetic (context) - Afanasyev - 1990
4   Irreducible polynomials over composite Galois fields and the.. (context) - Green, Taylor - 1974
3   An Introduction to Cryptology (context) - van Tilborg - 1988  ACM   DBLP
3   Recommendation for space data system standards: Telemetry ch.. (context) - Kummer - 1983
3   A parallel Galois field multiplier with low complexity based.. (context) - Paar - 1993
3   A VLSI architecture for fast inversion in GF (context) - Feng - 1989
3   Division and bit-serial multiplication over GF (context) - Hasan, Wang et al. - 1992
3   Coding for satellite communication (context) - Wu, Haccoun et al. - 1987
3   Changing the coding system on a spacecraft in flight (context) - Cheung, Divsalar et al. - 1993
3   SIGMA: A VLSI systolic array implementation of a Galois fiel.. (context) - Kovac, Ranganathan et al. - 1993
2   Computation with finite fields (context) - Bartee, Schneider - 1963  DBLP
2   Design of a Reed-Solomon decoder using a DSP (context) - Todoroki, Miura - 1990
2   Apparatus for finite field computation (context) - Massey, Omura - 1984
2   powers and asymptotic analysis: Some comments (context) - Fateman - 1974
2   VLSI design for exponentiation in GF (context) - Geiselmann, Gollmann - 1990
2   Low complexity parallel multipliers for Galois fields GF (context) - Paar - 1994
2   Communication aspects of the compact disc digital audio syst.. (context) - Peek - 1985
2   Implementation of a reprogrammable Reed-Solomon decoder over.. - Paar, Hooijen - 1994
2   A VLSI design for computing exponentiation in GF (context) - Wang, Pei - 1990
2   On fast decoding of Reed-Solomon codes over GF (context) - Dodunekov, Zinoviev - 1985
1   with independent roots and their application for power resid.. (context) - Gulliver, Serra et al. - 1991
1   Primitive normal bases with low complexity for the field GF (context) - Geiselmann - 1993
1   Recent results on the use of concatenated Reed-Solomon / Vit.. (context) - Liu, Lee - 1984
1   A VLSI architecture for performing finite field arithmetic w.. (context) - Hsu, Truong et al. - 1988
1   Reed Solomon EncoderDecoder Chip Set (context) - Reed, Decoder et al. - 1991
1   Inverse of elements of a Galois field (context) - Davida - 1972
1   Voyager mission telecommunication first (context) - Posner, Rauch et al. - 1990
1   Fast finite field arithmetic for VLSI design (context) - Paar - 1993
1   Self-dual bases in F q n (context) - Geiselmann, Gollmann - 1993
1   the existence of a primitive quadratic of trace 1 over GF (context) - Moreno - 1989
1   Algebraic construction for costas arrays (context) - Golomb - 1984

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC