Jorge Quitério Search
Topic

IT & Engineering

Information security management, IS audit and GRC, AI and its governance, quantum and post-quantum cryptography, and software engineering, each with the mathematics underneath.

Articles
17 articles
  1. Measurement in AI governance

    ISO/IEC 42001, the NIST AI RMF and the EU AI Act all require evidence that AI systems behave as intended. Evidence about a statistical system is itself statistical, and a simulation of test campaigns shows how much testing a performance claim requires.

    6 min read
  2. Quantitative limits of quantum key distribution

    Quantum key distribution derives its security from physics rather than computational assumptions. Its limits are nevertheless quantitative: an 11% error threshold, exponential photon loss with distance, and a classical channel that still requires authentication. A BB84 simulation with an eavesdropper illustrates them.

    6 min read
  3. Learning with errors and post-quantum key exchange

    ML-KEM, the new standard for quantum-resistant key exchange, rests on a statistical problem: recovering a secret from linear equations deliberately perturbed by small random errors. A simulation shows how increasing noise leads to decryption failure.

    7 min read
  4. Planning the migration to post-quantum cryptography

    The post-quantum standards are published. The main difficulty is identifying where cryptography is used and how quickly it can be replaced. Mosca's inequality, expressed as a probability, indicates when the migration should start.

    5 min read
  5. Sampling, aliasing and monitoring

    Sampling a signal too slowly turns a fast cycle into an apparent slow one. The Nyquist-Shannon theorem states how fast sampling must be, and it applies to monitoring dashboards as much as to audio. A figure demonstrates frequency folding.

    5 min read
  6. Base rates and the precision of security alerts

    A detector that catches 95% of attacks with a 2% false-alarm rate appears excellent. When attacks are rare, however, more than nine alerts in ten are false. A Sankey diagram of ten thousand events and a log-odds waterfall illustrate Bayes' rule in this setting.

    5 min read
  7. Zero-downtime database migrations and Little's law

    A schema change that takes milliseconds can still make a busy PostgreSQL database unavailable, because of the queries that queue behind it while it waits for its lock. Little's law explains the outage, and a simulation shows the queue growing.

    7 min read
  8. Bayesian estimation of incident rates for risk registers

    Risk analysts need incident frequencies but rarely have enough data. Starting from an expert's range, each year's incidents update the estimate, and the uncertainty is carried through to expected loss. Six illustrative asset classes show the effect on prioritisation.

    5 min read
  9. Terraform as a change-management control

    Infrastructure as code is usually justified by automation, but its greater value is control: every change is reviewable, reversible and recorded. Six guardrails provide this control, and Little's law determines how often to check for drift.

    6 min read
  10. Risk matrices and loss exceedance curves

    A five-by-five risk matrix can place two risks in the same cell when one is fifty times more likely to cause a loss of a million euros in a year. A simulation of both risks shows what a loss exceedance curve tells a risk owner that a colour cannot.

    7 min read
  11. Coverage-guided fuzzing in Go and its probability model

    Random testing would need about four billion attempts to pass a four-byte magic number. Go's coverage-guided fuzzer found a defect behind one in about a second. The difference arises because coverage guidance replaces a product of probabilities with a sum, as a simulation shows.

    8 min read
  12. A signed and scanned container pipeline for Docker hosts

    Supply-chain security is usually explained with Kubernetes admission controllers, but many teams run Docker hosts. This article presents a reference design with GitLab CI, Harbor and Portainer that rejects unsigned or vulnerable images, and a simulation showing that a scan gate is a classifier with measurable error rates.

    7 min read
  13. Statistical sampling in control testing

    This article explains why 59 is a common sample size in control testing, what a sample without deviations demonstrates, and why population size has little effect on the required sample. A simulated control illustrates the operating characteristic of a sampling plan.

    7 min read
  14. The role of information security in risk decisions

    Security teams are often asked to approve or reject a risk. Decision theory explains why they should supply the probabilities and leave the choice to the risk owner, and it also indicates when further analysis is no longer worthwhile. A small model illustrates both points.

    5 min read
  15. Security risks of autonomous coding agents

    An assistant that suggests code is a productivity tool. An agent that runs commands, reads web content and pushes to repositories is a new identity in the environment. The article shows why a low per-page injection rate becomes a high daily probability, and which controls reduce the risk.

    5 min read
  16. Digital sovereignty and the role of verification

    Europe cannot build every component of its critical infrastructure. It can, however, ensure that it is able to inspect, assure and replace every component it depends on. A dependency simulation shows why verification is the most effective lever.

    4 min read
  17. Assurance controls for AI-generated code

    An AI coding assistant can be treated as a fast and confident contributor without accountability. The necessary controls already exist; the volume of code is what changes. A simulation of defects passing through layered controls shows why independent controls matter more than additional ones.

    5 min read