Beweisführung am seidenen Bit-String?

Seit über zehn Jahren wird in der rechtswissenschaftlichen Literatur der Beweiswert elektronischer Signaturen diskutiert. Alle bisherigen Abhandlungen sind jedoch rein theoretischer Natur. Auch beschäftigen sie sich nur mit einem Teil der Problematik, indem sie lediglich einen relativ kurzen Zeitpunkt nach der Signaturerzeugung betrachten. Praktische Erfahrungen mit der Beweisführung mittels elektronisch signierter Dokumente fehlen vollständig. Im Forschungsprojekt "ArchiSig" konnten nun erstmals praktische Erfahrungen gewonnen werden, die zur Schließung beider Lücken beitragen können. Der vorliegende Aufsatz stellt die aus einer Simulationsstudie gewonnenen Erkenntnisse tatsächlicher Beweiserhebungen mit elektronisch signierten Dokumenten dar und zeigt Konsequenzen für die sichere Langzeitaufbewahrung auf.

Search for Wieferich Primes through the use of Periodic Binary Strings

The result of the distributed computing projectWieferich@Home is presented: the binary periodic numbers of bit pseudo-length j ≤ 3500 obtained by replication of a bit string of bit pseudo-length k ≤ 24 and increased by one are Wieferich primes only for the cases of 1092 or 3510.

An improved bit parallel exact maximum clique algorithm

This paper describes new improvements for BB-MaxClique (San Segundo et al. in Comput Oper Resour 38(2):571–581, 2011 ), a leading maximum clique algorithm which uses bit strings to efficiently compute basic operations during search by bit masking. Improvements include a recently described recoloring strategy in Tomita et al. (Proceedings of the 4th International Workshop on Algorithms and Computation. Lecture Notes in Computer Science, vol 5942. Springer, Berlin, pp 191–203, 2010 ), which is now integrated in the bit string framework, as well as different optimization strategies for fast bit scanning. Reported results over DIMACS and random graphs show that the new variants improve over previous BB-MaxClique for a vast majority of cases. It is also established that recoloring is mainly useful for graphs with high densities.

Taking Multiple Infections of Cells and Recombination into Account Leads to Small Within-Host Effective-Population-Size Estimates of HIV-1

Whether HIV-1 evolution in infected individuals is dominated by deterministic or stochastic effects remains unclear because current estimates of the effective population size of HIV-1 in vivo, N-e, are widely varying. Models assuming HIV-1 evolution to be neutral estimate N-e similar to 10(2)-10(4), smaller than the inverse mutation rate of HIV-1 (similar to 10(5)), implying the predominance of stochastic forces. In contrast, a model that includes selection estimates N-e>10(5), suggesting that deterministic forces would hold sway. The consequent uncertainty in the nature of HIV-1 evolution compromises our ability to describe disease progression and outcomes of therapy. We perform detailed bit-string simulations of viral evolution that consider large genome lengths and incorporate the key evolutionary processes underlying the genomic diversification of HIV-1 in infected individuals, namely, mutation, multiple infections of cells, recombination, selection, and epistatic interactions between multiple loci. Our simulations describe quantitatively the evolution of HIV-1 diversity and divergence in patients. From comparisons of our simulations with patient data, we estimate N-e similar to 10(3)-10(4), implying predominantly stochastic evolution. Interestingly, we find that N-e and the viral generation time are correlated with the disease progression time, presenting a route to a priori prediction of disease progression in patients. Further, we show that the previous estimate of N-e>10(5) reduces as the frequencies of multiple infections of cells and recombination assumed increase. Our simulations with N-e similar to 10(3)-10(4) may be employed to estimate markers of disease progression and outcomes of therapy that depend on the evolution of viral diversity and divergence.

Optical communication based on the periodic nonlinear Fourier transform signal processing

In this work we introduce the periodic nonlinear Fourier transform (PNFT) and propose a proof-of-concept communication system based on it by using a simple waveform with known nonlinear spectrum (NS). We study the performance (addressing the bit-error-rate (BER), as a function of the propagation distance) of the transmission system based on the use of the PNFT processing method and show the benefits of the latter approach. By analysing our simulation results for the system with lumped amplification, we demonstrate the decent potential of the new processing method.

Periodic nonlinear Fourier transform for fiber-optic communications, Part II:eigenvalue communication

In this paper we propose the design of communication systems based on using periodic nonlinear Fourier transform (PNFT), following the introduction of the method in the Part I. We show that the famous "eigenvalue communication" idea [A. Hasegawa and T. Nyu, J. Lightwave Technol. 11, 395 (1993)] can also be generalized for the PNFT application: In this case, the main spectrum attributed to the PNFT signal decomposition remains constant with the propagation down the optical fiber link. Therefore, the main PNFT spectrum can be encoded with data in the same way as soliton eigenvalues in the original proposal. The results are presented in terms of the bit-error rate (BER) values for different modulation techniques and different constellation sizes vs. the propagation distance, showing a good potential of the technique.

Bit-pattern based integral attack

Integral attacks are well-known to be effective against byte-based block ciphers. In this document, we outline how to launch integral attacks against bit-based block ciphers. This new type of integral attack traces the propagation of the plaintext structure at bit-level by incorporating bit-pattern based notations. The new notation gives the attacker more details about the properties of a structure of cipher blocks. The main difference from ordinary integral attacks is that we look at the pattern the bits in a specific position in the cipher block has through the structure. The bit-pattern based integral attack is applied to Noekeon, Serpent and present reduced up to 5, 6 and 7 rounds, respectively. This includes the first attacks on Noekeon and present using integral cryptanalysis. All attacks manage to recover the full subkey of the final round.