A NEW METHOD FOR CONSTRUCTING DIGITAL SIGNATURE SCHEMES BASED ON THE DIFFICULTY OF THE INTEGER FACTORIZATION AND DISCRETE LOGARITHM – ROOT PROBLEMS ON THE Z_n

Dung, Luu Hong; Duc, Tong Minh; Van, Luu Xuan

doi:10.15625/vap.2018.0001

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

2022

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors of the papers [12][13][14] outlined a new digital signature scheme based on two difficult problems. In 2018, the authors of the papers [15][16][17] developed and presented new digital signature techniques based on the IFP and DLRP over Z n . In 2020, Xuan et al [18] proposed a new digital signature scheme based on the difficulty of solving expanded root problems over Z p .…”

Section: Introductionmentioning

confidence: 99%

A Modified Wei-Hua-He Digital Signature Scheme Based on Factoring and Discrete Logarithm

Elumalai

Anjaneyulu²

2022

Symmetry

View full text Add to dashboard Cite

A symmetric cipher such as AES in cryptography is much faster than an asymmetric cipher but digital signatures often use asymmetric key ciphers because they provides the sender’s identity and data integrity. In this paper, a modified-He digital signature scheme is proposed using a one-way hash function. The proposed scheme, unlike the He signature technique, employs Euclid’s Division Lemma with large prime moduli p. Its security is built on large integer factoring, discrete logarithms and expanded root problems. The time complexity of the proposed scheme is O(log3p). The proposed modified-He scheme is efficient, as evidenced by the analytical results with key lengths greater than 512 bits.

show abstract

Section: Introductionmentioning

confidence: 99%