Image from Google Jackets

Arithmetic of Finite Fields [electronic resource] : 5th International Workshop, WAIFI 2014, Gebze, Turkey, September 27-28, 2014. Revised Selected Papers / edited by Çetin Kaya Koç, Sihem Mesnager, Erkay Savaş.

Contributor(s): Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science ; 9061Publication details: Cham : Springer International Publishing, 2015.Description: 1 online resource (X, 213 p. 18 ill.)ISBN:
  • 9783319162775
Subject(s): Online resources:
Contents:
First Invited talk -- Computing Discrete Logarithms in F36•137 and F36•163 using Magma -- Finite Field Arithmetic -- Accelerating Iterative SpMV for the Discrete Logarithm Problem using GPUs -- Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms -- Reducing the Complexity of Normal Basis Multiplication -- O -- Second Invited talk -- Open Questions on Nonlinearity and on APN functions -- Boolean and Vectorial Functions -- Some Results on Difference Balanced Functions -- Affine Equivalency and Nonlinearity Preserving Bijective Mappings over F2 -- On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions -- On o-Equivalence of Niho Bent Functions -- Third Invited Talk -- L-polynomials of the curve yqn− y = xqh+1− _ over Fqm -- Coding Theory and Code-based Cryptography -- Efficient Software Implementations of Code-based Hash Functions -- Quadratic residue codes over Fp + vFp + v2F.p.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Materials specified Status Date due Barcode Item holds
Books Books National Library of India Available EBK000025791ENG
Total holds: 0

First Invited talk -- Computing Discrete Logarithms in F36•137 and F36•163 using Magma -- Finite Field Arithmetic -- Accelerating Iterative SpMV for the Discrete Logarithm Problem using GPUs -- Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms -- Reducing the Complexity of Normal Basis Multiplication -- O -- Second Invited talk -- Open Questions on Nonlinearity and on APN functions -- Boolean and Vectorial Functions -- Some Results on Difference Balanced Functions -- Affine Equivalency and Nonlinearity Preserving Bijective Mappings over F2 -- On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions -- On o-Equivalence of Niho Bent Functions -- Third Invited Talk -- L-polynomials of the curve yqn− y = xqh+1− _ over Fqm -- Coding Theory and Code-based Cryptography -- Efficient Software Implementations of Code-based Hash Functions -- Quadratic residue codes over Fp + vFp + v2F.p.

There are no comments on this title.

to post a comment.
                                                                           
web counter

Copyright ©2020 The National Library of India, Govt. of India ↔ Hosted by NVLI, MOC ↔ Technology and Design by National Library of India, Ministry of Culture, Govt. of India