362 search results - page 57 / 73 » Abstraction in Cryptography |
CHES
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
CHES
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to ...
EUROCRYPT
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. In this paper, we study the security of the Encrypt-MaskDecrypt mode of operation, also called EMD, which was recently proposed for applications such as disk-sector encry...
EUROCRYPT
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. Recently, methods from provable security, that had been developped for the last twenty years within the research community, have been extensively used to support emerging...
ACNS
2010
Springer
14 years 9 days ago
2010
Springer
Abstract. In 2008, Groth and Sahai proposed a general methodology for constructing non-interactive zeroknowledge (and witness-indistinguishable) proofs in bilinear groups. While av...