The following pages link to (Q2724583):
Displaying 5 items.
- A correspondence of certain irreducible polynomials over finite fields (Q765810) (← links)
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems (Q1772226) (← links)
- GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS (Q5041827) (← links)
- XTR Algorithm: Efficient and Compact Subgroup Trace Representation (Q5050169) (← links)
- Selected Areas in Cryptography (Q5491745) (← links)