The following pages link to (Q4343422):
Displaying 10 items.
- On the reducibility of some composite polynomials over finite fields (Q438878) (← links)
- Provably secure and efficient identification and key agreement protocol with user anonymity (Q716313) (← links)
- Efficient software-implementation of finite fields with applications to cryptography (Q850780) (← links)
- Rings of low multiplicative complexity (Q1570228) (← links)
- Efficient key-dependent dynamic S-boxes based on permutated elliptic curves (Q2127099) (← links)
- Reusing nonces in Schnorr signatures (and keeping it secure...) (Q2167718) (← links)
- Fast Elliptic-Curve Cryptography on the Cell Broadband Engine (Q3637151) (← links)
- Irreducible trinomials over finite fields (Q4417173) (← links)
- Monkey: Black-Box Symmetric Ciphers Designed for MONopolizing KEYs (Q4639445) (← links)
- Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem (Q4813622) (← links)
