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.
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 | ||
| ||
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 | ||
| ||
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 | ||
| ||
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 | ||
| ||
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 | ||
| ||
Topics in Cryptology – CT-RSA 2022 : Cryptographers’ Track at the RSA Conference 2022, Virtual Event, March 1–2, 2022, Proceedings / / edited by Steven D. Galbraith
| Topics in Cryptology – CT-RSA 2022 : Cryptographers’ Track at the RSA Conference 2022, Virtual Event, March 1–2, 2022, Proceedings / / edited by Steven D. Galbraith |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (631 pages) |
| Disciplina |
005.82
005.824 |
| Collana | Security and Cryptology |
| Soggetto topico |
Cryptography
Data encryption (Computer science) Computer engineering Computer networks Coding theory Information theory Cryptology Computer Engineering and Networks Computer Communication Networks Coding and Information Theory |
| ISBN |
9783030953126
9783030953119 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Multicast Key Agreement, Revisited -- 1 Introduction -- 1.1 Contributions -- 2 Preliminaries -- 3 Multicast Key Agreement -- 3.1 MKA Syntax -- 3.2 MKA Efficiency Measures -- 3.3 MKA Security -- 4 MKA Construction -- 4.1 MKA Trees -- 4.2 GUS MKA Protocol -- 4.3 Security of GUS MKA Protocol -- 4.4 Comparison of Trees in GUS -- 5 Adding Security for Group Manager Corruptions -- 5.1 Group Manager State Separation and Efficiency Measures -- 5.2 MKA Security with Group Manager FS and Eventual PCS -- References -- A Pairing-Free Signature Scheme from Correlation Intractable Hash Function and Strong Diffie-Hellman Assumption -- 1 Introduction -- 2 Definitions -- 2.1 Signature Schemes -- 2.2 Intractability Assumptions -- 3 Prior Art -- 3.1 The EDL Family of Signatures -- 3.2 Boneh-Boyen Signatures -- 3.3 Existing Pairing-Free Discrete-Log Signature Schemes in the Standard Model -- 3.4 OR-Based Signature Schemes -- 4 Our Signature Scheme -- 4.1 Intuition of the Design -- 4.2 Description -- 4.3 Introducing Discrete-Log Collisions -- 4.4 Security Proof -- 5 Conclusion -- References -- Faster Isogenies for Post-quantum Cryptography: SIKE -- 1 Introduction -- 2 Preliminaries: Isogenies on Elliptic Curves -- 2.1 Isogeny-Based Cryptography -- 2.2 Supersingular Isogeny Key Encapsulation -- 3 Proposed Method for Large-Degree Isogenies of Odd Power Degree -- 3.1 Large-Degree Isogenies -- 3.2 Large-Degree Isogenies of an Odd Power -- 4 Proposed Explicit Formulas for Large-Degree Isogenies -- 4.1 Proposed Efficient Algorithm for Large-Degree Isogenies with a Remainder -- 4.2 Proposed Faster 2-Isogeny Formulas for Large-Degree Isogenies -- 5 Benchmarking and Evaluation -- 6 Conclusion -- References -- Fully Projective Radical Isogenies in Constant-Time -- 1 Introduction -- 2 Preliminaries -- 2.1 CSIDH and Its Surface.
2.2 The Group Action of CSIDH and CSURF -- 2.3 The Tate Normal Form -- 2.4 Radical Isogenies -- 3 Fully Projective Radical Isogenies -- 3.1 Efficient Radicals for Projective Coordinates -- 3.2 Explicit Projective Formulas for Low Degrees -- 3.3 Cost of Projective Radical Isogenies per Degree -- 4 Cost Analysis of Constant-Time Radical Isogenies -- 4.1 Analysis of Effectiveness of Radical Isogenies -- 4.2 Further Discussion -- 5 A Hybrid Strategy for Radical Isogenies -- 5.1 A Hybrid Strategy for Integration of Radical Isogenies -- 5.2 Choosing Parameters for Hybrid Strategy -- 5.3 Algorithm for Evaluation of Hybrid Strategy -- 6 Implementation and Performance Benchmark -- 6.1 Performance Benchmark of Radical Isogenies -- 6.2 Performance of Radical Isogenies Using the Hybrid Strategy -- 7 Concluding Remarks and Future Research -- References -- Private Liquidity Matching Using MPC -- 1 Introduction -- 2 Preliminaries -- 2.1 The Gridlock Resolution Problem -- 2.2 Multiparty Computation (MPC) -- 3 The Gridlock Resolution Algorithm with MPC -- 3.1 Leakage -- 3.2 Experiments -- 4 Simulating an RTGS -- References -- Approximate Homomorphic Encryption with Reduced Approximation Error*-8pt -- 1 Introduction -- 2 Preliminaries -- 3 Reducing the Approximation Error in the CKKS Scheme -- 3.1 Approximation Errors in the CKKS Scheme -- 3.2 Eliminating LWE and Encoding Approximation Errors -- 3.3 Theoretical Estimates of Error Reduction -- 4 Reducing the Approximation Error in the RNS Instantiation of CKKS -- 4.1 Eliminating the Scaling Factor Approximation Error in RNS CKKS -- 4.2 Applying the Reduced-Error CKKS Modifications -- 5 Implementation Details and Results -- 5.1 Setting the Parameters -- 5.2 Software Implementation and Experimental Setup -- 5.3 Experimental Results -- 6 Concluding Remarks -- References. Attacks on Pseudo Random Number Generators Hiding a Linear Structure -- 1 Introduction -- 2 Coppersmith Method -- 3 Attacks on the Linear Congruential Generator -- 3.1 Attacks via a Coppersmith Method -- 3.2 Attack 3: With Stern's Algorithm -- 4 Attacks Against the Fast Knapsack Generator -- 4.1 Attack via Coppersmith Method with Consecutive Outputs -- 4.2 Attack via Coppersmith Method Without Consecutive Outputs -- 4.3 Attack via Stern's Attack on the LCG -- 4.4 Summary of Our Results -- 5 Combined Multiple Recursive Generators (CMRG) -- 5.1 Attack on the MRG32 -- 5.2 The MRG32k3a by L'Écuyer -- A Bernoulli Trials -- B Improvement of Coppersmith? -- B.1 Consecutive Outputs -- B.2 Not Consecutive Outputs -- References -- Lattice-Based Fault Attacks on Deterministic Signature Schemes of ECDSA and EdDSA -- 1 Introduction -- 2 Preliminaries -- 2.1 Notations -- 2.2 The Deterministic Signature Algorithms -- 2.3 Problems in Some Lattice -- 3 Adversarial Model -- 3.1 Fault Injection Model -- 3.2 Key Recovery by Solving Problems in Some Lattice -- 4 Concrete Lattice-Based Fault Attacks on Deterministic ECDSA and EdDSA Algorithms -- 4.1 Fault Attacks with Target r During the Calculation of s -- 4.2 Fault Attacks with Target k Before the Calculation of kG -- 4.3 Fault Attacks with the Targets During the Calculation of k -- 5 Experiment and Complexity Discussion -- 6 Countermeasures -- 7 Conclusion -- A Appendix -- A.1 Fault Attacks with Target k During the Calculation of s to Deterministic ECDSA -- A.2 Fault Attacks with Target k-1-5mumod5mu-n During the Calculation of s to Deterministic ECDSA -- A.3 Fault Attacks with Target d During the Calculation of s to Deterministic ECDSA -- A.4 Fault Attacks with Targets e, rd and e+rd During the Calculation of s to Deterministic ECDSA. A.5 Fault Attacks with Targets During the Calculation of e to Deterministic ECDSA -- A.6 Fault Attacks with targets During the Calculation of r to EdDSA -- References -- More Accurate Geometric Analysis on the Impact of Successful Decryptions for IND-CCA Secure Ring/Mod-LWE/LWR Based Schemes -- 1 Introduction -- 2 Preliminaries -- 2.1 (R/M-)LWE/LWR-Based Public-Key Encryption Scheme -- 2.2 Spherical Cap -- 3 Compression Errors -- 4 The Information Inferred by Successful Decryptions -- 4.1 The Relationship Between Successful Decryptions and Caps -- 4.2 The Range of the Proportion of Excluded Key Candidates -- 5 The Overlaps Among Queries and the Effect of Successful Decryptions on the Failure Probability -- 5.1 The Overlap Between Two Spherical Caps -- 5.2 The Overlaps Among Queries -- 5.3 The Decryption Failure Probability -- 6 (R/M-)LWE-Based Public-Key Encryption Schemes -- 6.1 Saber -- A The Proof of Theorem 1 -- B The Proof of Proposition 2 -- C The Proof of Theorem 2 -- D Some Results about the Overlaps among Different Caps of the Same Query -- E (R/M-)LWE-Based Public-Key Encryption Schemes -- E.1 Kyber -- E.2 Newhope -- E.3 Frodo -- References -- Integral Attacks on Pyjamask-96 and Round-Reduced Pyjamask-128 -- 1 Introduction -- 2 Preliminaries -- 2.1 Pyjamask Block Cipher Family -- 2.2 Notations -- 2.3 Monomial Prediction -- 2.4 MILP Modeling for the Monomial Prediction -- 3 Automatic Search Model for Pyjamask and Integral Distinguishers -- 3.1 MILP Model for Pyjamask-96 and Pyjamask-128 -- 3.2 Integral Distinguishers of Pyjamask-96 and Pyjamask-128 -- 4 Key Recovery Attack on Pyjamask-96 -- 4.1 Attack on 13-Round Pyjamask-96 -- 4.2 Attack on Full-Round Pyjamask-96 -- 5 Integral Attacks on Round-Reduced Pyjamask-128 -- 6 Conclusion -- References -- Related-Tweakey Impossible Differential Attack on Reduced-Round SKINNY-AEAD M1/M3. 1 Introduction -- 2 Preliminaries -- 2.1 Description of SKINNY-AEAD M1/M3 -- 2.2 Specification of the Underlying Primitive of SKINNY-AEAD M1/M3 -- 2.3 Properties of SKINNY -- 2.4 Notations -- 3 Related-Tweakey Impossible Differential Distinguisher -- 3.1 Constraints of Searching for Distinguishers in SKINNY-AEAD M1/M3 -- 3.2 Searching for Related-Tweakey Impossible Differential Distinguisher with STP -- 3.3 14-Round Related-Tweakey Impossible Differential Distinguishers -- 4 Tweakey Recovery Attack on 20-Round SKINNY-AEAD M1/M3 -- 5 Tweakey Recovery Attack on 18-Round SKINNY-AEAD M1/M3 -- 6 Conclusion -- A 18-Round Related-Tweakey Impossible Differential Attack for SKINNY-AEAD M1/M3 -- References -- Side-Channeling the Kalyna Key Expansion -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Paper Outline -- 2 Background -- 2.1 Kalyna -- 2.2 Cache Attacks -- 2.3 Related Work -- 3 Cryptanalysis Overview -- 4 Attacking Kalyna-128/128 -- 4.1 Recover Even Bytes of A0 -- 4.2 Recovering Odd Bytes of A0 -- 4.3 Recovering K -- 4.4 Recovering K -- 5 Attacks on Other Kalyna Variants -- 5.1 Relationship of Ki -- 5.2 Large Constant Ci -- 5.3 Aligning Columns -- 6 The Practical Attack -- 6.1 Instantiating the Oracle -- 6.2 Recovering the First Round Key -- 6.3 Recover the Master Key K of Kalyna-128/128 -- References -- Fake It Till You Make It: Data Augmentation Using Generative Adversarial Networks for All the Crypto You Need on Small Devices -- 1 Introduction -- 2 Preliminaries -- 2.1 Profiled Side-Channel Attacks -- 2.2 Generative Adversarial Networks (GANs) -- 2.3 Conditional Generative Adversarial Networks (cGANs) -- 2.4 Data Augmentation -- 2.5 Deep Learning Algorithms -- 2.6 Siamese Neural Network -- 2.7 Cryptographic Algorithms Under Evaluation -- 3 Related Works -- 4 Proposed Approach -- 4.1 Data Splitting -- 4.2 Siamese-cGAN Model for Data Augmentation. 4.3 cGAN Models for Discriminator and Generator. |
| Record Nr. | UNINA-9910523770803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||