scientific article; zbMATH DE number 2081059
From MaRDI portal
Publication:4474166
Recommendations
Cited in
(22)- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- On the security of RSA with primes sharing least-significant bits
- Updating key size estimations for pairings
- New number-theoretic cryptographic primitives
- A taxonomy of pairing-friendly elliptic curves
- Instantiability of RSA-OAEP under chosen-plaintext attack
- List signature schemes
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH
- Extended tower number field sieve: a new complexity for the medium prime case
- Non-uniform cracks in the concrete: the power of free precomputation
- An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
- The number field sieve for integers of low weight
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- A brief history of pairings
- On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one
- Computation of a 768-bit prime field discrete logarithm
- Selecting cryptographic key sizes
- Secure and Efficient Pairing at 256-Bit Security Level
- A security analysis of two classes of RSA-like cryptosystems
- Fault attacks on multi-prime RSA signatures
- The case of small prime numbers versus the Okamoto-Uchiyama cryptosystem
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 Q4474166)
