TEST - Catálogo BURRF
   

Arithmetic of finite fields : 5th international workshop, waifi 2014, gebze, turkey, september 27-28, 2014. Revised selected papers / edited by Çetin Kaya Koç, Sihem Mesnager, Erkay Sava?.

Colaborador(es): Tipo de material: TextoTextoSeries Lecture Notes in Computer Science ; 9061Editor: Cham : Springer International Publishing : Springer, 2015Descripción: x, 213 páginas : 18 ilustracionesTipo de contenido:
  • texto
Tipo de medio:
  • computadora
Tipo de portador:
  • recurso en línea
ISBN:
  • 9783319162775
Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:
  • QA76.9.M35
Recursos en línea:
Contenidos:
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.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Springer eBooks

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.

Para consulta fuera de la UANL se requiere clave de acceso remoto.

Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha