year |
venue |
title |
pages |
2001 | asiacrypt | Autocorrelation Coefficients and Correlation Immunity of Boolean Functions | online |
2001 | asiacrypt | Computation of Discrete Logarithms in F2607 | online |
2001 | asiacrypt | Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank | online |
2001 | asiacrypt | Practical Construction and Analysis of Pseudo-Randomness Primitives | online |
2001 | asiacrypt | How to Achieve a McEliece-Based Digital Signature Scheme | online |
2001 | asiacrypt | Advances in Cryptology - ASIACRYPT 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia, December 9-13, 2001, Proceedings | online |
2001 | asiacrypt | Self-Blindable Credential Certificates from the Weil Pairing | online |
2001 | asiacrypt | Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices | online |
2001 | asiacrypt | Known-IV Attacks on Triple Modes of Operation of Block Ciphers | online |
2001 | asiacrypt | Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case | online |
2001 | asiacrypt | Secure Human Identification Protocols | online |
2001 | asiacrypt | Provably Secure Fair Blind Signatures with Tight Revocation | online |
2001 | asiacrypt | On the Insecurity of a Server-Aided RSA Protocol | online |
2001 | asiacrypt | Unbelievable Security. Matching AES Security Using Public Key Systems | online |
2001 | asiacrypt | An Efficient Implementation of Braid Groups | online |
2001 | asiacrypt | Mutually Independent Commitments | online |
2001 | asiacrypt | Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes | online |
2001 | asiacrypt | Oblivious Polynomial Evaluation and Oblivious Neural Learning | online |
2001 | asiacrypt | Key-Privacy in Public-Key Encryption | online |
2001 | asiacrypt | Generic Attacks on Feistel Schemes | online |
2001 | asiacrypt | The Modular Inversion Hidden Number Problem | online |
2001 | asiacrypt | Short Signatures from the Weil Pairing | online |
2001 | asiacrypt | Responsive Round Complexity and Concurrent Zero-Knowledge | online |
2001 | asiacrypt | How to Leak a Secret | online |
2001 | asiacrypt | A Probable Prime Test with Very High Confidence for n equiv 1 mod 4 | online |
2001 | asiacrypt | Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks | online |
2001 | asiacrypt | Fully Distributed Threshold RSA under Standard Assumptions | online |
2001 | asiacrypt | Supersingular Curves in Cryptography | online |
2001 | asiacrypt | An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves | online |
2001 | asiacrypt | A Compact Rijndael Hardware Architecture with S-Box Optimization | online |
2001 | asiacrypt | Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001 | online |
2001 | asiacrypt | Efficient Traitor Tracing Algorithms Using List Decoding | online |
2001 | asiacrypt | Provable Security of KASUMI and 3GPP Encryption Mode f8 | online |
2001 | asiacrypt | Speeding Up XTR | online |
2001 | asiacrypt | Debunking the Bible Codes | |
2001 | asiacrypt | Security of Reduced Version of the Block Cipher Camellia against Truncated and Impossible Differential Cryptanalysis | online |
2001 | ches | New Directions in Croptography | 159 |
2001 | ches | The Hessian Form of an Elliptic Curve | 118-125 |
2001 | ches | High-Radix Design of a Scalable Modular Multiplier | 185-201 |
2001 | ches | Sliding Windows Succumbs to Big Mac Attack | 286-299 |
2001 | ches | Bandwidth-Optimal Kleptographic Attacks | 235-250 |
2001 | ches | Preventing SPA/DPA in ECC Systems Using the Jacobi Form | 391-401 |
2001 | ches | Cryptographic Hardware and Embedded Systems - CHES 2001, Third International Workshop, Paris, France, May 14-16, 2001, Proceedings | online |
2001 | ches | Electromagnetic Analysis: Concrete Results | 251-261 |
2001 | ches | Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks | 39-50 |
2001 | ches | A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m) | 202-219 |
2001 | ches | An Implementation of DES and AES, Secure against Some Attacks | 309-318 |
2001 | ches | Protecting Embedded Systems - The Next Ten Years | 1-2 |
2001 | ches | NTRU in Constrained Devices | 262-272 |
2001 | ches | Attacks on Cryptoprocessor Transaction Sets | 220-234 |
2001 | ches | Fast Primitives for Internal Data Scrambling in Tamper Resistant Hardware | 16-27 |
2001 | ches | Tradeoffs in Parallel and Serial Implementations of the International Data Encryption Algorithm IDEA | 333-347 |
2001 | ches | Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor | 93-102 |
2001 | ches | Universal Exponentiation Algorithm | 300-308 |
2001 | ches | Hessian Elliptic Curves and Side-Channel Attacks | 402-410 |
2001 | ches | Protections against Differential Analysis for Elliptic Curve Cryptography | 377-390 |
2001 | ches | Two Methods of Rijndael Implementation in Reconfigurable Hardware | 77-92 |
2001 | ches | Architectural Optimization for a 1.82Gbits/sec VLSI Implementation of the AES Rijndael Algorithm | 51-64 |
2001 | ches | A Sound Method for Switching between Boolean and Arithmetic Masking | 3-15 |
2001 | ches | A New Low Complexity Parallel Multiplier for a Class of Finite Fields | 160-170 |
2001 | ches | Random Register Renaming to Foil DPA | 28-38 |
2001 | ches | High Performance Single-Chip FPGA Rijndael Algorithm Implementations | 65-76 |
2001 | ches | Implementation of RSA Algorithm Based on RNS Montgomery Multiplication | 364-376 |
2001 | ches | Efficient Elliptic Curve Cryptosystems from a Scalar Multiplication Algorithm with Recovery of the y-Coordinate on a Montgomery-Form Elliptic Curve | 126-141 |
2001 | ches | A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware | 348-363 |
2001 | ches | Transparent Harddisk Encryption | 273-285 |
2001 | ches | Efficient Rijndael Encryption Implementation with Composite Field Arithmetic | 171-184 |
2001 | ches | Efficient Implementation of "Large" Stream Cipher Systems | 319-332 |
2001 | ches | Generating Elliptic Curves of Prime Order | 142-158 |
2001 | ches | Efficient Online Tests for True Random Number Generators | 103-117 |
2001 | crypto | Pseudorandomness from Braid Groups | online |
2001 | crypto | Quantum information processing in semiconductors: an experimentalist's view | |
2001 | crypto | Privacy, Authentication & Identity: A recent history of cryptographic struggles for freedom | |
2001 | crypto | Minimal Complete Primitives for Secure Multi-party Computation | online |
2001 | crypto | RSA-OAEP Is Secure under the RSA Assumption | online |
2001 | crypto | Universally Composable Commitments | online |
2001 | crypto | An Efficient Scheme for Proving a Shuffle | online |
2001 | crypto | Simplified OAEP for the RSA and Rabin Functions | 275-291 |
2001 | crypto | Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation | online |
2001 | crypto | Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms | online |
2001 | crypto | Revocation and Tracing Schemes for Stateless Receivers | online |
2001 | crypto | Identity-Based Encryption from the Weil Pairing | online |
2001 | crypto | Two-Party Generation of DSA Signatures | online |
2001 | crypto | On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme | online |
2001 | crypto | A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0 | online |
2001 | crypto | Session-Key Generation Using Human Passwords Only | online |
2001 | crypto | Correlation Analysis of the Shrinking Generator | online |
2001 | crypto | Nonlinear Vector Resilient Functions | online |
2001 | crypto | New Public Key Cryptosystem Using Finite Non Abelian Groups | online |
2001 | crypto | Robustness for Free in Unconditional Multi-party Computation | online |
2001 | crypto | Cryptanalysis of RSA Signatures with Fixed-Pattern Padding | online |
2001 | crypto | Self Protecting Pirates and Black-Box Traitor Tracing | online |
2001 | crypto | Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings | online |
2001 | crypto | Secure and Efficient Asynchronous Broadcast Protocols | online |
2001 | crypto | Online Ciphers and the Hash-CBC Construction | online |
2001 | crypto | An Identity Escrow Scheme with Appointed Verifiers | online |
2001 | crypto | Forward-Secure Signatures with Optimal Signing and Verifying | online |
2001 | crypto | Secure Distributed Linear Algebra in a Constant Number of Rounds | online |
2001 | crypto | On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase | online |
2001 | crypto | Robust Non-interactive Zero Knowledge | online |
2001 | crypto | Improved Online/Offline Signature Schemes | online |
2001 | crypto | The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?) | online |
2001 | crypto | OAEP Reconsidered | online |
2001 | crypto | On the (Im)possibility of Obfuscating Programs | online |
2001 | crypto | Oblivious Transfer in the Bounded Storage Model | online |
2001 | crypto | Soundness in the Public-Key Model | online |
2001 | eprint | Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack | online |
2001 | eprint | New Notions of Soundness and Simultaneous Resettability in the Public-Key Model | online |
2001 | eprint | RSA hybrid encryption schemes | online |
2001 | eprint | An Identity Based Authenticated Key Agreement Protocol Based on the Weil Pairing | online |
2001 | eprint | A Proposal for an ISO Standard for Public Key Encryption | online |
2001 | eprint | Efficient Revocation of Anonymous Group Membership | online |
2001 | eprint | Efficient Algorithms for Computing Differential Properties of Addition | online |
2001 | eprint | Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups | online |
2001 | eprint | MinRank problem and Zero-knowledge authentication | online |
2001 | eprint | A Note on Cryptanalysis of the Preliminary Version of the NTRU Signature Scheme | online |
2001 | eprint | Secure and Efficient Asynchronous Broadcast Protocols | online |
2001 | eprint | Are 'Strong' Primes Needed for RSA | online |
2001 | eprint | Fully Distributed Threshold RSA under Standard Assumptions | online |
2001 | eprint | Robust key-evolving public key encryption schemes | online |
2001 | eprint | How to achieve a McEliece-based Digital Signature Scheme | online |
2001 | eprint | New Zero-knowledge Undeniable Signatures - Forgery of Signature Equivalent to Factorisation | online |
2001 | eprint | Ciphers with Arbitrary Finite Domains | online |
2001 | eprint | Digitally Watermarking RSA Moduli | online |
2001 | eprint | Timed-Release Cryptography | online |
2001 | eprint | An observation regarding Jutla's modes of operation | online |
2001 | eprint | Efficient Traitor Tracing Algorithms using List Decoding | online |
2001 | eprint | On adaptive vs. non-adaptive security of multiparty protocols | online |
2001 | eprint | Analysis of a Subset Sum Randomizer | online |
2001 | eprint | An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation | online |
2001 | eprint | Some observations on the theory of cryptographic hash functions | online |
2001 | eprint | The Rectangle Attack - Rectangling the Serpent | online |
2001 | eprint | Optimistic Asynchronous Atomic Broadcast | online |
2001 | eprint | Robustness for Free in Unconditional Multi-Party Computation | online |
2001 | eprint | Secure Multiparty Computation of Approximations | online |
2001 | eprint | Cryptanalysis of some elliptic curve based cryptosystems of Paillier | online |
2001 | eprint | OCB Mode | online |
2001 | eprint | A Block-Cipher Mode of Operation for Parallelizable Message Authentication | online |
2001 | eprint | Efficient Encryption for Rich Message Spaces Under General Assumptions | online |
2001 | eprint | On multivariate signature-only public key cryptosystems | online |
2001 | eprint | On the Power of Nonlinear Secret-Sharing | online |
2001 | eprint | Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords | online |
2001 | eprint | Efficient and Non-Interactive Non-Malleable Commitment | online |
2001 | eprint | Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs | online |
2001 | eprint | Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures | online |
2001 | eprint | Forward-Security in Private-Key Cryptography | online |
2001 | eprint | Anti-persistence: History Independent Data Structures | online |
2001 | eprint | EMpowering Side-Channel Attacks | online |
2001 | eprint | Flaws in differential cryptanalysis of Skipjack | online |
2001 | eprint | Robust Software Tokens: Towards Securing a Digital Identity | online |
2001 | eprint | Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels | online |
2001 | eprint | Solving Elliptic Curve Discrete Logarithm Problems Using Weil Descent | online |
2001 | eprint | Simple Forward-Secure Signatures From Any Signature Scheme | online |
2001 | eprint | Cryptanalysis of the Vesta-2M Stream Cipher | online |
2001 | eprint | Optimistic Asynchronous Multi-Party Contract Signing with Reduced Number of Rounds | online |
2001 | eprint | The order of encryption and authentication for protecting communications (Or: how secure is SSL?) | online |
2001 | eprint | The simple ideal cipher system | online |
2001 | eprint | ON THE METHOD OF "XL" AND ITS INEFFICIENCY TO TTM | online |
2001 | eprint | Forward-Secure Signatures with Optimal Signing and Verifying | online |
2001 | eprint | A known plaintext attack on the ISAAC keystream generator | online |
2001 | eprint | Elliptic curve Paillier schemes | online |
2001 | eprint | Black-Box Concurrent Zero-Knowledge Requires $\tilde\Omega(\log n)$ Rounds | online |
2001 | eprint | Differential Probability of Modular Addition with a Constant Operand | online |
2001 | eprint | Security Proofs for the RSA-PSS Signature Scheme and Its Variants | online |
2001 | eprint | Extending the GHS Weil Descent Attack | online |
2001 | eprint | Universally Composable Commitments | online |
2001 | eprint | On the Complexity of Matsui's Attack | online |
2001 | eprint | On the Security of the SPEKE Password-Authenticated Key Exchange Protocol | online |
2001 | eprint | Efficient Zero-knowledge Authentication Based on a Linear Algebra Problem MinRank | online |
2001 | eprint | Revocation and Tracing Schemes for Stateless Receivers | online |
2001 | eprint | The Security of Practical Two-Party RSA Signature Schemes | online |
2001 | eprint | Clock-Controlled Shift Registers for Key-Stream Generation | online |
2001 | eprint | Optimal security proofs for PSS and other signature schemes | online |
2001 | eprint | Resettably-Sound Zero-Knowledge and its Applications | online |
2001 | eprint | An Integer Commitment Scheme based on Groups with Hidden Order | online |
2001 | eprint | Analysis of chosen plaintext attacks on the WAKE Stream Cipher | online |
2001 | eprint | IMPROVED PUBLIC KEY CRYPTOSYSTEM USING FINITE NON ABELIAN GROUPS | online |
2001 | eprint | An Attack on A Traitor Tracing Scheme | online |
2001 | eprint | SQUARE Attacks on Reduced-Round PES and IDEA Block Ciphers | online |
2001 | eprint | On the (Im)possibility of Obfuscating Programs | online |
2001 | eprint | Security Assessment of Hierocrypt and Rijndael against the Differential and Linear Cryptanalysis (Extended Abstract) | online |
2001 | eprint | Multi-Recipient Public-Key Encryption with Shortened Ciphertext | online |
2001 | eprint | On the Goubin-Courtois Attack on TTM | online |
2001 | eprint | Efficient oblivious transfer schemes | online |
2001 | eprint | On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit - A New Construction | online |
2001 | eprint | Pseudo-Random Functions and Factoring | online |
2001 | eprint | Communication Complexity and Secure Function Evaluation | online |
2001 | eprint | A Time-Memory Tradeoff Attack Against LILI-128 | online |
2001 | eprint | The COS Stream Ciphers are Extremely Weak | online |
2001 | eprint | Authenticated Encryption in the Public-Key Setting: Security Notions and Analyses | online |
2001 | eprint | COS Ciphers are not "extremely weak"! - The Design Rationale of COS Ciphers | online |
2001 | eprint | A Sufficient Condition for Secure Ping--Pong Protocols | online |
2001 | eprint | A Description of Protocols for Private Credentials | online |
2001 | eprint | On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices | online |
2001 | eprint | Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree | online |
2001 | eprint | Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption | online |
2001 | eprint | Statistical Zero-Knowledge Proofs from Diophantine Equations | online |
2001 | eprint | A Linear Algebraic Approach to Metering Schemes | online |
2001 | eprint | Improving the trade-off between storage and communication in broadcast encryption schemes | online |
2001 | eprint | Linear broadcast encryption schemes | online |
2001 | eprint | Identity Based Encryption From the Weil Pairing | online |
2001 | eprint | Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor | online |
2001 | eprint | BDD-based Cryptanalysis of Keystream Generators | online |
2001 | eprint | Threshold Cryptosystems Based on Factoring | online |
2001 | eprint | Slope packings and coverings, and generic algorithms for the discrete logarithm problem | online |
2001 | eprint | Secure Vickrey Auctions without Threshold Trust | online |
2001 | eprint | Constructing elliptic curves with a given number of points over a finite field | online |
2001 | eprint | An Efficient MAC for Short Messages | online |
2001 | eprint | Fast hashing onto elliptic curves over fields of characteristic 3 | online |
2001 | eprint | Linear Code Implies Public-Key Traitor Tracing | online |
2001 | eprint | A Note on Girault's Self-Certified Model | online |
2001 | eprint | Quasi-Efficient Revocation of Group Signatures | online |
2001 | eprint | An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates | online |
2001 | eprint | Countermeasures against Side-Channel Attacks for Elliptic Curve Cryptosystems | online |
2001 | eprint | Concurrent Zero-Knowledge With Timing, Revisited | online |
2001 | eprint | Universal Arguments and their Applications | online |
2001 | eprint | Cryptanalysis of the COS (2,128) Stream Ciphers | online |
2001 | eprint | Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation | online |
2001 | eurocrypt | The Rectangle Attack - Rectangling the Serpent | online |
2001 | eurocrypt | On Perfect and Adaptive Security in Exposure-Resilient Cryptography | online |
2001 | eurocrypt | Efficient Amplification of the Security of Weak Pseudo-random Function Generators | online |
2001 | eurocrypt | Structural Cryptanalysis of SASAS | online |
2001 | eurocrypt | Identification Protocols Secure against Reset Attacks | online |
2001 | eurocrypt | Key Recovery and Message Attacks on NTRU-Composite | online |
2001 | eurocrypt | A Memory Efficient Version of Satoh's Algorithm | online |
2001 | eurocrypt | Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems | online |
2001 | eurocrypt | Zero Knowledge Has Come of Age | |
2001 | eurocrypt | Hyper-bent Functions | online |
2001 | eurocrypt | Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy | online |
2001 | eurocrypt | Min-round Resettable Zero-Knowledge in the Public-Key Model | online |
2001 | eurocrypt | An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation | online |
2001 | eurocrypt | Encryption Modes with Almost Free Message Integrity | online |
2001 | eurocrypt | Advances in Cryptology - EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6-10, 2001, Proceeding | online |
2001 | eurocrypt | On Adaptive vs. Non-adaptive Security of Multiparty Protocols | online |
2001 | eurocrypt | Cryptographic Counters and Applications to Electronic Voting | online |
2001 | eurocrypt | Multiparty Computation from Threshold Homomorphic Encryption | online |
2001 | eurocrypt | Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords | online |
2001 | eurocrypt | Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels | online |
2001 | eurocrypt | New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs | online |
2001 | eurocrypt | Lower Bounds for Multicast Message Authentication | online |
2001 | eurocrypt | How to Convert the Flavor of a Quantum Bit Commitment | online |
2001 | eurocrypt | NSS: An NTRU Lattice-Based Signature Scheme | online |
2001 | eurocrypt | Efficient and Non-interactive Non-malleable Commitment | online |
2001 | eurocrypt | The Bit Security of Paillier's Encryption Scheme and Its Applications | online |
2001 | eurocrypt | A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures | online |
2001 | eurocrypt | Practical Threshold RSA Signatures without a Trusted Dealer | online |
2001 | eurocrypt | Priced Oblivious Transfer: How to Sell Digital Goods | online |
2001 | eurocrypt | Does Encryption with Redundancy Provide Authenticity? | online |
2001 | eurocrypt | Cryptanalysis of Reduced-Round MISTY | online |
2001 | eurocrypt | Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference | online |
2001 | eurocrypt | Hash Functions: From Merkle-Damgård to Shoup | online |
2001 | eurocrypt | How Secure Are Elliptic Curves over Composite Extension Fields? | online |
2001 | fse | Round Security and Super-Pseudorandomness of MISTY Type Structure | 233-247 |
2001 | fse | Cryptanalysis of SBLH | 144-151 |
2001 | fse | Security of Camellia against Truncated Differential Cryptanalysis | 286-299 |
2001 | fse | Efficient Algorithms for Computing Differential Properties of Addition | 336-350 |
2001 | fse | The Saturation Attack - A Bait for Twofish | 1-15 |
2001 | fse | A Practical Attack on Broadcast RC4 | 152-164 |
2001 | fse | Fast Correlation Attack Algorithm with List Decoding and an Application | 196-210 |
2001 | fse | NESSIE: A European Approach to Evaluate Cryptographic Algorithms | 267-276 |
2001 | fse | Producing Collisions for PANAMA | 37-51 |
2001 | fse | Impossible Differential Cryptanalysis of Zodiac | 300-311 |
2001 | fse | Fast Software Encryption, 8th International Workshop, FSE 2001 Yokohama, Japan, April 2-4, 2001, Revised Papers | online |
2001 | fse | Incremental Unforgeable Encryption | 109-124 |
2001 | fse | Optimized Self-Synchronizing Mode of Operation | 78-91 |
2001 | fse | The Block Cipher SC2000 | 312-327 |
2001 | fse | Bias in the LEVIATHAN Stream Cipher | 211-218 |
2001 | fse | ZIP Attacks with Reduced Known Plaintext | 125-134 |
2001 | fse | New Constructions of Resilient Boolean Functions with Maximal Nonlinearity | 66-77 |
2001 | fse | Improved SQUARE Attacks against Reduced-Round HIEROCRYPT | 165-173 |
2001 | fse | The RIPEMD and RIPEMD Improved Variants of MD4 Are Not Collision Free | 52-65 |
2001 | fse | Linear Cryptanalysis of Reduced Round Serpent | 16-27 |
2001 | fse | Differential Cryptanalysis of Q | 174-186 |
2001 | fse | Cryptanalysis of the Mercy Block Cipher | 28-36 |
2001 | fse | Cryptanalysis of the SEAL 3.0 Pseudorandom Function Family | 135-143 |
2001 | fse | Differential Cryptanalysis of Nimbus | 187-195 |
2001 | fse | Analysis of SSC2 | 219-232 |
2001 | fse | New Results on the Pseudorandomness of Some Blockcipher Constructions | 248-266 |
2001 | fse | Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes | 92-108 |
2001 | fse | Related Key Attacks on Reduced Round KASUMI | 277-285 |
2001 | fse | Flaws in Differential Cryptanalysis of Skipjack | 328-335 |
2001 | jofc | Cryptanalysis of the Chor - Rivest Cryptosystem | 87-100 |
2001 | jofc | Dynamic Traitor Tracing | 211-223 |
2001 | jofc | Complexity Bounds on General Hard-Core Predicates | 177-195 |
2001 | jofc | On the Importance of Eliminating Errors in Cryptographic Computations | 101-119 |
2001 | jofc | Weakness in Quaternion Signatures | 77-85 |
2001 | jofc | Universal Service-Providers for Private Information Retrieval | 37-74 |
2001 | jofc | Attacks on Block Ciphers of Low Algebraic Degree | 197-210 |
2001 | jofc | How to Protect DES Against Exhaustive Key Search (an Analysis of DESX) | 17-35 |
2001 | jofc | On the Existence of Secure Keystream Generators | 1-15 |
2001 | jofc | Almost k-Wise Independent Sample Spaces and Their Cryptologic Applications | 231-253 |
2001 | jofc | Selecting Cryptographic Key Sizes | 255-293 |
2001 | jofc | Secure Communication in Multicast Channels: The Answer to Franklin and Wright's Question | 121-135 |
2001 | jofc | Public Key Cryptosystems Based on Drinfeld Modules Are Insecure | 225-230 |
2001 | jofc | Decomposing Attacks on Asymmetric Cryptography Based on Mapping Compositions | 137-150 |
2001 | jofc | Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography | 153-176 |
2001 | pkc | One Round Threshold Discrete-Log Key Generation without Private Channels | 300-316 |
2001 | pkc | Adaptive Security for the Additive-Sharing Based Proactive RSA | 240-263 |
2001 | pkc | Cryptoanalysis of Two Sparse Polynomial Based Public Key Cryptosystems | 153-164 |
2001 | pkc | Redundant Representation of Finite Fields | 339-352 |
2001 | pkc | Efficient Implementation of Elliptic Curve Cryptosystems on the TI MSP 430x33x Family of Microcontrollers | 365-382 |
2001 | pkc | Efficient Revocation in Group Signatures | 190-206 |
2001 | pkc | Secure Server-Aided Signature Generation | 383-401 |
2001 | pkc | Cryptanalysis of PKP: A New Approach | 165-172 |
2001 | pkc | Compact Encoding of Non-adjacent Forms with Applications to Elliptic Curve Cryptography | 353-364 |
2001 | pkc | A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System | 119-136 |
2001 | pkc | A New Aspect for Security Notions: Secure Randomness in Public-Key Encryption Schemes | 87-103 |
2001 | pkc | (title unknown) | |
2001 | pkc | Provably-Secure Public-Key Cryptosystems | |
2001 | pkc | Marking: A Privacy Protecting Approach Against Blackmailing | 137-152 |
2001 | pkc | (title unknown) | |
2001 | pkc | IND-CCA Public Key Schemes Equivalent to Factoring n=pq | 36-47 |
2001 | pkc | On the Security of Lenstra's Variant of DSA without Long Inversions | 64-72 |
2001 | pkc | Fast Irreducibility and Subgroup Membership Testing in XTR | 73-86 |
2001 | pkc | A Novel Systolic Architecture for Efficient RSA Implementation | 416-421 |
2001 | pkc | On the Security of Williams Based Public Key Encryption Scheme | 1-18 |
2001 | pkc | The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes | 104-118 |
2001 | pkc | Loopholes in Two Public Key Cryptosystems Using the Modular Group | 180-189 |
2001 | pkc | A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares | 207-224 |
2001 | pkc | Robust Forward-Secure Signature Schemes with Proactive Security | 264-276 |
2001 | pkc | Cryptanalysis of a Digital Signature Scheme on ID-Based Key-Sharing Infrastructures | 173-179 |
2001 | pkc | A PVSS as Hard as Discrete Log and Shareholder Separability | 287-299 |
2001 | pkc | New Key Recovery in WAKE Protocol | 325-338 |
2001 | pkc | Public Key Cryptography, 4th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2001, Cheju Island, Korea, February 13-15, 2001, Proceedings | online |
2001 | pkc | Identification, Signature and Signcryption Using High Order Residues Modulo an RSA Composite | 48-63 |
2001 | pkc | Semantically Secure McEliece Public-Key Cryptosystems-Conversions for McEliece PKC | 19-35 |
2001 | pkc | Efficient Asymmetric Self-Enforcement Scheme with Public Traceability | 225-239 |
2001 | pkc | Equitability in Retroactive Data Confiscation versus Proactive Key Escrow | 277-286 |
2001 | pkc | Remarks on Mix-Network Based on Permutation Networks | 317-324 |
2001 | pkc | Efficient Long-Term Validation of Digital Signatures | 402-415 |