all InfoSec news
Trustless unknown-order groups. (arXiv:2211.16128v1 [cs.CR])
Nov. 30, 2022, 2:10 a.m. | Samuel Dobson, Steven Galbraith, Benjamin Smith (GRACE)
cs.CR updates on arXiv.org arxiv.org
Groups of unknown order are of major interest due to their applications
including time-lock puzzles, verifiable delay functions, and accumulators. In
this paper we focus on trustless setup: in this setting, the most popular
unknown-order group construction is ideal class groups of imaginary quadratic
fields.We argue that the full impact of Sutherland's generic group-order
algorithm has not been recognised in this context, and show that group sizes
currently being proposed in practice (namely, approximately 830 bits) do not
meet the …
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
Cybersecurity Skills Challenge -- Sponsored by DoD
@ Correlation One | United States
Security Operations Center (SOC) Analyst
@ GK Cybersecurity Group | Remote
Azure Security Architect
@ First Quality | Remote US - Eastern or Central Timezone
Senior Security Engineer
@ LRQA | Birmingham, GB, B37 7ES
Product Security Intern
@ Sinch | Chicago, Illinois, United States
Cyber Support Engineer
@ Darktrace | New York