- CNET NETWORKS UK BUSINESS SITES:
- atlarge.com
- BNET UK
- silicon.com
- SmartPlanet.com
- ZDNet.co.uk
20 stories on
Sort by: Date | Relevance
whitepaper Examples are quantum cryptosystems, which provide guaranteed secure communication, and quantum computers, which manipulate data quantum mechanically and could thus solve some problems currently intractable to conventional (classical) computations.
[10 Apr 2008]
whitepaper This paper proposes a parallel processing crypto-processor for Elliptic Curve Cryptography (ECC) to speed up EC point multiplication. The processor consists of a controller that dynamically checks Instruction-Level Parallelism (ILP) and multiple...
[03 Mar 2008]
whitepaper This paper investigates a number of issues related to the use of multiple trust authorities and multiple identities in the type of identifier based cryptography enabled by the Weil and Tate pairings. An example of such a system is the Boneh and...
[08 Jan 2007]
whitepaper This paper describes an extension to a general-purpose processor for accelerating public-key cryptosystems. Supported are the legacy cryptosystems RSA and DH as well as the newly emerging Elliptic Curve Cryptography (ECC) system.
[02 Aug 2005]
whitepaper In traditional cryptosystems, user authentication is based on possession of secret keys, which falls apart if the keys are not kept secret (i.e.shared with nonlegitimate users). Current authentication systems based on physiological and behavioral...
[16 Apr 2005]
whitepaper ECC is evolving as an attractive alternative to other public-key cryptosystems such as the Rivest-Shamir-Adleman algorithm (RSA) by offering the smallest key size and the highest strength per bit. This paper describes a cryptographic processor for...
[28 Aug 2004]
whitepaper It is quite noteworthy that of all the cryptosystems developed in those 4,000 years of effort, only 3 systems in widespread serious use remain hard enough to break to be of real value. Cryptography is one of the oldest fields of technical study we...
[27 Apr 2004]
whitepaper We also discuss approaches for building cryptosystems that can operate securely in existing hardware that leaks information. Cryptosystem designers frequently assume that secrets will be manipulated in closed, reliable computing environments.
[08 Mar 2004]
whitepaper Designers of cryptographic systems are at a disadvantage to most other engineers, in that information on how their systems fail is hard to get: their major users have traditionally been government agencies, which are very secretive about their...
[24 Feb 2004]
whitepaper We present attacks against the McEliece Public-Key Cryptosystem, the Atjai-Dwork Public-Key Cryptosystem, and variants of those systems. Most of these systems base their security on the apparent intractability of one or more problems.
[24 Feb 2004]
whitepaper This paper examines the challenges the National Health Service poses as an environment for public-key cryptography systems. The NHS is Europe's largest single employer with over 1.2 million staff. In the last decade, it has launched several major...
[24 Feb 2004]
whitepaper By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed Diffie-Hellman exponents, factor RSA keys, and break other cryptosystems. Actual systems are potentially at risk, including...
[24 Feb 2004]
whitepaper Elliptic curve cryptosystems (ECC) provide the highest strength per bit of any cryptosystem known today. As a result, implementation of public-key cryptosystems in smart cards has usually been associated with high-end cards, typically with both...
[24 Feb 2004]
whitepaper We discuss the notion of side-channel attacks and the vulnerabilities they introduce, demonstrate side-channel attacks against three product ciphers---timing attack against IDEA, processor-flag attack against RC5, and Hamming weight attack against...
[24 Feb 2004]
whitepaper Keys for symmetric and hybrid cryptosystems are also generated randomly. Good cryptography requires good random numbers. This paper evaluates the hardware-based Intel Random Number Generator (RNG) for use in cryptographic applications.
[24 Feb 2004]
whitepaper A new authentication and digital signature scheme called the NTRU Signature Scheme (NSS) is introduced. NSS provides an authentication/ signature method complementary to the NTRU public key cryptosystem.
[24 Feb 2004]
whitepaper We describe NTRU, a new public key cryptosystem. NTRU features reasonably short, easily created keys, high speed, and low memory requirements. NTRU encryption and decryption use a mixing system suggested by polynomial algebra combined with a...
[24 Feb 2004]
whitepaper In recent paper [3 ]highly efficient public key authentication scheme called PASS was introduced. In this paper we show how small modiļ¬cation in the scheme cuts the size of the public key and the commitment in half while reducing an already...
[24 Feb 2004]
whitepaper We describe an implementation of the PASS polynomial authentication and signature scheme that is suitable for use in highly constrained environments such as SmartCards and Wireless Applications. The algorithm underlying the PASS scheme, as...
[24 Feb 2004]
whitepaper Very few fielded cryptosystems are concerned with secrecy: systems such as automatic teller machines, prepayment electricity meters and satellite Much of the debate on cryptography has assumed that the real tension is between the state's desire for...
[14 Aug 2003]
Sort by: Date | Relevance
Copyright ©1995-2008 CNET Networks, Inc. All rights reserved. Top of page
