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.
Avdances in cryptology-ASIACRYPT '99 : international conference on the theory and application of cryptology and information security, Singapore, November 14-18, 1999 : proceedings / / Kwok Yan Lam, Eiji Okamoto, Chaoping Xing (editors)
| Avdances in cryptology-ASIACRYPT '99 : international conference on the theory and application of cryptology and information security, Singapore, November 14-18, 1999 : proceedings / / Kwok Yan Lam, Eiji Okamoto, Chaoping Xing (editors) |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (XII, 420 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer security
Cryptography |
| ISBN | 3-540-48000-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Modulus Search for Elliptic Curve Cryptosystems -- Asymmetric Key Cryptosystems -- On the Lai-Massey Scheme -- On Cryptographically Secure Vectorial Boolean Functions -- Analysis -- Equivalent Keys of HPC -- Cryptanalysis of Five Rounds of CRYPTON Using Impossible Differentials -- Cryptanalysis of Two Cryptosystems Based on Group Actions -- Probabilistic Higher Order Differential Attack and Higher Order Bent Functions -- Elliptic Curve Cryptosystems -- Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field -- Optimizing the Menezes-Okamoto-Vanstone (MOV) Algorithm for Non-supersingular Elliptic Curves -- Speeding up the Discrete Log Computation on Curves with Automorphisms -- ECC: Do We Need to Count? -- Elliptic Scalar Multiplication Using Point Halving -- Public Key Cryptosystems -- On the Design of RSA with Short Secret Exponent -- Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries -- Adaptively-Secure Optimal-Resilience Proactive RSA -- Integers and Computation -- Factorization of RSA-140 Using the Number Field Sieve -- How to Prove That a Committed Number Is Prime -- Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields -- General Adversaries in Unconditional Multi-party Computation -- Network Security -- Approximation Hardness and Secure Communication in Broadcast Channels -- Mix-Networks on Permutation Networks -- Secure Communication in an Unknown Network Using Certificates -- Random Number -- Linear Complexity versus Pseudorandomness: On Beth and Dai’s Result -- A Class of Explicit Perfect Multi-sequences -- Cryptanalysis of LFSR-Encrypted Codes with Unknown Combining Function -- Key Management -- Doing More with Fewer Bits -- A Quick Group Key Distribution Scheme with “Entity Revocation” -- An Efficient Hierarchical Identity-Based Key-Sharing Method Resistant against Collusion-Attacks -- Periodical Multi-secret Threshold Cryptosystems -- Authentication -- A Signature Scheme with Message Recovery as Secure as Discrete Logarithm -- A 3-Codes under Collusion Attacks -- Broadcast Authentication in Group Communication. |
| Record Nr. | UNINA-9910143649603321 |
| Berlin, Heidelberg : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Avdances in cryptology-ASIACRYPT '99 : international conference on the theory and application of cryptology and information security, Singapore, November 14-18, 1999 : proceedings / / Kwok Yan Lam, Eiji Okamoto, Chaoping Xing (editors)
| Avdances in cryptology-ASIACRYPT '99 : international conference on the theory and application of cryptology and information security, Singapore, November 14-18, 1999 : proceedings / / Kwok Yan Lam, Eiji Okamoto, Chaoping Xing (editors) |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (XII, 420 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer security
Cryptography |
| ISBN | 3-540-48000-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Modulus Search for Elliptic Curve Cryptosystems -- Asymmetric Key Cryptosystems -- On the Lai-Massey Scheme -- On Cryptographically Secure Vectorial Boolean Functions -- Analysis -- Equivalent Keys of HPC -- Cryptanalysis of Five Rounds of CRYPTON Using Impossible Differentials -- Cryptanalysis of Two Cryptosystems Based on Group Actions -- Probabilistic Higher Order Differential Attack and Higher Order Bent Functions -- Elliptic Curve Cryptosystems -- Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field -- Optimizing the Menezes-Okamoto-Vanstone (MOV) Algorithm for Non-supersingular Elliptic Curves -- Speeding up the Discrete Log Computation on Curves with Automorphisms -- ECC: Do We Need to Count? -- Elliptic Scalar Multiplication Using Point Halving -- Public Key Cryptosystems -- On the Design of RSA with Short Secret Exponent -- Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries -- Adaptively-Secure Optimal-Resilience Proactive RSA -- Integers and Computation -- Factorization of RSA-140 Using the Number Field Sieve -- How to Prove That a Committed Number Is Prime -- Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields -- General Adversaries in Unconditional Multi-party Computation -- Network Security -- Approximation Hardness and Secure Communication in Broadcast Channels -- Mix-Networks on Permutation Networks -- Secure Communication in an Unknown Network Using Certificates -- Random Number -- Linear Complexity versus Pseudorandomness: On Beth and Dai’s Result -- A Class of Explicit Perfect Multi-sequences -- Cryptanalysis of LFSR-Encrypted Codes with Unknown Combining Function -- Key Management -- Doing More with Fewer Bits -- A Quick Group Key Distribution Scheme with “Entity Revocation” -- An Efficient Hierarchical Identity-Based Key-Sharing Method Resistant against Collusion-Attacks -- Periodical Multi-secret Threshold Cryptosystems -- Authentication -- A Signature Scheme with Message Recovery as Secure as Discrete Logarithm -- A 3-Codes under Collusion Attacks -- Broadcast Authentication in Group Communication. |
| Record Nr. | UNISA-996465840303316 |
| Berlin, Heidelberg : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||