Sciweavers

1518 search results - page 36 / 304
» Cryptographic Test Correction
Sort
View
106
Voted
CASSIS
2005
Springer
15 years 6 months ago
Modular Proof Principles for Parameterised Concretizations
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
David Pichardie
71
Voted
EOR
2008
80views more  EOR 2008»
15 years 17 days ago
Few statistical tests for proportions comparison
This article reviews a number of statistical tests for comparing proportions. These statistical tests are presented in a comprehensive way, so that OR practitioners can easily und...
Éric D. Taillard, Philippe Waelti, Jacques ...
81
Voted
STVR
2002
80views more  STVR 2002»
15 years 4 days ago
Conditioned slicing supports partition testing
This paper describes the use of conditioned slicing to assist partition testing, illustrating this with a case study. The paper shows how a conditioned slicing tool can be used to...
Robert M. Hierons, Mark Harman, Chris Fox, Lahcen ...
SACRYPT
2009
Springer
212views Cryptology» more  SACRYPT 2009»
15 years 7 months ago
Compact McEliece Keys from Goppa Codes
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many other families of codes but leads to very large pu...
Rafael Misoczki, Paulo S. L. M. Barreto
ISICT
2003
15 years 1 months ago
On the automated implementation of modal logics used to verify security protocols
: Formal verification provides a rigid and thorough means of evaluating the correctness of cryptographic protocols so that even subtle defects can be identified. As the application...
Tom Coffey, Reiner Dojen, Tomas Flanagan