A course in computational algebraic number theory
A course in computational algebraic number theory
Efficient algorithms for computing the Jacobi symbol
Journal of Symbolic Computation
(1+i)-ary GCD computation in Z[i] as an analogue to the binary GCD algorithm
Journal of Symbolic Computation
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Asymptotically Fast GCD Computation in Z[i]
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
RSA-Based Undeniable Signatures
Journal of Cryptology
A generic construction for universally-convertible undeniable signatures
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Short 2-move undeniable signatures
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Provably secure pairing-based convertible undeniable signature with short signature length
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
| Hi-index | 0.00 |
This article presents optimization results on the MOVA undeniable signature scheme presented last year by Monnerat and Vaudenay at PKC ’04 as well as its generalization proposed at Asiacrypt ’04 which is based on a secret group homomorphism. The original MOVA scheme uses characters on ${\bf Z}^{*}_{n}$and some additional candidate homomorphisms were proposed with its generalization. We give an overview of the expected performance of the MOVA scheme depending on the group homomorphism. Our optimizations focus on the quartic residue symbol and a homomorphism based on the computation of a discrete logarithm in a hidden subgroup of ${\bf Z}^{*}_{n}$. We demonstrate that the latter provides a signature generation which is three times faster than RSA.