A signature scheme based on the intractability of computing roots

DOI10.1023/A:1014927327846zbMath1024.94009MaRDI QIDQ1862440

Ingrid Biehl, Safuat Hamdy, Andreas Meyer, Johannes A. Buchmann

Publication date: 19 March 2003

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

class groupssignature schemesDSAroot problemRDSA

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Class numbers, class groups, discriminants (11R29) Authentication, digital signatures and secret sharing (94A62)

Related Items

On time-lock cryptographic assumptions in abelian hidden-order groups, Succinct Diophantine-satisfiability arguments, New designing of cryptosystems based on quadratic fields, Cryptography based on number fields with large regulator, Subexponential time relations in the class group of large degree number fields, Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом, Efficient verifiable delay functions, First-hit analysis of algorithms for computing quadratic irregularity, Bandwidth-efficient threshold EC-DSA, Simple verifiable delay functions, On ideal class group computation of imaginary multiquadratic fields