TY - JOUR A1 - Koch, Christian A1 - Katharina, Müller A1 - Eldar, Sultanow T1 - Which programming languages do hackers use? BT - A survey at the German Chaos Computer Club N2 - There are numerous articles about the programming languages most commonly used by hackers. Among them, however, there are hardly any scientific studies. One reason might be that hackers mainly operate anonymously and are difficult to reach. This paper aims to shed light on this interesting and relevant research question. In order to find answers, we conducted a survey among the members of the German Chaos Computer Club. As one of the world's largest organisations for information security and hacking, the club provides a good basis for our study. We examine the question of which programming languages are used by hackers as well as the importance of the programming language for their work. The paper offers first insights into the topic and can provide a starting point for further research. KW - Cybersecurity KW - Hacking KW - Programming Language KW - Chaos Computer Club KW - Computersicherheit KW - Programmiersprache KW - Chaos Computer Club Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:92-opus4-9237 SP - 3 EP - 13 PB - arXiv ER - TY - RPRT A1 - Koch, Christian A1 - Sultanow, Eldar A1 - Cox, Sean T1 - Divisions by Two in Collatz Sequences: A Data Science Approach (2nd ed.) BT - Working Paper Technische Hochschule Nürnberg 05 May 2020 N2 - The Collatz conjecture is an unsolved number theory problem. We approach the question by examining the divisions by two that are performed within Collatz sequences. Aside from classical mathematical methods, we use techniques of data science. Based on the analysis of 10,000 sequences we show that the number of divisions by two lies within clear boundaries. Building on the results, we develop and prove an equation to calculate the maximum possible number of divisions by two for any given a Collatz sequence. Whenever this maximum is reached, a sequence leads to the result one, as conjectured by Lothar Collatz. Furthermore, we show how many divisions by two are required for a cycle of a specific length. The findings are valuable for further investigations and could form the basis for a comprehensive proof of the conjecture. KW - Collatz Conjecture KW - Divisions by Two KW - Data Science KW - Collatz-Problem KW - Zahlentheorie KW - Data Science Y1 - 2020 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:92-opus4-6208 ET - 2nd ed. ER - TY - RPRT A1 - Koch, Christian A1 - Sultanow, Eldar A1 - Cox, Sean T1 - Divisions by Two in Collatz Sequences N2 - The Collatz conjecture is an unsolved number theory problem. We approach the question by examining the divisions by two that are performed within Collatz sequences. Aside from classical mathematical methods, we use techniques of data science. Based on the analysis of 10,000 sequences we show that the number of divisions by two lies within clear boundaries. Building on the results, we formulate and prove several theorems on the occurrence of cycles and the termination of Collatz sequences. The findings are useful for further investigations and could form the basis for a comprehensive proof of the conjecture. KW - Collatz Conjecture KW - Number Theory KW - Data Science KW - Collatz-Problem KW - Zahlentheorie KW - Data Science Y1 - 2020 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:92-opus4-6172 ER -