LACAL
Design and analysis of algorithms used in cryptographic protocols or security assessments. We carried out a sanity check of public key material on the web. Some of the findings were discussed here. Three of our record calculations are linked to under slashdot. The latest is a 73-digit factor found using the elliptic curve method. Chosen-prefix Collisions for MD5 and Applications describes the cons
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
処ç†ã‚’実行ä¸ã§ã™
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Cryptology ePrint Archive: Report 2009/480 - S. Chatterjee, A. Menezes "On Cryptographic Protocols Employing Asymmetric Pairings -- The Role of $\Psi$ Revisited"
112-bit EC discrete logarithm problem solved
Cryptology ePrint Archive 2009/058 - Takakazu Satoh "On Generalization of Cheon's Algorithm"
SpringerLink - ICALP2006 - P.-A. Fouque, D. Pointcheval, J. Stern, and S. Zimmer "Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes"
Cryptology ePrint Archive 2008/200 - J. Wu, D. R. Stinson "On The Security of The ElGamal Encryption Scheme and Damgard’s Variant"
Cryptology ePrint Archive 2007/442 - N. Koblitz, A. Menezes "Another Look at Non-Standard Discrete Log and Diffie-Hellman Problems"
{{#tags}}- {{label}}
{{/tags}}