Selecting cryptographic key sizes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1440074
- Public-key cryptography. State of the art and future directions. E.I.S.S. workshop, Oberwolfach, Germany, July 3-6, 1991. Final report
- History of Cryptographic Key Sizes
- scientific article; zbMATH DE number 503336
- scientific article; zbMATH DE number 2081059
Cited in
(48)- Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
- On the asymptotic complexity of solving LWE
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- New number-theoretic cryptographic primitives
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Message transmission for GH-public key cryptosystem
- More efficient DDH pseudorandom generators
- The design of composite permutations with applications to DES-like S-boxes
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- Long term confidentiality: a survey
- Universal security. From bits and mips to pools, lakes -- and beyond
- Using the cloud to determine key strengths
- RSA and elliptic curve least significant bit security
- Applications of signcryption
- Better key sizes (and attacks) for LWE-based encryption
- Secure data aggregation in wireless sensor networks: homomorphism versus watermarking approach
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
- Hyperelliptic curves encryption combined with block codes for Gaussian channel
- Improved cryptographic puzzle based on~modular exponentiation
- An optimal key enumeration algorithm and its application to side-channel attacks
- Merkle Tree Traversal Revisited
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Algorithm for factoring some RSA and Rabin moduli
- scientific article; zbMATH DE number 2081059 (Why is no real title available?)
- scientific article; zbMATH DE number 1440074 (Why is no real title available?)
- On the Berger-Loidreau cryptosystem on the tensor product of codes
- History of Cryptographic Key Sizes
- Computational hardness of IFP and ECDLP
- A method of protected distribution of data among unreliable and untrusted nodes
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE
- On the construction of a semantically secure modification of the McEliece cryptosystem
- Cryptographic functions from worst-case complexity assumptions
- Some application of difference equations in cryptography and coding theory
- A Kilobit Special Number Field Sieve Factorization
- Computation of a 768-bit prime field discrete logarithm
- An efficient self-blindable attribute-based credential scheme
- Efficient non-malleable commitment schemes
- Fast multi-precision multiplication for public-key cryptography on embedded microprocessors
- Fast multi-precision multiplication for public-key cryptography on embedded microprocessors
- Efficient non-malleable commitment schemes
- Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey
- A security analysis of two classes of RSA-like cryptosystems
- Revisiting Takagi-Lim et al. family schemes
- The case of small prime numbers versus the Okamoto-Uchiyama cryptosystem
- Efficient provably-secure hierarchical key assignment schemes
- Discrete logarithm factory
- Key masking using biometry
- Efficient generic on-line/off-line (threshold) signatures without key exposure
This page was built for publication: Selecting cryptographic key sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5950640)
