sgen1: A generator of small but difficult satisfiability benchmarks

The satisfiability problem is known to be NP-Complete; therefore, there should be relatively small problem instances that take a very long time to solve. However, most of the smaller benchmarks that were once thought challenging, especially the satisfiable ones, can be processed quickly by modern SAT-solvers. We describe and make available a generator that produces both unsatisfiable and, more significantly, satisfiable formulae that take longer to solve than any others known. At the two most recent international SAT Competitions, the smallest unsolved benchmarks were created by this generator. We analyze the results of all solvers in the most recent competition when applied to these benchmarks and also present our own more focused experiments.

Zero-One Designs Produce Small Hard SAT Instances

Some basics of combinatorial block design are combined with certain constraint satisfaction problems of interest to the satisfiability community. The paper shows how such combinations lead to satisfiability problems, and shows empirically that these are some of the smallest very hard satisfiability problems ever constructed. Partially balanced (0,1) designs (PB01Ds) are introduced as an extension of balanced incomplete block designs (BIBDs) and (0,1) designs. Also, (0,1) difference sets are introduced as an extension of certain cyclical difference sets. Constructions based on (0,1) difference sets enable generation of PB01Ds over a much wider range of parameters than is possible for BIBDs. Building upon previous work of Spence, it is shown how PB01Ds lead to small, very hard, unsatisfiable formulas. A new three-dimensional form of combinatorial block design is introduced, and leads to small, very hard, satisfiable formulas. The methods are validated on solvers that performed well in the SAT 2009 and earlier competitions.

The Irish High Court Issues its First Order on a Commitment Agreement between the NCA and an Undertaking (Fitflop)

The Irish Competition (Amendment) Act 2012 introduced court-endorsed commitment agreements to Irish competition law. The new section 14B of the principal Competition Act 2002 provides for making commitment agreements between the Irish Competition and undertakings an order of the Irish High Court. This piece, first, investigates the prior Irish practice regarding commitment or settlement agreements and its legal basis. It looks then into the newly introduced rules on court-endorsed commitment agreements. Finally, before concluding, it points to the first instance of their application — to an order issued by the High Court in the FitFlop case in December 2012, which came into effect in February 2013.

The Polish Competition Authority Submits a Draft Amendment to the Polish Competition Act: Revolution or Fine-Tuning?

This piece highlights and offers a brief analysis of the most important of the
proposed changes to Polish competition law. The draft proposal envisages introduction of, inter alia, financial penalties for individuals, two-stage merger review process, important changes to the leniency program (including introduction of leniency plus), as well as such new tools as remedies and settlements.

The Polish Competition Authority Publishes its Annual Report for 2012

In May 2013 the President of the Office of Competition and Consumer Protection (UOKiK), the Polish Competition Authority, published its Annual Report for 2012. This piece provides an overview of the reported activities within the competition law & policy domain, and comments on some of them.

The health profile of football/soccer players in Northern Ireland - a review of the uefa pre-participation medical screening procedure.

BACKGROUND:
It is compulsory that domestic football/soccer teams in UEFA competitions organise players' pre-participation medicals. Although screening guidelines have been established, these remain controversial. The findings of medical examinations can have lasting consequences for athletes and doctors. No previous studies have reported UEFA pre-participation screening results in semi-professional footballers. This study aims to further knowledge regarding 'normal' data in this population.

METHOD:
Retrospective audit and analysis of records of pre-season medicals for all male first-team players at one semi-professional Northern Ireland Premiership team between 2009-2012. Medicals were conducted by the club doctor following the UEFA proforma. Height, weight, blood pressure (BP), full blood count (FBC), dipstick urinalysis and resting electrocardiogram (ECG) were conducted by an independent nurse. Only one ECG must be documented during a player's career; other tests are repeated yearly.

RESULTS:
89 medicals from 47 players (6 goalkeepers, 11 defenders, 22 midfielders and 8 attackers; mean age 25.0 years (SD 4.86)) were reviewed. Mean height of the players was 179.3 cm (SD 5.90) with a mean weight of 77.6 kg (SD 10.5). Of 89 urine dipsticks, 7 were positive for protein; all 7 were normal on repeat testing following 48 hours of rest. Of 40 ECGs (mean ventricular rate 61.2 bpm (SD 11.6)), one was referred to cardiology (right bundle branch block; prolonged Q-T interval). No players were excluded from participation.

CONCLUSIONS:
This study provides important information about 'normal' values in a population of semi-professional footballers. Urinalysis showing protein is not uncommon but is likely to be normal on repeat testing.

The BRUTUS Automatic Cryptanalytic Framework: Testing CAESAR Authenticated Encryption Candidates for Weaknesses

This report summarizes our results from security analysis covering all 57 competitions for authenticated encryption: security, applicability, and robustness (CAESAR) first-round candidates and over 210 implementations. We have manually identified security issues with three candidates, two of which are more serious, and these ciphers have been withdrawn from the competition. We have developed a testing framework, BRUTUS, to facilitate automatic detection of simple security lapses and susceptible statistical structures across all ciphers. From this testing, we have security usage notes on four submissions and statistical notes on a further four. We highlight that some of the CAESAR algorithms pose an elevated risk if employed in real-life protocols due to a class of adaptive-chosen-plaintext attacks. Although authenticated encryption with associated data are often defined (and are best used) as discrete primitives that authenticate and transmit only complete messages, in practice, these algorithms are easily implemented in a fashion that outputs observable ciphertext data when the algorithm has not received all of the (attacker-controlled) plaintext. For an implementor, this strategy appears to offer seemingly harmless and compliant storage and latency advantages. If the algorithm uses the same state for secret keying information, encryption, and integrity protection, and the internal mixing permutation is not cryptographically strong, an attacker can exploit the ciphertext–plaintext feedback loop to reveal secret state information or even keying material. We conclude that the main advantages of exhaustive, automated cryptanalysis are that it acts as a very necessary sanity check for implementations and gives the cryptanalyst insights that can be used to focus more specific attack methods on given candidates.