Pages that link to "Item:Q1895963"
From MaRDI portal
The following pages link to Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963):
Displaying 22 items.
- On using primes for public key encryption systems (Q1109750) (← links)
- Prime-number algorithm for public-key systems (Q1816016) (← links)
- Short effective intervals containing primes (Q1869779) (← links)
- A novel ID-based group signature (Q1969685) (← links)
- A numerical study on the regularity of \(d\)-primes via informational entropy and visibility algorithms (Q2205952) (← links)
- Algorithms for generating, testing and proving primes: A survey (Q2708615) (← links)
- Generating strong primes in RSA cryptosystems (Q2719640) (← links)
- Period of the power generator and small values of Carmichael's function (Q2723531) (← links)
- Generating safe primes (Q2873165) (← links)
- Analyzing Standards for RSA Integers (Q3011917) (← links)
- Efficient method for generating strong primes with constraint of bit length (Q3363234) (← links)
- Efficient address generation for prime factor algorithms (digital signal processing) (Q3482813) (← links)
- Recognizing primes (Q3505774) (← links)
- Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes (Q3828063) (← links)
- (Q4314050) (← links)
- Fast generation of provable primes using search in arithmetic progressions (Q4940703) (← links)
- A SEMANTICALLY SECURE PUBLIC-KEY CRYPTOSYSTEM BASED ON RSA (Q5150698) (← links)
- Public Key Cryptography - PKC 2005 (Q5711574) (← links)
- Breaking RSA Generically Is Equivalent to Factoring (Q5901923) (← links)
- Efficient non-malleable commitment schemes (Q5902225) (← links)
- Efficient non-malleable commitment schemes (Q5920255) (← links)
- Implications of the arithmetic ratio of prime numbers for RSA security (Q6100064) (← links)
