Pages that link to "Item:Q1862440"
From MaRDI portal
The following pages link to A signature scheme based on the intractability of computing roots (Q1862440):
Displaying 13 items.
- New designing of cryptosystems based on quadratic fields (Q954438) (← links)
- Which new RSA-signatures can be computed from certain given RSA- signatures! (Q1184507) (← links)
- Bandwidth-efficient threshold EC-DSA (Q2055695) (← links)
- A signature scheme from the finite field isomorphism problem (Q2191202) (← links)
- Subexponential time relations in the class group of large degree number fields (Q2513760) (← links)
- Succinct Diophantine-satisfiability arguments (Q2691605) (← links)
- First-hit analysis of algorithms for computing quadratic irregularity (Q4452171) (← links)
- Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом (Q4958988) (← links)
- Simple verifiable delay functions (Q5090439) (← links)
- On ideal class group computation of imaginary multiquadratic fields (Q5871436) (← links)
- Efficient verifiable delay functions (Q5919019) (← links)
- Cryptography based on number fields with large regulator (Q5939711) (← links)
- On time-lock cryptographic assumptions in abelian hidden-order groups (Q6157523) (← links)