Showing papers by "Sedat Akleylek published in 2011"
Journal Article•
TL;DR: The implementation and comparison results of the proposed signature scheme with the signature scheme proposed by Boneh, Lynn, Shacham and Zhang, Safavi, Susilo are given.
Abstract: In this paper, we propose a new and efficient short signature scheme from the bilinear pairings. Our scheme is constructed by bilinear inverse-square Diffie-Hellman problem (BISDHP) and does not require any special hash function. The exact security proofs are also explained in the random Oracle model. We give the implementation and comparison results of our proposed signature scheme with the signature scheme proposed by Boneh, Lynn, Shacham (BLS) and Zhang, Safavi, Susilo (ZSS). Furthermore, we use this signature scheme to construct a ring signature scheme. Keywords—bilinear Diffie-Hellman problem, bilinear pairings, ring signature, short signature.
3 citations
01 Jan 2011
TL;DR: This paper gives faster versions of Montgomery modular multiplication algorithm without pre-computational phase for GF(p) and GF(2 m ) which can be considered as a generalization of [3], [4] and [5].
Abstract: In this paper, we give faster versions of Montgomery modular multiplication algorithm without pre-computational phase for GF(p) and GF(2 m ) which can be considered as a generalization of [3], [4] and [5]. We propose sets of moduli different than [3], [4] and [5] which can be used in PKC applications. We show that one can obtain efficient Montgomery modular multiplication architecture in view of the number of AND gates and XOR gates by choosing proposed sets of moduli. We eliminate precomputational phase with proposed sets of moduli. These methods are easy to implement for hardware.
1 citations