Advances in Cryptology - EUROCRYPT '90 (eBook, PDF)
Workshop on the Theory and Application of Cryptographic Techniques, Aarhus, Denmark, May 21-24, 1990. Proceedings
Redaktion: Damgard, Ivan B.
40,95 €
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
20 °P sammeln
40,95 €
Als Download kaufen
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
20 °P sammeln
Jetzt verschenken
Alle Infos zum eBook verschenken
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
Alle Infos zum eBook verschenken
20 °P sammeln
Advances in Cryptology - EUROCRYPT '90 (eBook, PDF)
Workshop on the Theory and Application of Cryptographic Techniques, Aarhus, Denmark, May 21-24, 1990. Proceedings
Redaktion: Damgard, Ivan B.
- Format: PDF
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung

Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei
bücher.de, um das eBook-Abo tolino select nutzen zu können.
Hier können Sie sich einloggen
Hier können Sie sich einloggen
Sie sind bereits eingeloggt. Klicken Sie auf 2. tolino select Abo, um fortzufahren.

Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei bücher.de, um das eBook-Abo tolino select nutzen zu können.
This volume gives the proceedings of Eurocrypt 90. It is organized into sections on protocols, number-theoretic algorithms, boolean functions, binary sequences, implementations, combinatorial schemes, cryptanalysis, new cryptosystems, signatures and authentication, and impromptu talks.
- Geräte: PC
- ohne Kopierschutz
- eBook Hilfe
- Größe: 23.67MB
Andere Kunden interessierten sich auch für
Advances in Cryptology - EUROCRYPT '92 (eBook, PDF)40,95 €
Friedrich L. BauerDecrypted Secrets (eBook, PDF)160,95 €
Progress in Cryptology - INDOCRYPT 2002 (eBook, PDF)40,95 €
Computer Security - ESORICS 2007 (eBook, PDF)72,95 €
Advances in Cryptology - CRYPTO '96 (eBook, PDF)40,95 €
Advances in Cryptology - CRYPTO 2005 (eBook, PDF)40,95 €
Advances in Cryptology - CRYPTO '94 (eBook, PDF)40,95 €-
-
-
This volume gives the proceedings of Eurocrypt 90. It is organized into sections on protocols, number-theoretic algorithms, boolean functions, binary sequences, implementations, combinatorial schemes, cryptanalysis, new cryptosystems, signatures and authentication, and impromptu talks.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
Produktdetails
- Produktdetails
- Verlag: Springer Berlin Heidelberg
- Seitenzahl: 503
- Erscheinungstermin: 30. Juni 2003
- Englisch
- ISBN-13: 9783540468776
- Artikelnr.: 53393700
- Verlag: Springer Berlin Heidelberg
- Seitenzahl: 503
- Erscheinungstermin: 30. Juni 2003
- Englisch
- ISBN-13: 9783540468776
- Artikelnr.: 53393700
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
Protocols.- All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions.- On the Importance of Memory Resources in the Security of Key Exchange Protocols.- Provably Secure Key-Updating Schemes in Identity-Based Systems.- Oblivious transfer protecting secrecy.- Public-Randomness in Public-Key Cryptography.- An Interactive Identification Scheme Based on Discrete Logarithms and Factoring.- Number-Theoretic Algorithms.- Factoring with two large primes.- Which new RSA signatures can be computed from some given RSA signatures?.- Implementation of a Key Exchange Protocol Using Real Quadratic Fields.- Distributed Primality Proving and the Primality of (23539 + 1)/3.- Boolean Functions.- Properties of binary functions.- How to Construct Pseudorandom Permutations from Single Pseudorandom Functions.- Constructions of bent functions and difference sets.- Propagation Characteristics of Boolean Functions.- Binary Sequences.- The Linear Complexity Profile and the Jump Complexity of Keystream Sequences.- Lower Bounds for the Linear Complexity of Sequences over Residue Rings.- On the Construction of Run Permuted Sequences.- Correlation Properties of Combiners with Memory in Stream Ciphers (Extended Abstract).- Correlation Functions of Geometric Sequences.- Implementations.- Exponentiating Faster with Addition Chains.- A Cryptographic Library for the Motorola DSP56000.- VICTOR an efficient RSA hardware implementation.- Experimental Quantum Cryptography.- Combinatorial Schemes.- A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutually Trusted Party.- Lower Bounds for Authentication Codes with Splitting.- Essentially ?-fold secure authentication systems.- On the construction of authentication codes with secrecy and codeswithstanding spoofing attacks of order L ? 2.- Cryptanalysis.- Cryptanalysis of a public-key cryptosystem based on approximations by rational numbers.- A Known-Plaintext Attack on Two-Key Triple Encryption.- Confirmation that Some Hash Functions Are Not Collision Free.- Inverting the Pseudo Exponentiation.- New Cryptosystems.- Cryptosystem for Group Oriented Cryptography.- A Provably-Secure Strongly-Randomized Cipher.- General public key residue cryptosystems and mental poker protocols.- A Proposal for a New Block Encryption Standard.- A new trapdoor in knapsacks.- Signatures and Authentication.- On the Design of Provably-Secure Cryptographic Hash Functions.- Fast Signature Generation with a Fiat Shamir - Like Scheme.- A Remark on a Signature Scheme Where Forgery can be Proved.- Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme.- Zero-Knowledge Undeniable Signatures (extended abstract).- Precautions taken against various potential attacks.- Impromptu Talks.- Software Run-Time Protection: A Cryptographic Issue.- An identity-based identification scheme based on discrete logarithms modulo a composite number.- A Noisy Clock-Controlled Shift Register Cryptanalysis Concept Based on Sequence Comparison Approach.- The MD4 Message Digest Algorithm.- A remark on the efficiency of identification schemes.- On an Implementation of the Mohan-Adiga Algorithm.
Protocols.- All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions.- On the Importance of Memory Resources in the Security of Key Exchange Protocols.- Provably Secure Key-Updating Schemes in Identity-Based Systems.- Oblivious transfer protecting secrecy.- Public-Randomness in Public-Key Cryptography.- An Interactive Identification Scheme Based on Discrete Logarithms and Factoring.- Number-Theoretic Algorithms.- Factoring with two large primes.- Which new RSA signatures can be computed from some given RSA signatures?.- Implementation of a Key Exchange Protocol Using Real Quadratic Fields.- Distributed Primality Proving and the Primality of (23539 + 1)/3.- Boolean Functions.- Properties of binary functions.- How to Construct Pseudorandom Permutations from Single Pseudorandom Functions.- Constructions of bent functions and difference sets.- Propagation Characteristics of Boolean Functions.- Binary Sequences.- The Linear Complexity Profile and the Jump Complexity of Keystream Sequences.- Lower Bounds for the Linear Complexity of Sequences over Residue Rings.- On the Construction of Run Permuted Sequences.- Correlation Properties of Combiners with Memory in Stream Ciphers (Extended Abstract).- Correlation Functions of Geometric Sequences.- Implementations.- Exponentiating Faster with Addition Chains.- A Cryptographic Library for the Motorola DSP56000.- VICTOR an efficient RSA hardware implementation.- Experimental Quantum Cryptography.- Combinatorial Schemes.- A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutually Trusted Party.- Lower Bounds for Authentication Codes with Splitting.- Essentially ?-fold secure authentication systems.- On the construction of authentication codes with secrecy and codeswithstanding spoofing attacks of order L ? 2.- Cryptanalysis.- Cryptanalysis of a public-key cryptosystem based on approximations by rational numbers.- A Known-Plaintext Attack on Two-Key Triple Encryption.- Confirmation that Some Hash Functions Are Not Collision Free.- Inverting the Pseudo Exponentiation.- New Cryptosystems.- Cryptosystem for Group Oriented Cryptography.- A Provably-Secure Strongly-Randomized Cipher.- General public key residue cryptosystems and mental poker protocols.- A Proposal for a New Block Encryption Standard.- A new trapdoor in knapsacks.- Signatures and Authentication.- On the Design of Provably-Secure Cryptographic Hash Functions.- Fast Signature Generation with a Fiat Shamir - Like Scheme.- A Remark on a Signature Scheme Where Forgery can be Proved.- Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme.- Zero-Knowledge Undeniable Signatures (extended abstract).- Precautions taken against various potential attacks.- Impromptu Talks.- Software Run-Time Protection: A Cryptographic Issue.- An identity-based identification scheme based on discrete logarithms modulo a composite number.- A Noisy Clock-Controlled Shift Register Cryptanalysis Concept Based on Sequence Comparison Approach.- The MD4 Message Digest Algorithm.- A remark on the efficiency of identification schemes.- On an Implementation of the Mohan-Adiga Algorithm.







