555 search results - page 23 / 111 » From ABZ to Cryptography |
CHES
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
FDTC
2006
Springer
14 years 1 months ago
2006
Springer
We present a new approach to fault tolerant public key cryptography based on redundant arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring ...
EUROCRYPT
2009
Springer
14 years 10 months ago
2009
Springer
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
Linear Feedback Shift Registers (LFSRs) have always received considerable attention in computer science especially in coding theory and in cryptography. The scope of applications ...
CIG
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract- Recently, P2P (peer-to-peer) online game systems have attracted a great deal of public attention. They work without central servers, thus, the maintenance and organizatio...