Sanity check

Résumé

A sanity check or sanity test is a basic test to quickly evaluate whether a claim or the result of a calculation can possibly be true. It is a simple check to see if the produced material is rational (that the material's creator was thinking rationally, applying sanity). The point of a sanity test is to rule out certain classes of obviously false results, not to catch every possible error. A rule-of-thumb or back-of-the-envelope calculation may be checked to perform the test. The advantage of performing an initial sanity test is that of speedily evaluating basic function. In arithmetic, for example, when multiplying by 9, using the divisibility rule for 9 to verify that the sum of digits of the result is divisible by 9 is a sanity test—it will not catch every multiplication error, however it's a quick and simple method to discover many possible errors. In computer science, a sanity test is a very brief run-through of the functionality of a computer program, system, calculation, or o

Source officielle

https://en.wikipedia.org/wiki/Sanity_check

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (1)

Ron was wrong, Whit is right

Maxime Augier, Joppe Willem Bos, Thorsten Kleinjung, Arjen Lenstra, Christophe Wachter

We performed a sanity check of public keys collected on the web. Our main goal was to test the validity of the assumption that different random choices are made each time keys are generated. We found that the vast majority of public keys work as intended. A more disconcerting finding is that two out of every one thousand RSA moduli that we collected offer no security. Our conclusion is that the validity of the assumption is questionable and that generating keys in the real world for multiple-secrets'' cryptosystems such as RSA is significantly riskier than for single-secret'' ones such as ElGamal or (EC)DSA which are based on Diffie-Hellman.

IACR2012

Chargement

Personnes associées

Aucun résultat

Unités associées

Aucun résultat

Concepts associés (2)

Concepts associés

Chargement

Cours associés (9)

This course covers methods for the analysis and control of systems with multiple inputs and outputs, which are ubiquitous in modern technology and industry. Special emphasis will be given to discrete-time systems, due to their relevance for digital and embedded control architectures.

This course provides an introduction to distributed ledger technology, blockchains and cryptocurrencies, and their potential applications in finance and banking.

Machine learning is a sub-field of Artificial Intelligence that allows computers to learn from data, identify patterns and make predictions. As a fundamental building block of the Computational Thinking education at EPFL, Civil students will learn ML with civil case studies (summary generated by ML)

Afficher plus

Cours associés

Chargement

Séances de cours associées (11)

Séances de cours associées

Chargement