Pages that link to "Item:Q1894275"
From MaRDI portal
The following pages link to A public-key cryptosystem utilizing cyclotomic fields (Q1894275):
Displaying 15 items.
- A public-key cryptosystem using purely cubic fields (Q1126891) (← links)
- Breaking a class of public-key cryptosystems with Euclid's algorithm (Q1179345) (← links)
- New number-theoretic cryptographic primitives (Q2023304) (← links)
- The eleventh power residue symbol (Q2027273) (← links)
- Extended Galbraith's test on the anonymity of IBE schemes from higher residuosity (Q2227124) (← links)
- Efficient cryptosystems from \(2^k\)-th power residue symbols (Q2397448) (← links)
- Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers (Q2456564) (← links)
- Cryptoanalysis of cryptosystems based on the quadratic residue problem (Q2753619) (← links)
- AN EFFICIENT SEVENTH POWER RESIDUE SYMBOL ALGORITHM (Q3074576) (← links)
- (Q3560891) (← links)
- (Q3605903) (← links)
- Some Public-Key Crypto-Functions as Intractable as Factorization (Q3739049) (← links)
- PUBLIC KEY CRYPTOSYSTEM USING A RECIPROCAL NUMBER WITH THE SAME INTRACTABILITY AS FACTORING A LARGE NUMBER (Q3801472) (← links)
- A type of public cryptosystem using polynomials and pell sequences (Q5059504) (← links)
- Public key cryptography based on Moufang loops (Q5059580) (← links)
