scientific article; zbMATH DE number 1759305
From MaRDI portal
Publication:4536239
zbMATH Open0998.11500MaRDI QIDQ4536239FDOQ4536239
Authors: Marc Joye, Pascal Paillier, Serge Vaudenay 
Publication date: 28 November 2002
Title of this publication is not available (Why is that?)
Recommendations
Cited In (18)
- Improvements to RSA key generation and CRT on embedded devices
- Prime number generators
- Generating safe primes
- Generating Provable Primes Efficiently on Embedded Devices
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Generation of an RSA scheme in resource-constrained environments
- On fast calculation of addition chains for isogeny-based cryptography
- Efficient address generation for prime factor algorithms (digital signal processing)
- Progress in Cryptology - INDOCRYPT 2003
- Title not available (Why is that?)
- Close to uniform prime number generation with fewer random bits
- Fast Generation of Prime Numbers on Portable Devices: An Update
- Primeless factoring-based cryptography. Solving the complexity bottleneck of public-key generation
- Title not available (Why is that?)
- RSA Moduli with a Predetermined Portion: Techniques and Applications
- Title not available (Why is that?)
- Efficient method for generating strong primes with constraint of bit length
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536239)
