Sciweavers

23 search results - page 4 / 5
» Large primes and Fermat factors
Sort
View
CRYPTO
1991
Springer
150views Cryptology» more  CRYPTO 1991»
13 years 10 months ago
CM-Curves with Good Cryptographic Properties
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...
Neal Koblitz
ACISP
2000
Springer
13 years 11 months ago
An Extremely Small and Efficient Identification Scheme
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...
William D. Banks, Daniel Lieman, Igor Shparlinski
WWW
2006
ACM
14 years 7 months ago
Generation of multimedia TV news contents for WWW
In this paper, we present a system we have developed for automatic TV News video indexing that successfully combines results from the fields of speaker verification, acoustic anal...
Hsin-Chia Fu, Yeong-Yuh Xu, C. L. Tseng
ISCA
1998
IEEE
144views Hardware» more  ISCA 1998»
13 years 11 months ago
Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism
This paper investigates the placement of data and parity on redundant disk arrays. Declustered organizations have been traditionally used to achieve fast reconstruction of a faile...
Guillermo A. Alvarez, Walter A. Burkhard, Larry J....
ASIACRYPT
2006
Springer
13 years 10 months ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Jens Groth