517 search results - page 21 / 104 » Bit Encryption Is Complete |
INDOCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...
ICCD
2001
IEEE
14 years 5 months ago
2001
IEEE
We propose two new instructions, swperm and sieve, that can be used to efficiently complete an arbitrary bit-level permutation of an n-bit word with or without repetitions. Permut...
FOCS
2010
IEEE
13 years 6 months ago
2010
IEEE
A fundamental question in leakage-resilient cryptography is: can leakage resilience always be amplified by parallel repetition? It is natural to expect that if we have a leakage-r...
CRYPTO
2007
Springer
14 years 2 months ago
2007
Springer
This work describes a mode of operation, TET, that turns a regular block cipher into a length-preserving enciphering scheme for messages of (almost) arbitrary length. When using a...
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...