{"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":30,"n_cols":5,"rows_kept":30,"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],[22,2,22,3],[23,2,23,3],[27,2,27,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910485140003321"]
[null,null,"Titolo",null,"Selected Areas in Cryptography : 15th Annual International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, 2008 / / edited by Roberto Avanzi, Liam Keliher, Francesco Sica"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009"]
[null,null,"ISBN",null,"3-642-04159-0"]
[null,null,"Edizione",null,"[1st ed. 2009.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XI, 457 p.)"]
[null,null,"Collana",null,"Security and Cryptology, , 2946-1863 ; ; 5381"]
[null,null,"Disciplina",null,"005.8"]
[null,null,"Soggetti",null,"Cryptography"]
[{"$nulls":4},"Data encryption (Computer science)"]
[{"$nulls":4},"Data protection"]
[{"$nulls":4},"Coding theory"]
[{"$nulls":4},"Information theory"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Cryptology"]
[{"$nulls":4},"Data and Information Security"]
[{"$nulls":4},"Coding and Information Theory"]
[{"$nulls":4},"Data Structures and Information Theory"]
[{"$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,"Elliptic and Hyperelliptic Curve Arithmetic -- Faster Halvings in Genus 2 -- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates -- On Software Parallel Implementation of Cryptographic Pairings -- Block Ciphers I -- The Cryptanalysis of Reduced-Round SMS4 -- Building Secure Block Ciphers on Generic Attacks Assumptions -- First Invited Talk -- Lifting and Elliptic Curve Discrete Logarithms -- Hash Functions I -- Preimage Attacks on One-Block MD4, 63-Step MD5 and More -- Preimage Attacks on 3-Pass HAVAL and Step-Reduced MD5 -- Cryptanalysis of Tweaked Versions of SMASH and Reparation -- Mathematical Aspects of Applied Cryptography I -- Counting Functions "]
[{"$nulls":4},"for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences -- On the Exact Success Rate of Side Channel Analysis in the Gaussian Model -- Stream Ciphers Cryptanalysis -- Algebraic and Correlation Attacks against Linearly Filtered Non Linear Feedback Shift Registers -- A Cache Timing Analysis of HC-256 -- An Improved Fast Correlation Attack on Stream Ciphers -- Hash Functions II -- A Three-Property-Secure Hash Function -- Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques -- A Scheme to Base a Hash Function on a Block Cipher -- Collisions and Other Non-random Properties for Step-Reduced SHA-256 -- Cryptography with Algebraic Curves -- Public Verifiability from Pairings in Secret Sharing Schemes -- The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences -- Second Invited Talk – Stafford Tavares Lecture -- The “Coefficients H” Technique -- Mathematical Aspects of Applied Cryptography II -- Distinguishing Multiplications from Squaring Operations -- Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and ChineseRemaindering -- Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators -- Curve-Based Primitives in Hardware -- HECC Goes Embedded: An Area-Efficient Implementation of HECC -- ECC Is Ready for RFID – A Proof in Silicon -- Block Ciphers II -- Cryptanalysis of a Generic Class of White-Box Implementations -- New Linear Cryptanalytic Results of Reduced-Round of CAST-128 and CAST-256 -- Improved Impossible Differential Cryptanalysis of Reduced-Round Camellia."]
[null,null,null,"Sommario/riassunto","The book in front of you contains the proceedings of SAC 2008, the 15th - nual Workshop on Selected Areas in Cryptography. SAC 2008 took place during August 14-15 at Mount Allison University, Sackville, New Brunswick, Canada. This was the ?rst time that SAC was hosted in New Brunswick, and the second time in an Atlantic Canadian province. Previous SAC workshops were held at Queen's University in Kingston (1994, 1996, 1998, 1999, and 2005), at Carleton University in Ottawa (1995, 1997, 2003), at the University of Waterloo (2000, 2004), at the Fields Institute in Toronto (2001), at Memorial University of N- foundland at St. John's (2002), at Concordia University in Montreal (2006) and at the University of Ottawa (2007). The intent ofthe workshopseriesis to provide a relaxedatmospherein which researchers in cryptography can present and discuss new work on selected areas of current interest. The SAC workshop series has ?rmly established itself as an international forum for intellectual exchange in cryptological research. Theresponsibilityforchoosingthe venueofeachSACworkshopandappoi- ingtheCo-chairslieswiththeSACOrganizingBoard.TheCo-chairsthenchoose the Program Committee in consultation with the Board. Hence, we would like to expressour gratitudeto the SAC OrganizingBoardfor giving usthe mandate to organize SAC 2008, and for their invaluable feedback while assembling the Program Committee."]