DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Polynomial basis
Polynomial basis
A Casual Primer on Finite Fields
Type-II Optimal Polynomial Bases
Time Complexity Analysis of Cloud Data Security: Elliptical Curve and Polynomial Cryptography
Intra-Basis Multiplication of Polynomials Given in Various Polynomial Bases
Hardware and Software Normal Basis Arithmetic for Pairing Based
Lecture 8: Stream Ciphers - LFSR Sequences
Polynomial Evaluation and Interpolation on Special Sets of Points
Study of Extended Euclidean and Itoh-Tsujii Algorithms in GF(2 M)
Arxiv:1604.06753V2 [Cs.CR] 25 Jan 2017 Necetsfwr Nrpini Eurdadbtoine Cipher E Bit-Oriented Like Link and Applications Required Speed Efficiency
LECTURE NOTES in CRYPTOGRAPHY Thomas Johansson 2005/2006
Finite Field Polynomial Multiplier with Linear Feedback Shift Register
Dickson Bases and Finite Fields
Dual Bases and Bit-Serial Multiplication in Fqn Dieter Gollmann ∗ Microsoft Research Ltd., 1 Guildhall Street, Cambridge CB2 3NH, UK
Polynomial and Normal Bases for Finite Fields
Implementation and Security Analysis of Construction Algorithm for Primitive Σ-LFSR
Bit Serial Systolic Architectures for Multiplicative Inversion and Division Over GF (2M)
Combinatorial Bases of Polynomials
8.4 Exceptional Polynomials
Top View
Public Key Cryptography
Reducing the Complexity of Normal Basis Multiplication
Topics in Normal Bases of Finite Fields N. A. Carella
Power Series Composition and Change of Basis
Novel Implementation of Finite Field Multipliers Over GF (2M) for Emerging Cryptographic Applications
Chapter 2 MATHEMATICAL BACKGROUND 1. Groups, Rings
Normal Bases Over Finite Fields
Evaluating Performance and Efficiency of a 16-Bit Substitution Box on an FPGA
FFT Algorithm for Binary Extension Finite Fields and Its Application to Reed-Solomon Codes Sian-Jheng Lin, Member, IEEE, Tareq Y
Implementation of Finite Field Arithmetic Operations for Polynomial and Normal Basis Representations
Arxiv:1603.05773V2
Polynomials and Cryptography
LFSR-Based Stream Ciphers
Finite Fields
Novel Polynomial Basis and Its Application to Reed-Solomon Erasure Codes
Arithmetic Operators on GF(2M) for Cryptographic Applications: Performance - Power Consumption - Security Tradeoffs Danuta Pamula
Finite Fields