Cryptology ePrint Archive2009-07-04T13:31:01Zhttp://eprint.iacr.org/rss/atom.xmlKevin McCurleyNone of your businessAll rights reserved by authors<![CDATA[Factoring Unbalanced Moduli with Known Bits]]>2009-07-01T05:00:16Zhttp://eprint.iacr.org/2009/323 q^3$ be an RSA modulus. This note describes a LLL-based method allowing to factor $n$ given $2log_2q$ contiguous bits of $p$, irrespective to their position. A second method is presented, which needs fewer bits but whose length depends on the position of the known bit pattern. Finally, we introduce a somewhat surprising ad hoc method where two different known bit chunks, totalling $\frac32 log_2 q$ bits suffice to factor $n$.
]]>Copyright held by author<![CDATA[Certifying Assembly with Formal Cryptographic Proofs: the Case of BBS]]>2009-07-01T04:14:18Zhttp://eprint.iacr.org/2009/322Copyright held by author<![CDATA[Tweakable Enciphering Schemes From Stream Ciphers With IV]]>2009-07-01T04:12:08Zhttp://eprint.iacr.org/2009/321Copyright held by author<![CDATA[Automorphic Signatures in Bilinear Groups]]>2009-07-01T04:11:47Zhttp://eprint.iacr.org/2009/320Copyright held by author<![CDATA[Comments and Improvements on Chameleon Hashing Without Key Exposure Based on Factoring]]>2009-07-01T04:10:39Zhttp://eprint.iacr.org/2009/319Copyright held by author<![CDATA[The Fermat factorization method revisited]]>2009-07-01T04:08:53Zhttp://eprint.iacr.org/2009/3180$ is a RSA modulus with primes $p$ and $q$ supposed of equal length.
This equation is a bivariate integer polynomial equation and we propose to solve it directly using Coppersmith's method for bivariate integer polynomials. As we use them as a black box, our proofs will be brief.
We show a first result : we can factor $N$ in a polynomial time if $|p-q|Copyright held by author<![CDATA[Related-key Cryptanalysis of the Full AES-192 and AES-256]]>2009-07-01T04:07:20Zhttp://eprint.iacr.org/2009/317Copyright held by author<![CDATA[An Efficient Password Security of Three-Party Key exchange Protocol based on ECDLP]]>2009-07-01T04:06:26Zhttp://eprint.iacr.org/2009/316Copyright held by author<![CDATA[Breaking RSA-based PIN Encryption with thirty ciphertext validity queries]]>2009-07-01T04:02:50Zhttp://eprint.iacr.org/2009/315Copyright held by author<![CDATA[Secure Two-Party Computation is Practical]]>2009-07-01T04:01:37Zhttp://eprint.iacr.org/2009/314Copyright held by author<![CDATA[Identity Based Group Signatures from Hierarchical Identity-Based Encryption]]>2009-07-01T09:22:44Zhttp://eprint.iacr.org/2009/313Copyright held by author<![CDATA[Jacobi Quartic Curves Revisited]]>2009-07-02T14:33:25Zhttp://eprint.iacr.org/2009/312Copyright held by author<![CDATA[Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security]]>2009-07-01T03:57:19Zhttp://eprint.iacr.org/2009/311Copyright held by author<![CDATA[RFID distance bounding protocol with mixed challenges to prevent relay attacks]]>2009-07-01T03:55:53Zhttp://eprint.iacr.org/2009/310Copyright held by author<![CDATA[Fault Attacks on RSA Signatures with Partially Unknown Messages]]>2009-07-01T03:55:24Zhttp://eprint.iacr.org/2009/309Copyright held by author<![CDATA[A note on the Certificateless Multi-receiver Signcryption Scheme]]>2009-07-01T03:55:08Zhttp://eprint.iacr.org/2009/308Copyright held by author<![CDATA[Anonymous Signatures Revisited]]>2009-07-01T03:53:25Zhttp://eprint.iacr.org/2009/307Copyright held by author<![CDATA[Authentic Time-Stamps for Archival Storage]]>2009-07-01T03:52:43Zhttp://eprint.iacr.org/2009/306Copyright held by author<![CDATA[Improved generic algorithms for 3-collisions]]>2009-06-24T01:20:15Zhttp://eprint.iacr.org/2009/305Copyright held by author<![CDATA[Factor-4 and 6 Compression of Cyclotomic Subgroups]]>2009-06-24T08:37:34Zhttp://eprint.iacr.org/2009/304Copyright held by author<![CDATA[Key extraction from general non-discrete signals]]>2009-06-24T01:16:30Zhttp://eprint.iacr.org/2009/303Copyright held by author<![CDATA[Cryptanalysis of ESSENCE]]>2009-06-29T07:04:07Zhttp://eprint.iacr.org/2009/302Copyright held by author<![CDATA[A Probabilistic Secret Sharing Scheme for a Compartmented Access Structure]]>2009-06-24T01:15:05Zhttp://eprint.iacr.org/2009/301Copyright held by author<![CDATA[Universally Composable Contributory Group Key Exchange]]>2009-06-24T01:14:36Zhttp://eprint.iacr.org/2009/300Copyright held by author<![CDATA[On the security of oscillator-based random number generators]]>2009-06-24T01:13:08Zhttp://eprint.iacr.org/2009/299Copyright held by author<![CDATA[On the Security of Certificateless Signcryption Schemes]]>2009-06-27T00:14:00Zhttp://eprint.iacr.org/2009/298Copyright held by author<![CDATA[A New Improved Distinguisher for HC-128]]>2009-06-24T05:24:18Zhttp://eprint.iacr.org/2009/297Copyright held by author<![CDATA[Perfectly Balanced Functions in Symbolic Dynamics]]>2009-06-24T01:01:05Zhttp://eprint.iacr.org/2009/296Copyright held by author<![CDATA[Defending Against Key Abuse Attacks in KP-ABE Enabled Broadcast Systems]]>2009-07-01T09:49:01Zhttp://eprint.iacr.org/2009/295Copyright held by author<![CDATA[Low Latency High Bandwidth Anonymous Overlay Network with Anonymous Routing]]>2009-06-24T00:59:25Zhttp://eprint.iacr.org/2009/294Copyright held by author<![CDATA[Enhancing Attribute-based Encryption with Attribute Hierarchy]]>2009-06-24T00:58:22Zhttp://eprint.iacr.org/2009/293Copyright held by author<![CDATA[Implementing Wagner's generalized birthday attack against the SHA-3 candidate FSB ]]>2009-06-17T09:13:53Zhttp://eprint.iacr.org/2009/292Copyright held by author<![CDATA[Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols]]>2009-06-17T09:11:26Zhttp://eprint.iacr.org/2009/291Copyright held by author<![CDATA[Security Analysis of Aggregate signature and Batch verification signature schemes]]>2009-06-18T18:12:27Zhttp://eprint.iacr.org/2009/290Copyright held by author<![CDATA[Analysis of the End-by-Hop Protocol for Secure Aggregation in Sensor Networks]]>2009-06-17T09:10:29Zhttp://eprint.iacr.org/2009/289Copyright held by author<![CDATA[Efficient Key Exchange with Tight Security Reduction]]>2009-06-16T14:19:00Zhttp://eprint.iacr.org/2009/288Copyright held by author<![CDATA[Generic Attacks on Alternating Unbalanced Feistel Schemes]]>2009-06-16T14:18:18Zhttp://eprint.iacr.org/2009/287Copyright held by author<![CDATA[On Privacy Losses in the Trusted Agent Model (Abstract)]]>2009-06-16T14:17:25Zhttp://eprint.iacr.org/2009/286Copyright held by author<![CDATA[Efficient Public Key Encryption Based on Ideal Lattices]]>2009-06-16T14:17:07Zhttp://eprint.iacr.org/2009/285Copyright held by author<![CDATA[Privacy-aware Attribute-based Encryption with User Accountability]]>2009-06-16T14:16:43Zhttp://eprint.iacr.org/2009/284Copyright held by author<![CDATA[Short and Stateless Signatures from the RSA Assumption]]>2009-06-16T15:02:13Zhttp://eprint.iacr.org/2009/283Copyright held by author<![CDATA[Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing]]>2009-06-16T19:41:28Zhttp://eprint.iacr.org/2009/281Copyright held by author<![CDATA[Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves]]>2009-06-16T20:33:53Zhttp://eprint.iacr.org/2009/276Copyright held by author<![CDATA[Formally and Practically Relating the CK, CK-HMQV, and eCK Security Models for Authenticated Key Exchange]]>2009-06-25T02:59:17Zhttp://eprint.iacr.org/2009/253Copyright held by author<![CDATA[Cryptanalysis of the MST_3 Public Key Cryptosystem]]>2009-06-16T09:14:06Zhttp://eprint.iacr.org/2009/248Copyright held by author<![CDATA[The Security of Abreast-DM in the Ideal Cipher Model]]>2009-06-16T05:45:13Zhttp://eprint.iacr.org/2009/225Copyright held by author<![CDATA[PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware]]>2009-06-24T03:21:37Zhttp://eprint.iacr.org/2009/222Copyright held by author<![CDATA[PUBLIC KEY CRYPTOGRAPHY USING PERMUTATION P-POLYNOMIALS OVER FINITE FIELDS]]>2009-06-24T02:45:47Zhttp://eprint.iacr.org/2009/208Copyright held by author<![CDATA[Secure Evaluation of Private Linear Branching Programs with Medical Applications]]>2009-06-29T06:14:37Zhttp://eprint.iacr.org/2009/195Copyright held by author<![CDATA[I shall love you up to the death]]>2009-06-15T09:33:08Zhttp://eprint.iacr.org/2009/166Copyright held by author<![CDATA[CCA-Secure Proxy Re-Encryption without Pairings]]>2009-06-29T09:15:49Zhttp://eprint.iacr.org/2009/164Copyright held by author<![CDATA[Transferable Anonymous Constant-Size Fair E-Cash]]>2009-06-18T08:43:29Zhttp://eprint.iacr.org/2009/146Copyright held by author<![CDATA[Faster and Timing-Attack Resistant AES-GCM]]>2009-06-16T07:09:11Zhttp://eprint.iacr.org/2009/129Copyright held by author<![CDATA[Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers]]>2009-06-15T18:09:11Zhttp://eprint.iacr.org/2009/122Copyright held by author<![CDATA[Deterministic Polynomial-Time Equivalence of Computing the CRT-RSA Secret Keys and Factoring]]>2009-06-29T07:05:40Zhttp://eprint.iacr.org/2009/062Copyright held by author<![CDATA[Extensions of the Cube Attack based on Low Degree Annihilators]]>2009-06-19T00:42:34Zhttp://eprint.iacr.org/2009/049Copyright held by author<![CDATA[Realizing Hash-and-Sign Signatures under Standard Assumptions]]>2009-06-14T12:48:53Zhttp://eprint.iacr.org/2009/028Copyright held by author<![CDATA[Collision Attacks on NaSHA-384/512]]>2009-06-16T02:03:48Zhttp://eprint.iacr.org/2009/026Copyright held by author<![CDATA[Generating Shorter Bases for Hard Random Lattices]]>2009-06-26T16:41:36Zhttp://eprint.iacr.org/2008/521Copyright held by author<![CDATA[Efficient Rational Secret Sharing in Standard Communication Networks]]>2009-06-30T07:38:59Zhttp://eprint.iacr.org/2008/488Copyright held by author<![CDATA[Simple and Efficient Asynchronous Byzantine Agreement with Optimal Resilience]]>2009-06-29T07:47:05Zhttp://eprint.iacr.org/2008/424Copyright held by author<![CDATA[FPGA and ASIC Implementations of the $\eta_T$ Pairing in Characteristic Three]]>2009-06-17T01:26:22Zhttp://eprint.iacr.org/2008/280Copyright held by author<![CDATA[On the Design of Secure and Fast Double Block Length Hash Functions]]>2009-06-18T00:22:08Zhttp://eprint.iacr.org/2008/110Copyright held by author<![CDATA[Efficient Computationally Private Information Retrieval From Anonymity or Trapdoor Groups]]>2009-06-30T14:49:23Zhttp://eprint.iacr.org/2007/392Copyright held by author<![CDATA[Secure multi-party computation on incomplete networks]]>2009-06-23T04:40:35Zhttp://eprint.iacr.org/2007/346Copyright held by author<![CDATA[Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS]]>2009-06-21T22:56:33Zhttp://eprint.iacr.org/2007/123Copyright held by author<![CDATA[On Secret Sharing Schemes, Matroids and Polymatroids]]>2009-06-30T11:51:53Zhttp://eprint.iacr.org/2006/077Copyright held by author