A new generic digital signature algorithm

DOI10.1515/GCC.2011.008MaRDI QIDQ2884686zbMATH OpenOpenAlexFDO

Authors Vinhbuu To, Dongvu Tonien, Jennifer Seberry

Publication date 18 May 2012

Published in Groups, Complexity, Cryptology (Search for Journal in Brave)

Full work available at URL https://ro.uow.edu.au/cgi/viewcontent.cgi?article=2285&context=infopapers

zbMATH Keywords

digital signature algorithmsdiscrete logarithm problemgroup of circulant matrices

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1088905
• The insecurity of the digital signature algorithm with partially known nonces
• The Security of DSA and ECDSA
• scientific article; zbMATH DE number 2080697
• On the security of the digital signature algorithm

Cites work

• The discrete logarithm problem in the group of non-singular circulant matrices

Cited in

(3)

• A new computation method for signature: Markov process method
• Extended DSA
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: A new generic digital signature algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884686)