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 #1 to #50.

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

  1. FPGA Implementations of SPRING: Label: en
  2. ICEPOLE: High-Speed, Hardware-Oriented Authenticated Encryption: Label: en
  3. Compact Ring-LWE Cryptoprocessor: Label: en
  4. Enhanced Lattice-Based Signatures on Reconfigurable Hardware: Label: en
  5. Curve41417: Karatsuba Revisited: Label: en
  6. Efficient Pairings and ECC for Embedded Systems: Label: en
  7. Simple Power Analysis on AES Key Expansion Revisited: Label: en
  8. RSA Meets DPA: Recovering RSA Secret Keys from Noisy Analog Data: Label: en
  9. Side-Channel Attack against RSA Key Generation Algorithms: Label: en
  10. Making RSA–PSS Provably Secure against Non-random Faults: Label: en
  11. Secure Conversion between Boolean and Arithmetic Masking of Any Order: Label: en
  12. Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-Channel Countermeasures: Label: en
  13. A Statistical Model for Higher Order DPA on Masked Devices: Label: en
  14. Constructing S-boxes for Lightweight Cryptography with Feistel Structure: Label: en
  15. Destroying Fault Invariant with Randomization: Label: en
  16. “Ooh Aah... Just a Little Bit” : A Small Amount of Side Channel Can Go a Long Way: Label: en
  17. Good Is Not Good Enough: Label: en
  18. How to Estimate the Success Rate of Higher-Order Side-Channel Attacks: Label: en
  19. A New Framework for Constraint-Based Probabilistic Template Side Channel Attacks: Label: en
  20. EM Attack Is Non-invasive? - Design Methodology and Validity Verification of EM Attack Sensor: Label: en
  21. Early Propagation and Imbalanced Routing, How to Diminish in FPGAs: Label: en
  22. Physical Characterization of Arbiter PUFs: Label: en
  23. Efficient Power and Timing Side Channels for Physical Unclonable Functions: Label: en
  24. Secure Lightweight Entity Authentication with Strong PUFs: Mission Impossible?: Label: en
  25. FOAM: Searching for Hardware-Optimal SPN Structures and Components with a Fair Comparison: Label: en
  26. Discrete Curve Evolution on Arbitrary Triangulated 3D Mesh: Label: en
  27. On Finding Spherical Geodesic Paths and Circles in ℤ3: Label: en
  28. Taylor Optimal Kernel for Derivative Etimation: Label: en
  29. Segmentation of 3D Articulated Components by Slice-Based Vertex-Weighted Reeb Graph: Label: en
  30. Digital Geometry from a Geometric Algebra Perspective: Label: en
  31. Implicit Digital Surfaces in Arbitrary Dimensions: Label: en
  32. On Making nD Images Well-Composed by a Self-dual Local Interpolation: Label: en
  33. Exact Evaluation of Stochastic Watersheds: From Trees to General Graphs: Label: en
  34. Adaptive Grid Refinement for Discrete Tomography: Label: en
  35. Uniqueness Regions under Sets of Generic Projections in Discrete Tomography: Label: en
  36. Fourier Inversion of the Mojette Transform: Label: en
  37. An Entropic Perturbation Approach to TV-Minimization for Limited-Data Tomography: Label: en
  38. Discrete Tomography Reconstruction Algorithms for Images with a Blocking Component: Label: en
  39. Back-Projection Filtration Inversion of Discrete Projections: Label: en
  40. Non-additive Bounded Sets of Uniqueness in ℤ n: Label: en
  41. About Multigrid Convergence of Some Length Estimators: Label: en
  42. Stable Shape Comparison of Surfaces via Reeb Graphs: Label: en
  43. Determination of Length and Width of a Line-Segment by Using a Hough Transform: Label: en
  44. Freeman Digitization and Tangent Word Based Estimators: Label: en
  45. Parameter-Free and Multigrid Convergent Digital Curvature Estimators: Label: en
  46. Voronoi-Based Geometry Estimator for 3D Digital Surfaces: Label: en
  47. Efficient Computation of the Outer Hull of a Discrete Path: Label: en
  48. The Minimum Barrier Distance – Stability to Seed Point Position: Label: en
  49. Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search: Label: en
  50. Anti-Aliased Euclidean Distance Transform on 3D Sampling Lattices: Label: en

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