• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 7 of 7

1 Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate a Rogue CA Certificate

by Marc Stevens, Er Sotirov, Arjen Lenstra, David Molnar, Dag Arne, Benne De Weger
"... MD5 short overview MD5 Collision history 2004 – Identical-prefix collision attack [Wang,Yu] ..."
Abstract - Add to MetaCart
MD5 short overview MD5 Collision history 2004 – Identical-prefix collision attack [Wang,Yu]

Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate.

by M M J Stevens , Appelbaum A Sotirov , J R Lenstra , A K Molnar , Osvik D , D A , de, B. M & M Weger , Marc Stevens , Alexander Sotirov , Jacob Appelbaum , Arjen Lenstra , David Molnar , Dag Arne Osvik , Benne De Weger - In Proc. of CRYPTO, , 2009
"... Abstract. We present a refined chosen-prefix collision construction for MD5 that allowed creation of a rogue Certification Authority (CA) certificate, based on a collision with a regular end-user website certificate provided by a commercial CA. Compared to the previous construction from Eurocrypt 2 ..."
Abstract - Cited by 38 (7 self) - Add to MetaCart
Abstract. We present a refined chosen-prefix collision construction for MD5 that allowed creation of a rogue Certification Authority (CA) certificate, based on a collision with a regular end-user website certificate provided by a commercial CA. Compared to the previous construction from Eurocrypt

Chosen-prefix Collisions for MD5 and Applications

by Marc Stevens, Arjen Lenstra, Benne de Weger , 2009
"... We present a novel, automated way to find differential paths for MD5. As an application we have shown how, at an approximate expected cost of 2 39 calls to the MD5 compression function, for any two chosen message prefixes P and P ′ , suffixes S and S ′ can be constructed such that the concatenated ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
values P ‖S and P ′ ‖S ′ collide under MD5. The practical attack potential of this construction of chosen-prefix collisions is of greater concern than the MD5-collisions that were published before. This is illustrated by a pair of MD5-based X.509 certificates one of which was signed by a commercial

MD5 CHOSEN-PREFIX COLLISIONS ON GPUS BLACK HAT USA 2009

by Marc Bevand , 2009
"... In December 2008, an MD5 chosen-prefix collision attack was performed on a cluster of 215 PlayStation 3 consoles to create a rogue CA certificate. A new implementation of this attack has been researched and developped to run an order of magnitude faster and more efficiently on video card GPUs. This ..."
Abstract - Add to MetaCart
In December 2008, an MD5 chosen-prefix collision attack was performed on a cluster of 215 PlayStation 3 consoles to create a rogue CA certificate. A new implementation of this attack has been researched and developped to run an order of magnitude faster and more efficiently on video card GPUs

Chosen prefix collisions for MD5 . . .

by Marc Stevens, Arjen K. Lenstra, Benne de Weger , 2012
"... We present a novel, automated way to find differential paths for MD5. Its main application is in the construction of chosen-prefix collisions. We have shown how, at an approximate expected cost of 239 calls to the MD5 compression function, for any two chosen message prefixes P and P', suffixes ..."
Abstract - Add to MetaCart
We present a novel, automated way to find differential paths for MD5. Its main application is in the construction of chosen-prefix collisions. We have shown how, at an approximate expected cost of 239 calls to the MD5 compression function, for any two chosen message prefixes P and P

Towards Secure Electronic Workflows Examples of Applied PKI Supervisor:

by Sebastian Fritsch, Dipl Ing, Vangelis Karatsiolis Erklärung , 2006
"... Hiermit versichere ich, die vorliegende Diplomarbeit selbstständig und unter ausschliesslicher Verwendung der angegebenen Quellen und Hilfsmittel angefertigt zu haben. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbehörde vorgelegen. Darmstadt, 14. Februar 2006 ..."
Abstract - Add to MetaCart
Hiermit versichere ich, die vorliegende Diplomarbeit selbstständig und unter ausschliesslicher Verwendung der angegebenen Quellen und Hilfsmittel angefertigt zu haben. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbehörde vorgelegen. Darmstadt, 14. Februar 2006

doi:10.1093/comjnl/bxp026 A Digest and Pattern Matching-Based Intrusion Detection Engine

by Zhongqiang Chen, Yuan Zhang, Zhongrong Chen, Alex Delis , 2008
"... Intrusion detection/prevention systems (IDSs/IPSs) heavily rely on signature databases and pattern matching (PM) techniques to identify network attacks. The engines of such systems often employ traditional PM algorithms to search for telltale patterns in network flows. The observations that real-wor ..."
Abstract - Add to MetaCart
digests or fingerprints for attack signatures during its programming phase. In its querying phase, the framework quickly identifies attack-free connections by transforming input traffic into its fingerprint space and matching its digest against those of attack signatures. If the legitimacy of a stream
Results 1 - 7 of 7
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University