Hardware Security: Advanced Topics and Trends

For simplicity, take the shortest interval at which rows in the same bank can be activated to be tRC = 50 ns. With a refresh period of 64 ms, the maximum number of times a neighbouring row can be activated between one refresh of a given row and the next is 64 ms ÷ 50 ns. What is this maximum number when the refresh rate is doubled?

  1. Aabout 640,000
  2. Babout 1,280,000
  3. Cabout 2,560,000
Show answer and explanation

Answer: A. about 640,000

Doubling the refresh rate makes the period 64 ms ÷ 2 = 32 ms. The maximum number of activations in that time is 32 ms ÷ 50 ns = 640,000, half of the original 64 ms ÷ 50 ns = 1,280,000. Research has reported DRAM that flips after only a few thousand activations, so even halving the number leaves plenty for an attack, and adding refreshes alone cannot prevent it. Moreover, banks cannot be used during refresh and power rises, so the burden on performance and power consumption becomes large.

  • A. Correct. 32 ms ÷ 50 ns = 640,000.
  • B. This is the value before the refresh rate is changed (64 ms ÷ 50 ns).
  • C. This is the value of the reverse calculation, doubling the refresh period (128 ms).
Practice this topic Back to topic

Books on Hardware Security: Advanced Topics and Trends Ad

As an Amazon Associate I earn from qualifying purchases.

More Hardware Security: Advanced Topics and Trends questions

  1. Which correctly describes the characteristics of the vulnerability called MDS (Microarchitectural Data Sampling), published in 2019?
  2. Which correctly pairs the descriptions of retpoline and IBRS, countermeasures against the Spectre variant that abuses indirect branch prediction (branch target injection)?
  3. A task took 10 seconds before mitigations for speculative execution were applied and made 5 million system calls during that time. Assume that the mitigations increase the processing time per system call from 0.4 µs to 0.6 µs and leave the time of everything else unchanged. By what proportion does the total time of the task increase?
  4. Lattice-based post-quantum cryptography repeatedly multiplies polynomials of degree n = 256. If the naive method of multiplying every pair of coefficients needs about n² multiplications and the method using the number-theoretic transform (NTT) needs about n log₂ n, which is closest to the factor by which the NTT reduces the number of multiplications?
  5. The public key of ML-KEM-768 is 1,184 bytes and its ciphertext 1,088 bytes, while the public value of the elliptic-curve key exchange X25519 is 32 bytes. How many times larger than the X25519 public value is the ML-KEM-768 public key?