Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 30 results in range #1 to #30.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES: Label: en
  2. Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude: Label: en
  3. Improved Differential Attacks on RC5: Label: en
  4. Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing: Label: en
  5. Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers: Label: en
  6. New Generation of Secure and Practical RSA-Based Signatures: Label: en
  7. Robust and Efficient Sharing of RSA Functions: Label: en
  8. Security of 2t-Root Identification and Signatures: Label: en
  9. Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes: Label: en
  10. All Bits in ax + b mod p are Hard: Label: en
  11. Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems: Label: en
  12. The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?: Label: en
  13. Hidden Collisions on DSS: Label: en
  14. Weaknesses in Some Threshold Cryptosystems: Label: en
  15. Anonymous Communication and Anonymous Cash: Label: en
  16. Asymmetric Cryptography with a Hidden Monomial: Label: en
  17. Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings: Label: en
  18. Universal Hashing and Multiple Authentication: Label: en
  19. Keying Hash Functions for Message Authentication: Label: en
  20. New Results on Visual Cryptography: Label: en
  21. Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution: Label: en
  22. Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations: Label: en
  23. Linear Complexity of Periodic Sequences: A General Theory: Label: en
  24. Quantum Key Distribution and String Oblivious Transfer in Noisy Channels: Label: en
  25. Quantum Cryptography over Underground Optical Fibers: Label: en
  26. On Fast and Provably Secure Message Authentication Based on Universal Hashing: Label: en
  27. Fast Hashing on the Pentium: Label: en
  28. Algorithms for Black-Box Fields and their Application to Cryptography: Label: en
  29. Diffie-Hellman Oracles: Label: en
  30. How to Protect DES Against Exhaustive Key Search: Label: en

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)