Elliptic Curve Cryptography - An Implementation Tutorial
The paper gives an introduction to elliptic curve cryptography (ECC) and how it is used in the implementation of digital signature (ECDSA) and key agreement (ECDH) Algorithms. The paper discusses the implementation of ECC on two finite fields, prime field and binary field. It also gives an overview of ECC implementation on different coordinate systems called the projective coordinate systems. The paper also discusses the basics of prime and binary field arithmetic.
Read the Article
|
Scalable Clustering Algorithms with Balancing Constraints
In this paper, we propose a general framework for scalable, balanced clustering. The data clustering process is broken down into three steps: sampling of a small representative subset of the points, clustering of the sampled data, and populating the initial clusters with the remaining data followed by refinements. First, we show that a simple uniform sampling from the original data is sufficient to get a representative subset with high probability. While the proposed framework allows a large class of algorithms to be used for clustering the sampled set, we focus on some popular parametric algorithms for ease of exposition. We then present algorithms to populate and refine the clusters.
Read the Article
|
Timed-Release and Key-Insulated Public Key Encryption
In this paper we consider two security notions related to Identity Based Encryption: Key-insulated public key encryption and Timed-Release Public Key cryptography. We first formalize the notion of secure timed-release public key encryption, and show that, despite several differences in its formulation, it is equivalent to strongly key-insulated public key encryption (with optimal threshold and random access key updates). Next, we introduce the concept of an authenticated timed-release cryptosystem, briefly consider generic constructions, and then give a construction based on a single primitive which is efficient and provably secure.
Read the Article
|
Encrypted Root Filesystem HOWTO
This document explains how to make your personal data secure by encrypting your Linux root filesystem using strong cryptography.
Read the Article
|
Practical Applications of Public-key Cryptography: Securing Email Communications with PGP
When it comes to assymetric cryptography the most popular and widely used application that comes to anyone's mind is PGP. PGP stands for "Pretty Good Privacy" and is the standard public key cryptography application used today.
Read the Article
|
Fast Software Encryption: Designing Encryption Algorithms for Optimal Software Speed on the Intel
Most encryption algorithms are designed without regard to their performance on top-of-the-line microprocessors. This paper discusses general optimization principles cryptographers should keep in mind when designing algorithms, and analyzes the performance of RC4, SEAL, RC5, Blowfish, and Khufu/Khafre on the Intel Pentium with respect to those principles.
Read the Article
|
Key Iterations & Cryptographic Salts
The following document discusses the use of key iterations and cryptographic salts to stop dictionary attacks in password based encryption (symmetric cryptography).
Read the Article
|
Master-Key Cryptosystems
We initiate the study of a new class of secret-key cryptosystems, called master-key cryptosystems (MKCSs), in which an authorized third party (hereinafter called "the government," although it need not literally be one) possesses a "master key" that allows efficient recovery of the cleartext without knowledge of the session key.
Read the Article
|
Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security
Encryption plays an essential role in protecting the privacy of electronic information against threats from a variety of potential attackers. In so doing, modern cryptography employs a combination of conventional or symmetric cryptographic systems for encrypting data and public key or asymmetric systems for managing the keys used by the symmetric systems.
Read the Article
|
Protecting Secret Keys with Personal Entropy
Conventional encryption technology often requires users to protect a secret key by selecting a password or passphrase. While a good passphrase will only be known to the user, it also has the flaw that it must be remembered exactly in order to recover the secret key. As time passes, the ability to remember the passphrase fades and the user may eventually lose access to the secret key. We propose a scheme whereby a user can protect a secret key using the personal entropy" in his own life, by encrypting the passphrase using the answers to several personal questions. We designed the scheme so the user can forget answers to a subset of the questions and still recover the secret key, while an attacker must learn the answer to a large subset of the questions in order to recover the secret key.
Read the Article
|
