Sciweavers

23 search results - page 2 / 5
» Large primes and Fermat factors
Sort
View
ANTS
2010
Springer
250views Algorithms» more  ANTS 2010»
13 years 9 months ago
A Subexponential Algorithm for Evaluating Large Degree Isogenies
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
David Jao, Vladimir Soukharev
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
IJNSEC
2008
96views more  IJNSEC 2008»
13 years 5 months ago
Eliminating Quadratic Slowdown in Two-Prime RSA Function Sharing
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...
Maged Hamada Ibrahim
ISW
2000
Springer
13 years 9 months ago
A Signcryption Scheme Based on Integer Factorization
Abstract. Signcryption is a public-key cryptographic primitive introduced by Zheng, which achieves both message confidentiality and nonrepudiatable origin authenticity, at a lower ...
Ron Steinfeld, Yuliang Zheng
DATE
2007
IEEE
134views Hardware» more  DATE 2007»
13 years 12 months ago
Non-fractional parallelism in LDPC decoder implementations
Because of its excellent bit-error-rate performance, the Low-Density Parity-Check (LDPC) decoding algorithm is gaining increased attention in communication standards and literatur...
John Dielissen, Andries Hekstra