{"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":33,"n_cols":5,"rows_kept":33,"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],[10,2,10,3],[11,2,11,3],[25,2,25,3],[26,2,26,3],[30,2,30,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910483363903321"]
[null,null,"Titolo",null,"Cryptography and Coding : 12th IMA International Conference, IMACC 2009, Cirencester, UK, December 15-17, 2009, Proceedings / / edited by Matthew G. Parker"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009"]
[null,null,"ISBN",null,"3-642-10868-7"]
[null,null,"Edizione",null,"[1st ed. 2009.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XI, 495 p.)"]
[null,null,"Collana",null,"Security and Cryptology, , 2946-1863 ; ; 5921"]
[null,null,"Classificazione",null,"DAT 465f"]
[{"$nulls":4},"DAT 580f"]
[{"$nulls":4},"SS 4800"]
[null,null,"Disciplina",null,"512"]
[null,null,"Soggetti",null,"Cryptography"]
[{"$nulls":4},"Data encryption (Computer science)"]
[{"$nulls":4},"Coding theory"]
[{"$nulls":4},"Information theory"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Data protection"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Cryptology"]
[{"$nulls":4},"Coding and Information Theory"]
[{"$nulls":4},"Symbolic and Algebraic Manipulation"]
[{"$nulls":4},"Data Structures and Information Theory"]
[{"$nulls":4},"Data and Information Security"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[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","International conference proceedings."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Coding Theory -- Subspace Codes -- On Linear Programming Decoding on a Quantized Additive White Gaussian Noise Channel -- Codes as Modules over Skew Polynomial Rings -- On Higher Weights and Code Existence -- Mass Formula for Even Codes over  -- On the Classification of Self-dual -Codes -- On Linear Codes from Maximal Curves -- Symmetric Cryptography -- On Linear Cryptanalysis with Many Linear Approximations -- Bivium as a Mixed-Integer Linear "]
[{"$nulls":4},"Programming Problem -- Security of Cyclic Double Block Length Hash Functions -- Another Glance at Double-Length Hashing -- Geometric Ideas for Cryptographic Equation Solving in Even Characteristic -- Security Protocols -- Provably Secure Code-Based Threshold Ring Signatures -- A New Protocol for the Nearby Friend Problem -- Distributing the Key Distribution Centre in Sakai–Kasahara Based Systems -- Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes -- Attribute-Based Encryption Supporting Direct/Indirect Revocation Modes -- Certificate-Free Attribute Authentication -- Asymmetric Cryptography -- Comparing with RSA -- Double-Exponentiation in Factor-4 Groups and Its Applications -- Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms -- An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems -- Boolean Functions -- On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions -- A New Family of Hyper-Bent Boolean Functions in Polynomial Form -- The Rayleigh Quotient of Bent Functions -- Side Channels and Implementations -- Cache Timing Analysis of LFSR-Based Stream Ciphers -- Optimal Recovery of Secret Keys from Weak Side Channel Traces -- Practical Zero-Knowledge Proofs for Circuit Evaluation."]
[null,null,null,"Sommario/riassunto","This book constitutes the refereed proceedings of the 12th IMA International Conference on Cryptography and Coding, held in Cirencester, UK in December 2009. The 26 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from 53 submissions. The papers are organized in topical sections on coding theory, symmetric cryptography, security protocols, asymmetric cryptography, Boolean functions and side channels and implementations."]