Publication:4343422
From MaRDI portal
zbMath0868.94024MaRDI QIDQ4343422
Oliver Spatscheck, Richard Schroeppel, Sean O'Malley, Hilarie K. Orman
Publication date: 6 July 1997
finite fieldselliptic curveimplementationcryptographic protocolsDiffie-Hellman key exchange algorithm
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves over global fields (11G05)
Related Items
Efficient software-implementation of finite fields with applications to cryptography, Reusing nonces in Schnorr signatures (and keeping it secure...), On the reducibility of some composite polynomials over finite fields, Monkey: Black-Box Symmetric Ciphers Designed for MONopolizing KEYs, Irreducible trinomials over finite fields, Provably secure and efficient identification and key agreement protocol with user anonymity, Rings of low multiplicative complexity