The following pages link to Selecting cryptographic key sizes (Q5950640):
Displayed 18 items.
- Efficient provably-secure hierarchical key assignment schemes (Q719310) (← links)
- Key masking using biometry (Q764394) (← links)
- Efficient generic on-line/off-line (threshold) signatures without key exposure (Q955733) (← links)
- Short fail-stop signature scheme based on factorization and discrete logarithm assumptions (Q1006046) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- The design of composite permutations with applications to DES-like S-boxes (Q2383979) (← links)
- Applications of Signcryption (Q3000039) (← links)
- Better Key Sizes (and Attacks) for LWE-Based Encryption (Q3073715) (← links)
- Secure Data Aggregation in Wireless Sensor Networks: Homomorphism versus Watermarking Approach (Q3076977) (← links)
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions (Q3102787) (← links)
- Hyperelliptic curves encryption combined with block codes for Gaussian channel (Q3427103) (← links)
- Merkle Tree Traversal Revisited (Q3535351) (← links)
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme (Q3627448) (← links)
- Algorithm for factoring some RSA and Rabin moduli (Q3637783) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- A Kilobit Special Number Field Sieve Factorization (Q5387089) (← links)
- Efficient non-malleable commitment schemes (Q5902225) (← links)
- Efficient non-malleable commitment schemes (Q5920255) (← links)