year |
venue |
title |
pages |
1985 | crypto | Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him? | 477-488 |
1985 | crypto | Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis | 489-513 |
1985 | crypto | Analysis of a Public Key Approach Based on Polynomial Substitution | 340-349 |
1985 | crypto | Trapdoor Rings and Their Use in Cryptography | 369-395 |
1985 | crypto | A Layered Approach to the Design of Private Key Cryptosystems | 227-245 |
1985 | crypto | Symmetric Public-Key Encryption | 128-137 |
1985 | crypto | On the Design of S-Boxes | 523-534 |
1985 | crypto | On Computing Logarithms Over Finite Fields | 396-402 |
1985 | crypto | An M³ Public-Key Encryption Scheme | 358-368 |
1985 | crypto | How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) | 447 |
1985 | crypto | Cryptography with Cellular Automata | 429-432 |
1985 | crypto | Some Cryptographic Aspects of Womcodes | 458-467 |
1985 | crypto | Software Protection: Myth or Reality? | 140-157 |
1985 | crypto | Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers | 192-211 |
1985 | crypto | Lifetimes of Keys in Cryptographic Key Management Systems | 246-259 |
1985 | crypto | Access Control at the Netherlands Postal and Telecommunications Services | 543-544 |
1985 | crypto | On Using RSA with Low Exponent in a Public Key Network | 403-408 |
1985 | crypto | Advances in Cryptology - CRYPTO '85, Santa Barbara, California, USA, August 18-22, 1985, Proceedings | online |
1985 | crypto | An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi | 28-32 |
1985 | crypto | Public Protection of Software | 158-179 |
1985 | crypto | Information Theory Without the Finiteness Assumption, II: Unfolding the DES | 282-337 |
1985 | crypto | The Bit Security of Modular Squaring Given Partial Factorization of the Modulos | 448-457 |
1985 | crypto | Fingerprinting Long Forgiving Messages | 180-189 |
1985 | crypto | Another Birthday Attack | 14-17 |
1985 | crypto | Cheating at Mental Poker | 104-107 |
1985 | crypto | The Real Reason for Rivest's Phenomenon | 535-536 |
1985 | crypto | The Importance of "Good" Key Scheduling Schemes (How to Make a Secure DES Scheme with <= 48 Bit Keys) | 537-542 |
1985 | crypto | Efficient Parallel Pseudo-Random Number Generation | 433-446 |
1985 | crypto | A Secure Poker Protocol that Minimizes the Effect of Player Coalitions | 73-86 |
1985 | crypto | Correlation Immunity and the Summation Generator | 260-272 |
1985 | crypto | Attacks on Some RSA Signatures | 18-27 |
1985 | crypto | Developing an RSA Chip | 350-357 |
1985 | crypto | On the Security of DES | 280-281 |
1985 | crypto | Is DES a Pure Cipher? (Results of More Cycling Experiments on DES) | 212-226 |
1985 | crypto | Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences | 42-55 |
1985 | crypto | Design of Combiners to Prevent Divide and Conquer Attacks | 273-279 |
1985 | crypto | A Secure Subliminal Channel (?) | 33-41 |
1985 | crypto | A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes | 516-522 |
1985 | crypto | How to Reduce Your Enemy's Information (Extended Abstract) | 468-476 |
1985 | crypto | A Framework for the Study of Cryptographic Protocols | 87-103 |
1985 | crypto | Security for the DoD Transmission Control Protocol | 108-127 |
1985 | crypto | Lenstra's Factorization Method Based on Elliptic Curves | 409-416 |
1985 | crypto | Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields | 3-13 |
1985 | crypto | Use of Elliptic Curves in Cryptography | 417-426 |
1985 | crypto | On the Security of Ping-Pong Protocols when Implemented using the RSA | 58-72 |
1985 | eurocrypt | Cryptanalysis of the Dickson Scheme | 50-61 |
1985 | eurocrypt | A Comment on Niederreiter's Public Key Cryptosystem | 40-42 |
1985 | eurocrypt | A Note On Sequences Generated by Clock Controlled Shift Registers | 142-148 |
1985 | eurocrypt | Generalized Multiplexed Sequences | 135-141 |
1985 | eurocrypt | On the History of Cryptography during WW2, and Possible New Directions for Cryptograpic Research | 18-28 |
1985 | eurocrypt | Implementation Study of Public Key Cryptographic Protection in an Existing Electronic Mail and Document Handling System | 43-49 |
1985 | eurocrypt | Using Algorithms as Keys in Stream Ciphers | 149-155 |
1985 | eurocrypt | A Public-Key Cryptosystem based on Shift Register Sequences | 35-39 |
1985 | eurocrypt | Authorized Writing for "Write-Once" Memories | 111-115 |
1985 | eurocrypt | Full Encryption in a Personal Computer System | 231-240 |
1985 | eurocrypt | Showing Credentials Without Identification: SIgnatures Transferred Between Unconditionally Unlinkable Pseudonyms | 241-244 |
1985 | eurocrypt | On Feedforward Transforms and p-Fold Periodic p-Arrays | 130-134 |
1985 | eurocrypt | Two New Secret Key Cryptosystems | 96-102 |
1985 | eurocrypt | On the Linear Complexity of Combined Shift Register Sequences | 156-160 |
1985 | eurocrypt | The Role of Encipherment Services in Distributed Systems | 214-220 |
1985 | eurocrypt | Simultaneous Security of Bits in the Discrete Log | 62-72 |
1985 | eurocrypt | Networks Without User Observability: Design Options | 245-253 |
1985 | eurocrypt | Is the Data Encryption Standard a Group? (Preliminary Abstract) | 81-95 |
1985 | eurocrypt | On Public-Key Cryptosystems Built using Polynomial Rings | 73-78 |
1985 | eurocrypt | On Functions of Linear Shift Register Sequences | 119-129 |
1985 | eurocrypt | Advances in Cryptology - EUROCRYPT '85, Workshop on the Theory and Application of of Cryptographic Techniques, Linz, Austria, April 1985, Proceedings | online |
1985 | eurocrypt | The Verifiability of Two-Party Protocols | 254-260 |
1985 | eurocrypt | The Contribution of E. B. Fleissner and A. Figl for Today's Cryptography | 3-17 |
1985 | eurocrypt | Encryption: Needs, Requirements, and SOlutions in Banking Networks | 208-213 |
1985 | eurocrypt | Modelling of Encryption Techniques for Secrecy and Privacy in Multi-User Networks | 221-230 |
1985 | eurocrypt | Efficient Factoring Based on Partial Information | 31-34 |
1985 | eurocrypt | Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators | 161-166 |
1985 | eurocrypt | Message Protection by Spread Spectrum Modulation in a Packet Voice Radio Link | 273-277 |
1985 | eurocrypt | Linear Complexity and Random Sequences | 167-188 |
1985 | eurocrypt | Engineering Secure Information Systems | 191-199 |
1985 | eurocrypt | Cryptanalysts Representation of Nonlinearly Filtered ML-Sequences | 103-110 |
1985 | eurocrypt | The Chipcard: An Identification Card With Cryptographic Protection | 200-207 |
1985 | eurocrypt | The Practice of Authentication | 261-272 |