30 search results - page 3 / 6 » Fast Cryptography in Genus 2 |
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
In a wireless network composed of multiple access points, a long delay during roaming from one access point to another may cause a disruption for streaming traffic. Roaming in wire...
ARITH
1993
IEEE
14 years 1 months ago
1993
IEEE
We detail and analyse the critical techniques which may be combined in the design of fast hardware for RSA cryptography: chinese remainders, star chains, Hensel's odd divisio...
CHES
2003
Springer
14 years 2 months ago
2003
Springer
For most of the time since they were proposed, it was widely believed that hyperelliptic curve cryptosystems (HECC) carry a substantial performance penalty compared to elliptic cur...
PAIRING
2009
Springer
14 years 4 months ago
2009
Springer
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
ASAP
2004
IEEE
14 years 1 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...