This paper analyses the stream cipher SSC2 [ZCC00]. We describe some weaknesses and attacks exploiting these weaknesses. The strongest attack needs about 2 words of known key stream and has a time complexity of about 2.

A chosen-plaintext attack on two-key triple encryption noted by Merkle and Hellman is extended to a known-plaintext attack. The known-plaintext attack has lower memory requirements than the chosen-plaintext attack, but has a greater running time. The new attack is a significant improvement over a known-plaintext brute-force attack, but is still not seen as a serious threat to two-key triple enc...

In this paper, we revisit the famous Davies-Murphy cryptanalysis of DES. First we improve its complexity down to the analysis of 2 chosen plaintexts, by considering 6 distributions instead of 7. The previous improvement of the attack by Biham and Biryukov costed 2 known plaintexts. This new result is better than differential cryptanalysis but slightly worse than linear cryptanalysis. Secondly, ...

Out of dissatisfaction with currently available software, we built a music management program for large digital music libraries. We propose a system that solves some of the difficulties of organizing these libraries. The system introduces a new visual interaction style with the user’s music collection. A physics system coupled to album’s genre information allows the user to spatially order his ...

Link prediction for knowledge graphs aims to predict missing connections between entities. Prevailing methods are limited a transductive setting and hard process unseen The recently proposed subgraph-based models provide alternatives links from the subgraph structure surrounding candidate triplet. However, these require abundant known facts of training triplets perform poorly on relationships t...

conclusions although differences between the two products were very close to each other, they reported similar effects on joint bleeds. further clinical studies should be performed by incorporating a standardized measurement in comparative efficacy of apcc and rfviia. results the mean of bleeding reduction in apcc and rfviia were 71.2% with ci 95% (lower limit 86.8% and upper limit 82%) and 72....

It is well known that a meta-object protocol (MOP) is a powerful mechanism to control the behavior of an application and to implement non-functional requirements such as fault-tolerance and distributed execution. A key feature of these architectures is the strict separation between the application at the base-level and the non-functional concerns at the meta-level. This makes it possible to dev...

this paper deals with the product mix problem using the concept of theory of constraints (toc). theory of constraints is one of the most efficient approaches which have been applied to solve the product mix problem heuristically. although there are numerous heuristic and meta-heuristics to solve this problem, finding the optimal solution in a reasonable time is still a challenging issue. in thi...