Cryptology ePrint Archive: Report 2011/329
Available versions in chronological order
20110622:200705 (posted 22-Jun-2011 20:07:05 UTC)
Hardness of Computing Individual Bits for Pairing-based One-way Functions
Alexandre Duc and Dimitar Jetchev
20120521:092451 (posted 21-May-2012 09:24:51 UTC)
Hardness of Computing Individual Bits for One-way Functions on Elliptic Curves
Alexandre Duc and Dimitar Jetchev
Publication Info: CRYPTO 2012 paper full version
[
Cryptology ePrint archive
]