Pages that link to "Item:Q2456564"

The following pages link to Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers (Q2456564):

Displaying 7 items.

• Identity based signature scheme based on cubic residues (Q350965) (← links)
• Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings (Q1015166) (← links)
• A refinement of Müller's cube root algorithm (Q1994923) (← links)
• New number-theoretic cryptographic primitives (Q2023304) (← links)
• The eleventh power residue symbol (Q2027273) (← links)
• New cube root algorithm based on the third order linear recurrence relations in finite fields (Q2345923) (← links)
• (Q5118842) (← links)