Sciweavers

722 search results - page 3 / 145
» Efficient Generation of Prime Numbers
Sort
View
CORR
2010
Springer
181views Education» more  CORR 2010»
13 years 5 months ago
Data Hiding Techniques Using Prime and Natural Numbers
In this paper, a few novel data hiding techniques are proposed. These techniques are improvements over the classical LSB data hiding technique and the Fibonacci LSB data-hiding te...
Sandipan Dey, Ajith Abraham, Bijoy Bandyopadhyay, ...
EUROCRYPT
1999
Springer
13 years 9 months ago
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
Jan Camenisch, Markus Michels
ICISC
2004
108views Cryptology» more  ICISC 2004»
13 years 6 months ago
Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
We consider the generation of prime order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
Elisavet Konstantinou, Aristides Kontogeorgis, Yan...
JOC
2010
96views more  JOC 2010»
13 years 2 days ago
On the Efficient Generation of Prime-Order Elliptic Curves
We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
Elisavet Konstantinou, Aristides Kontogeorgis, Yan...
CHES
2001
Springer
130views Cryptology» more  CHES 2001»
13 years 9 months ago
Generating Elliptic Curves of Prime Order
A variation of the Complex Multiplication (CM) method for generating elliptic curves of known order over finite fields is proposed. We give heuristics and timing statistics in th...
Erkay Savas, Thomas A. Schmidt, Çetin Kaya ...