Sciweavers

20 search results - page 1 / 4
» Generating a Product of Three Primes with an Unknown Factori...
Sort
View
CTRSA
2003
Springer
120views Cryptology» more  CTRSA 2003»
13 years 11 months ago
Simple Backdoors for RSA Key Generation
We present extremely simple ways of embedding a backdoor in the key generation scheme of RSA. Three of our schemes generate two genuinely random primes p and q of a given size, to...
Claude Crépeau, Alain Slakmon
BIBE
2004
IEEE
107views Bioinformatics» more  BIBE 2004»
13 years 10 months ago
Fast Parallel Molecular Algorithms for DNA-based Computation: Factoring Integers
The RSA public-key cryptosystem is an algorithm that converts input data to an unrecognizable encryption and converts the unrecognizable data back into its original decryption form...
Weng-Long Chang, Michael (Shan-Hui) Ho, Minyi Guo
EUROCRYPT
1999
Springer
13 years 10 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
STOC
1993
ACM
121views Algorithms» more  STOC 1993»
13 years 10 months ago
On the generation of multivariate polynomials which are hard to factor
In this paper we consider the di culty of factoring multivariate polynomials F(x y z :::) modulo n. We consider in particular the case in which F is a product of two randomly chose...
Adi Shamir