![](https://media.springernature.com/w215h120/springer-static/image/art%3Aplaceholder%2Fimages/placeholder-figure-springernature.png)
Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5130)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: WAIFI 2008.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
Similar content being viewed by others
Keywords
- Algebra
- LA
- algebraic computation
- algebraic number theory
- algorithmic number theory
- binary polynomials
- classification
- complexity
- computational algebra
- computational number theory
- computer algebra
- cryptographic codes
- cryptography
- curve-based cryptography
- cyclic codes
- algorithm analysis and problem complexity
Table of contents (16 papers)
-
Efficient Implementation and Architectures
-
Classification and Construction of Mappings over Finite Fields
Other volumes
-
Arithmetic of Finite Fields
Bibliographic Information
Book Title: Arithmetic of Finite Fields
Book Subtitle: Second International Workshop, WAIFI 2008, Siena, Italy, July 6-9, 2008, Proceedings
Editors: Joachim Gathen, José Luis Imaña, Çetin Kaya Koç
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-540-69499-1
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2008
Softcover ISBN: 978-3-540-69498-4Published: 25 June 2008
eBook ISBN: 978-3-540-69499-1Published: 08 July 2008
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 205
Topics: Coding and Information Theory, Cryptology, Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity, Symbolic and Algebraic Manipulation, Algorithms