Journal ArticleDOI
Introduction to finite fields and their applications (revised edition), by Rudolf Lidl and Harald Niederreiter. Pp. 416. £29.95. 1994. ISBN 0-521-46094-8 (Cambridge University Press)
About:
This article is published in The Mathematical Gazette.The article was published on 1995-07-01. It has received 74 citations till now.read more
Citations
More filters
Journal Article
PRESENT: An Ultra-Lightweight Block Cipher
Andrey Bogdanov,Lars R. Knudsen,Gregor Leander,Christof Paar,Axel Poschmann,Matthew Robshaw,Yannick Seurin,C. Vikkelsoe +7 more
TL;DR: In this paper, the authors describe an ultra-lightweight block cipher, present, which is suitable for extremely constrained environments such as RFID tags and sensor networks, but it is not suitable for very large networks such as sensor networks.
Book ChapterDOI
The software performance of authenticated-encryption modes
Ted Krovetz,Phillip Rogaway +1 more
TL;DR: OCB is found to be substantially faster than either GCM or GCM across a variety of platforms, and there is room for algorithmic improvements to OCB, showing how to trim one blockcipher call and reduce latency.
Journal Article
OMAC: One-key CBC MAC
Tetsu Iwata,Kaoru Kurosawa +1 more
TL;DR: The saving of the key length makes the security proof of OMAC substantially harder than those of XCBC and TMAC.
Journal ArticleDOI
Codes on finite geometries
TL;DR: New algebraic methods for constructing codes based on hyperplanes of two different dimensions in finite geometries are presented and most of the codes constructed can be either put in cyclic or quasi-cyclic form and hence their encoding can be implemented with linear shift registers.
Journal ArticleDOI
Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme
TL;DR: A simple and very flexible method for constructing quasi-cyclic (QC) low density paritycheck (LDPC) codes based on finite fields and a reduced-complexity iterative decoding scheme based on the section-wise cyclic structure of their parity-check matrices is presented.
References
More filters
Book ChapterDOI
PRESENT: An Ultra-Lightweight Block Cipher
Andrey Bogdanov,Lars R. Knudsen,Gregor Leander,Christof Paar,Axel Poschmann,Matthew Robshaw,Yannick Seurin,C. Vikkelsoe +7 more
TL;DR: An ultra-lightweight block cipher, present, which is competitive with today's leading compact stream ciphers and suitable for extremely constrained environments such as RFID tags and sensor networks.
Book ChapterDOI
The software performance of authenticated-encryption modes
Ted Krovetz,Phillip Rogaway +1 more
TL;DR: OCB is found to be substantially faster than either GCM or GCM across a variety of platforms, and there is room for algorithmic improvements to OCB, showing how to trim one blockcipher call and reduce latency.
Journal ArticleDOI
Codes on finite geometries
TL;DR: New algebraic methods for constructing codes based on hyperplanes of two different dimensions in finite geometries are presented and most of the codes constructed can be either put in cyclic or quasi-cyclic form and hence their encoding can be implemented with linear shift registers.
Journal ArticleDOI
Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme
TL;DR: A simple and very flexible method for constructing quasi-cyclic (QC) low density paritycheck (LDPC) codes based on finite fields and a reduced-complexity iterative decoding scheme based on the section-wise cyclic structure of their parity-check matrices is presented.
Journal ArticleDOI
Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares
TL;DR: An approach for constructing quasi-cyclic LDPC codes based on Latin squares over finite fields based on parity-check matrices is presented, and combinatorial expressions for their ranks and dimensions are derived.