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 50 results in range #51 to #100.

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

  1. Prepaid electronic cheques using public-key certificates: Label: en
  2. Quantum cryptography: Protecting our future networks with quantum mechanics: Label: en
  3. Good codes based on very sparse matrices: Label: en
  4. Cryptanalysis of Nonlinear Filter Generators with (0, 1)-Metric Viterbi Decoding: Label: en
  5. Non-binary Block Inseparable Errors Control Codes: Label: en
  6. A New Undeniable Signature Scheme Using Smart Cards: Label: en
  7. A New Search Pattern in Multiple Residue Method (MRM) and Its Importance in the Cryptanalysis of the RSA: Label: en
  8. Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA Do Not Have the SAC or Do Not Generate Random Numbers: Label: en
  9. Another Way of Doing RSA Cryptography in Hardware: Label: en
  10. An Identity Based Encryption Scheme Based on Quadratic Residues: Label: en
  11. Attacking the Affine Parts of SFLASH: Label: en
  12. Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement: Label: en
  13. Lattice Attacks on RSA-Encrypted IP and TCP: Label: en
  14. Generating Large Instances of the Gong-Harn Cryptosystem: Label: en
  15. Statistical Physics of Low Density Parity Check Error Correcting Codes: Label: en
  16. Investigation of Linear Codes Possessing Some Extra Properties: Label: en
  17. An Efficient Stream Cipher Alpha1 for Mobile and Wireless Devices: Label: en
  18. Unconditionally Secure Key Agreement Protocol: Label: en
  19. Key Recovery Scheme Interoperability - A Protocol for Mechanism Negotiation: Label: en
  20. Improving Divide and Conquer Attacks against Cryptosystems by Better Error Detection / Correction Strategies: Label: en
  21. Undetachable Threshold Signatures: Label: en
  22. The Wide Trail Design Strategy: Label: en
  23. Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography and Pseudo-Random Coding: Label: en
  24. Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces: Label: en
  25. The Synthesis of TD-Sequences and Their Application to Multi-functional Communication Systems: Label: en
  26. A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing: Label: en
  27. Graph Configurations and Decoding Performance: Label: en
  28. Weight vs. Magnetization Enumerator for Gallager Codes: Label: en
  29. Almost-Certainly Runlength-Limiting Codes: Label: en
  30. Majority-Logic-Decodable Cyclic Arithmetic-Modular AN-Codes in 1, 2, and L Steps: Label: en
  31. Strong Adaptive Chosen-Ciphertext Attacks with Memory Dump (or: The Importance of the Order of Decryption and Validation): Label: en
  32. On Rabin-Type Signatures: Label: en
  33. A New Ultrafast Stream Cipher Design: COS Ciphers: Label: en
  34. The Exact Security of ECIES in the Generic Group Model: Label: en
  35. Key Recovery Attacks on MACs Based on Properties of Cryptographic APIs: Label: en
  36. A Technique with an Information-Theoretic Basis for Protecting Secret Data from Differential Power Attacks: Label: en
  37. A Simple Soft-Input/Soft-Output Decoder for Hamming Codes: Label: en
  38. Further Improvement of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem: Label: en
  39. The Complete Weight Enumerator for Codes over M nxs(F q): Label: en
  40. On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory: Label: en
  41. A Statistical Decoding Algorithm for General Linear Block Codes: Label: en
  42. Practical Zero-Knowledge Proofs for Circuit Evaluation: Label: en
  43. Optimal Recovery of Secret Keys from Weak Side Channel Traces: Label: en
  44. Cache Timing Analysis of LFSR-Based Stream Ciphers: Label: en
  45. The Rayleigh Quotient of Bent Functions: Label: en
  46. A New Family of Hyper-Bent Boolean Functions in Polynomial Form: Label: en
  47. On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions: Label: en
  48. An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems: Label: en
  49. Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms: Label: en
  50. Double-Exponentiation in Factor-4 Groups and Its Applications: Label: en

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