{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":26,"n_cols":5,"rows_kept":26,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[19,2,19,3],[20,2,20,3],[24,2,24,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466075903316"]
[null,null,"Titolo",null,"Arithmetic of Finite Fields [[electronic resource] ] : First International Workshop, WAIFI 2007, Madrid, Spain, June 21-22, 2007, Proceedings / / edited by Claude Carlet, Berk Sunar"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007"]
[null,null,"ISBN",null,"3-540-73074-5"]
[null,null,"Edizione",null,"[1st ed. 2007.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XI, 360 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 4547"]
[null,null,"Disciplina",null,"512.3"]
[null,null,"Soggetti",null,"Coding theory"]
[{"$nulls":4},"Information theory"]
[{"$nulls":4},"Cryptography"]
[{"$nulls":4},"Data encryption (Computer science)"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Coding and Information Theory"]
[{"$nulls":4},"Cryptology"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Symbolic and Algebraic Manipulation"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Structures in Finite Fields -- Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields -- Some Notes on d-Form Functions with Difference-Balanced Property -- A Note on Modular Forms on Finite Upper Half Planes -- Efficient Implementation and Architectures -- A Coprocessor for the Final Exponentiation of the ? T Pairing in Characteristic Three -- VLSI Implementation of a Functional Unit to Accelerate ECC and AES on 32-Bit Processors -- Efficient Multiplication Using Type 2 Optimal Normal Bases -- Efficient Finite Field Arithmetic -- Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic -- Software Implementation of Arithmetic in  -- Complexity Reduction of Constant Matrix Computations over the Binary Field -- Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in "]
[{"$nulls":4},"Characteristic 2 and 0 -- Classification and Construction of Mappings over Finite Fields -- A Construction of Differentially 4-Uniform Functions from Commutative Semifields of Characteristic 2 -- Complete Mapping Polynomials over Finite Field F 16 -- On the Classification of 4 Bit S-Boxes -- The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions -- Curve Algebra -- New Point Addition Formulae for ECC Applications -- Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation -- The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic -- Cryptography -- On Kabatianskii-Krouk-Smeets Signatures -- Self-certified Signatures Based on Discrete Logarithms -- Attacking the Filter Generator over GF(2 m ) -- Codes -- Cyclic Additive and Quantum Stabilizer Codes -- Determining the Number of One-Weight Cyclic Codes When Length and Dimension Are Given -- Error Correcting Codes from Quasi-Hadamard Matrices -- Fast Computations of Gröbner Bases and Blind Recognitions of Convolutional Codes -- Discrete Structures -- A Twin for Euler’s ? Function in  -- Discrete Phase-Space Structures and Mutually Unbiased Bases -- Some Novel Results of p-Adic Component of Primitive Sequences over Z/(p d )."]