top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Cryptography and coding : 11th IMA international conference, Cirencester, UK, December 18-20, 2007 : proceedings / / edited by Steven Galbraith
Cryptography and coding : 11th IMA international conference, Cirencester, UK, December 18-20, 2007 : proceedings / / edited by Steven Galbraith
Edizione [1st ed. 2007.]
Pubbl/distr/stampa Berlin, Germany : , : Springer, , [2007]
Descrizione fisica 1 online resource (XI, 426 p.)
Disciplina 003.54
Collana Security and Cryptology
Soggetto topico Coding theory
ISBN 3-540-77272-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise -- Galois Rings and Pseudo-random Sequences -- Signatures I -- Finding Invalid Signatures in Pairing-Based Batches -- How to Forge a Time-Stamp Which Adobe’s Acrobat Accepts -- Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions -- On the Walsh Spectrum of a New APN Function -- Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes -- Cryptanalysis of the EPBC Authenticated Encryption Mode -- Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of Encryption -- Algebraic Cryptanalysis of the Data Encryption Standard -- Cryptographic Side-Channels from Low-Power Cache Memory -- New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures -- Remarks on the New Attack on the Filter Generator and the Role of High Order Complexity -- Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences -- Efficient KEMs with Partial Message Recovery -- Randomness Reuse: Extensions and Improvements -- On the Connection Between Signcryption and One-Pass Key Establishment -- Optimised Versions of the Ate and Twisted Ate Pairings -- Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic -- Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction -- Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic -- Toward Acceleration of RSA Using 3D Graphics Hardware -- Signatures II -- Multi-key Hierarchical Identity-Based Signatures -- Verifier-Key-Flexible Universal Designated-Verifier Signatures.
Record Nr. UNINA-9910483305303321
Berlin, Germany : , : Springer, , [2007]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Cryptography and coding : 11th IMA international conference, Cirencester, UK, December 18-20, 2007 : proceedings / / edited by Steven Galbraith
Cryptography and coding : 11th IMA international conference, Cirencester, UK, December 18-20, 2007 : proceedings / / edited by Steven Galbraith
Edizione [1st ed. 2007.]
Pubbl/distr/stampa Berlin, Germany : , : Springer, , [2007]
Descrizione fisica 1 online resource (XI, 426 p.)
Disciplina 003.54
Collana Security and Cryptology
Soggetto topico Coding theory
ISBN 3-540-77272-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise -- Galois Rings and Pseudo-random Sequences -- Signatures I -- Finding Invalid Signatures in Pairing-Based Batches -- How to Forge a Time-Stamp Which Adobe’s Acrobat Accepts -- Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions -- On the Walsh Spectrum of a New APN Function -- Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes -- Cryptanalysis of the EPBC Authenticated Encryption Mode -- Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of Encryption -- Algebraic Cryptanalysis of the Data Encryption Standard -- Cryptographic Side-Channels from Low-Power Cache Memory -- New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures -- Remarks on the New Attack on the Filter Generator and the Role of High Order Complexity -- Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences -- Efficient KEMs with Partial Message Recovery -- Randomness Reuse: Extensions and Improvements -- On the Connection Between Signcryption and One-Pass Key Establishment -- Optimised Versions of the Ate and Twisted Ate Pairings -- Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic -- Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction -- Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic -- Toward Acceleration of RSA Using 3D Graphics Hardware -- Signatures II -- Multi-key Hierarchical Identity-Based Signatures -- Verifier-Key-Flexible Universal Designated-Verifier Signatures.
Record Nr. UNISA-996465828503316
Berlin, Germany : , : Springer, , [2007]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Pairing-based cryptography - Pairing 2008 : second international conference, Egham, UK, September 1-3, 2008 ; proceedings / / Steven D. Galbraith, Kenneth G. Paterson (eds.)
Pairing-based cryptography - Pairing 2008 : second international conference, Egham, UK, September 1-3, 2008 ; proceedings / / Steven D. Galbraith, Kenneth G. Paterson (eds.)
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Descrizione fisica 1 online resource (XI, 377 p.)
Disciplina 005.82
Collana Security and Cryptology
Soggetto topico Computer security
Sets of pairs of functions to be distinguished
Cryptography
ISBN 3-540-85538-6
Classificazione 54.62
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks -- Pairings in Trusted Computing -- Pairing Lattices -- The Uber-Assumption Family -- Cryptography I -- Homomorphic Encryption and Signatures from Vector Decomposition -- Hidden-Vector Encryption with Groups of Prime Order -- Mathematics -- The Hidden Root Problem -- Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography -- Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group -- Constructing Pairing Friendly Curves -- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field -- Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials -- A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties -- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2?=?x 5?+?ax -- Implementation of Pairings -- Integer Variable ?–Based Ate Pairing -- Pairing Computation on Twisted Edwards Form Elliptic Curves -- Exponentiation in Pairing-Friendly Groups Using Homomorphisms -- Generators for the ?-Torsion Subgroup of Jacobians of Genus Two Curves -- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms -- Pairings on Hyperelliptic Curves with a Real Model -- Hardware Implementation -- Faster Implementation of ? T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition -- A Comparison between Hardware Accelerators for the Modified Tate Pairing over and -- Cryptography II -- One-Round ID-Based Blind Signature Scheme without ROS Assumption -- Tracing Malicious Proxies in Proxy Re-encryption -- Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities.
Record Nr. UNINA-9910483733803321
Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Pairing-based cryptography - Pairing 2008 : second international conference, Egham, UK, September 1-3, 2008 ; proceedings / / Steven D. Galbraith, Kenneth G. Paterson (eds.)
Pairing-based cryptography - Pairing 2008 : second international conference, Egham, UK, September 1-3, 2008 ; proceedings / / Steven D. Galbraith, Kenneth G. Paterson (eds.)
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Descrizione fisica 1 online resource (XI, 377 p.)
Disciplina 005.82
Collana Security and Cryptology
Soggetto topico Computer security
Sets of pairs of functions to be distinguished
Cryptography
ISBN 3-540-85538-6
Classificazione 54.62
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks -- Pairings in Trusted Computing -- Pairing Lattices -- The Uber-Assumption Family -- Cryptography I -- Homomorphic Encryption and Signatures from Vector Decomposition -- Hidden-Vector Encryption with Groups of Prime Order -- Mathematics -- The Hidden Root Problem -- Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography -- Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group -- Constructing Pairing Friendly Curves -- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field -- Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials -- A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties -- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2?=?x 5?+?ax -- Implementation of Pairings -- Integer Variable ?–Based Ate Pairing -- Pairing Computation on Twisted Edwards Form Elliptic Curves -- Exponentiation in Pairing-Friendly Groups Using Homomorphisms -- Generators for the ?-Torsion Subgroup of Jacobians of Genus Two Curves -- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms -- Pairings on Hyperelliptic Curves with a Real Model -- Hardware Implementation -- Faster Implementation of ? T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition -- A Comparison between Hardware Accelerators for the Modified Tate Pairing over and -- Cryptography II -- One-Round ID-Based Blind Signature Scheme without ROS Assumption -- Tracing Malicious Proxies in Proxy Re-encryption -- Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities.
Record Nr. UNISA-996465339603316
Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Topics in cryptology -- CT-RSA 2022 : Cryptographers' Track at the RSA Conference 2022, Virtual event, March 1-2, 2022, Proceedings / / Steven D. Galbraith, editor
Topics in cryptology -- CT-RSA 2022 : Cryptographers' Track at the RSA Conference 2022, Virtual event, March 1-2, 2022, Proceedings / / Steven D. Galbraith, editor
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2022]
Descrizione fisica 1 online resource (631 pages)
Disciplina 005.82
Collana Lecture notes in computer science
Soggetto topico Data encryption (Computer science)
ISBN 9783030953126
9783030953119
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910523770803321
Cham, Switzerland : , : Springer, , [2022]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Topics in cryptology -- CT-RSA 2022 : Cryptographers' Track at the RSA Conference 2022, Virtual event, March 1-2, 2022, Proceedings / / Steven D. Galbraith, editor
Topics in cryptology -- CT-RSA 2022 : Cryptographers' Track at the RSA Conference 2022, Virtual event, March 1-2, 2022, Proceedings / / Steven D. Galbraith, editor
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2022]
Descrizione fisica 1 online resource (631 pages)
Disciplina 005.82
Collana Lecture notes in computer science
Soggetto topico Data encryption (Computer science)
ISBN 9783030953126
9783030953119
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996464550103316
Cham, Switzerland : , : Springer, , [2022]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui