Sciweavers

SODA
2012
ACM
240views Algorithms» more  SODA 2012»
12 years 1 months ago
Constructing high order elements through subspace polynomials
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
Qi Cheng, Shuhong Gao, Daqing Wan
JOC
2000
181views more  JOC 2000»
13 years 11 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern
JOC
2000
100views more  JOC 2000»
13 years 11 months ago
Computing Discrete Logarithms in Quadratic Orders
We present efficient algorithms for computing discrete logarithms in the classgroupofaquadraticorderandforprincipalitytestinginarealquadraticorder,based on the work of D
Michael J. Jacobson Jr.
IJNSEC
2007
131views more  IJNSEC 2007»
13 years 11 months ago
On the Security of Huang-Chang Multi-signature Schemes
Recently, based on RSA and discrete logarithm with composite modulus, Huang and Chang proposed two multisignature schemes with distinguished signing authority and claimed that the...
Jianhong Zhang, Wei Zou
JOC
2006
116views more  JOC 2006»
13 years 11 months ago
On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
Marc Girault, Guillaume Poupard, Jacques Stern
CSJM
2006
114views more  CSJM 2006»
13 years 11 months ago
Cryptoschemes Based on New Signature Formation Mechanism
Several variants of new digital signature schemes (DSS) based on the discrete logarithm and factorization problems have been proposed. Considered DSS are characterized in that a n...
Alexander A. Moldovyan, Dmitriy N. Moldovyan, L. V...
PKC
2000
Springer
166views Cryptology» more  PKC 2000»
14 years 3 months ago
Design Validations for Discrete Logarithm Based Signature Schemes
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
Ernest F. Brickell, David Pointcheval, Serge Vaude...
AINA
2003
IEEE
14 years 3 months ago
Signature Schemes Based on Two Hard Problems Simultaneously
In 1994, Harn proposed a signature scheme based on the modified ElGamal's scheme and claimed that the security relies on both of the factorization and the discrete logarithm....
Ching-Te Wang, Chu-Hsing Lin, Chin-Chen Chang
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
14 years 3 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith
ANTS
2006
Springer
125views Algorithms» more  ANTS 2006»
14 years 3 months ago
Arithmetic of Generalized Jacobians
This paper aims at introducing generalized Jacobians as a new candidate for discrete logarithm (DL) based cryptography. The motivation for this work came from the observation that ...
Isabelle Déchène