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 #101 to #150.

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

  1. Error analysis of weak poly-LWE instances: Label: en
  2. Secret sharing on large girth graphs: Label: en
  3. Constructions of S-boxes with uniform sharing: Label: en
  4. Decomposition of permutations in a finite field: Label: en
  5. Affine linear cryptanalysis: Label: en
  6. Editorial: Special issue on mathematical methods for cryptography: Label: en
  7. Paraunitary generation/correlation of QAM complementary sequence pairs: Label: en
  8. Perfect arrays of unbounded sizes over the basic quaternions: Label: en
  9. New near perfect sequences of even lengths: Label: en
  10. A simple suboptimal construction of cross-bifix-free codes: Label: en
  11. A complementary construction using mutually unbiased bases: Label: en
  12. Special issue editorial: Sequences and their applications: Label: en
  13. On the irreducibility of the hyperplane sections of Fermat varieties in \(\mathbb {P}^{3}\) in characteristic 2. II: Label: en
  14. A new family of arrays with low autocorrelation: Label: en
  15. Sequences of bent functions and near-bent functions: Label: en
  16. Generalized methods to construct low-hit-zone frequency-hopping sequence sets and optimal constructions: Label: en
  17. Several classes of permutation trinomials from Niho exponents: Label: en
  18. Design sequences with high linear complexity over finite fields using generalized cyclotomy: Label: en
  19. Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences: Label: en
  20. Unit time-phase signal sets: bounds and constructions: Label: en
  21. Block weighing matrices: Label: en
  22. Secondary constructions of Boolean functions with maximum algebraic immunity: Label: en
  23. Computing the linear complexity for sequences with characteristic polynomial \(f^v\): Label: en
  24. CAR30: a new scalable stream cipher with rule 30: Label: en
  25. Minimum sizes of identifying codes in graphs differing by one vertex: Label: en
  26. Equivalence classes for cubic rotation symmetric functions: Label: en
  27. Cheating-immune secret sharing schemes from codes and cumulative arrays: Label: en
  28. Quaternary cryptographic bent functions and their binary projection: Label: en
  29. Designing integrated accelerator for stream ciphers with structural similarities: Label: en
  30. Finding Hamming weights without looking at truth tables: Label: en
  31. Comments on ``A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation: Label: en
  32. Asymptotic enumeration of correlation-immune Boolean functions: Label: en
  33. \(X^{2^l+1}+x+a\) and related affine polynomials over \(\mathrm{GF}(2^k\)): Label: en
  34. Third-order nonlinearities of a subclass of Kasami functions: Label: en
  35. Pseudorandom numbers and hash functions from iterations of multivariate polynomials: Label: en
  36. New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid: Label: en
  37. The second weight of generalized Reed-Muller codes in most cases: Label: en
  38. On the structural weakness of the GGHN stream cipher: Label: en
  39. Cryptanalysis of WG-7: a lightweight stream cipher: Label: en
  40. Synthetic linear analysis with applications to CubeHash and Rabbit: Label: en
  41. State cycles, initialization and the Trivium stream cipher: Label: en
  42. On the nonlinearity of maximum-length NFSR feedbacks: Label: en
  43. Applying cube attacks to stream ciphers in realistic scenarios: Label: en
  44. High order differential attacks on stream ciphers: Label: en
  45. A survey on fast correlation attacks: Label: en
  46. Correlation attacks on combination generators: Label: en
  47. Regular \(p\)-ary bent functions with five terms and Kloosterman sums: Label: en
  48. Absorbing sets of codes from finite geometries: Label: en
  49. A concatenated construction of linear complementary pair of codes: Label: en
  50. An iterative method for linear decomposition of index generating functions: Label: en

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