Ruhr-Universität Bochum (RUB): Open Journal Systems
Not a member yet
4280 research outputs found
Sort by
Italian Outdoors – Italian Traces in Berlin.: More than Language: Teaching Italian in Urban and Intercultural Learning Environments
Get PDFDer Kurs „Italiano all’aperto – Tracce italiane a Berlino“ nutzt die Stadt Berlin als Lernraum für eine handlungsorientierte und interdisziplinäre Sprachvermittlung. Im Zentrum stehen italienische Spuren in Kunst, Literatur, Migration und Alltagskultur, die durch Exkursionen, Interviews und ein Fotoprojekt erfahrbar gemacht werden. Die didaktische Konzeption basiert auf Ansätzen der Task-Based Language Learning sowie musealer und urbaner Bildung. Die Evaluation zeigt: Die Verbindung von Sprache und Stadt fördert Motivation, kulturelles Bewusstsein und Sprachpraxis. Der Kurs eignet sich als Modell für andere Sprachen und Städte. Er zeigt exemplarisch, wie Sprachunterricht durch reale Begegnungen und authentische Erfahrungen bereichert werden kann.The course “Italiano all’aperto – Tracce italiane a Berlino” uses the city of Berlin as a learning space for task-based and interdisciplinary language education. Italian traces in art, literature, migration, and everyday culture become tangible through excursions, interviews, and a photo project. The course design is based on task-based language learning as well as museum and urban education. Evaluation results show that combining language learning with the city as a space of experience enhances motivation, cultural awareness, and communicative competence. The course serves as a model for other languages and cities and illustrates how language teaching can be enriched through authentic, real-world experience
AI in Language Teaching: Learning German with ChatGPT
Get PDFKI verändert unser Lernen und Lehren. Welches Wissen und welche Kompetenzen werden zukünftig benötigt und sollten gelehrt werden? Gegenwarts- und Zukunftstechnologien werden schrittweise in die Lehre integriert. In diesem Beitrag werden unterrichtspraktische Anregungen zur Sprachenlehre mit ChatGPT aus dem Bereich Deutsch als Fremdsprache vorgestellt. Der Schwerpunkt liegt auf dem angeleiteten Einsatz von KI durch die Integration in den Unterricht, um sie effektiv für den Spracherwerb einzusetzen. Sprachmodelle (Large Language Models, kurz LLMs) wie ChatGPT eignen sich zur Unterstützung und Strukturierung der Selbstlernphasen und können zum Selbststudium motivieren. Für die Steuerung des Lernprozesses ist eine enge Verzahnung von Unterricht und Selbstlernphasen hilfreich. Lehrende können den Lernprozess begleiten, indem sie verschiedene KI-basierte Lernformen vermitteln und konkrete und individuelle Ergebnisse in den Unterricht einbinden und kritisch beleuchten.AI is changing the way we learn and teach. What knowledge and which type of skill sets will be needed and should be taught in the future? Current and future technologies are gradually being integrated into teaching. In this paper, practical teaching suggestions with ChatGPT using examples from the field of German as a foreign language are presented. The focus is on the guided use of AI within the classroom in order to use it beneficially for language learning. Large Language Models (LLMs) can be particularly useful in motivating self-study and structuring self-learning phases. It is essential for the learning process to closely interlink teaching and self-learning phases. Teachers can support the learning process by teaching different forms of learning with AI and by making concrete and individual results part of the classroom curriculum, critically examining them as they do so
What is it like to be a tetrachromat?
No full textMost people are trichromats, but some people have an extra kind of cone cell in their retinas: they are tetrachromats. Recent science shows that some tetrachromats make distinctions between reflectances that ordinary viewers are unable to detect. This paper asks what kind of colour experience these tetrachromats have. It rejects the claim that they simply see finer gradations of those colours familiar to trichromats. Instead, it draws on both scientific evidence and anecdotal data to argue that tetrachromats’ visual acuity is due to seeing novel colours: elementary colours that trichromat viewers are unable to see or imagine
Is De Brigard a simulationist?
No full textThough De Brigard is generally classified as a simulationist, the relationship of his view to the various theories that have emerged in the simulationist-causalist debate has so far been unclear. He himself seems to think that he has now made that relationship clear: he is a simulationist, but the form of simulationism that he defends “dissolves the conflict” between simulationism and causalism. In this paper, we argue, in response to his recent book and to a recent paper that further develops some of the ideas proposed therein, first, that the view that De Brigard defends does not in fact dissolve the conflict between simulationism and causalism and, second, that he in fact has yet to take a clear stand with respect to the claim that distinguishes simulationism from causalism. While our focus throughout is on De Brigard, our discussion sheds light on the nature of the relationship between simulationism and causalism in general, reveals that certain causalists have, like De Brigard, failed to take a clear stand with respect to the claim that distinguishes simulationism from causalism, and raises more general issues about the nature and future of the simulationist-causalist debate
SoK: Security of the Ascon Modes
Get PDFThe Ascon authenticated encryption scheme and hash function of Dobraunig et al. (Journal of Cryptology 2021) were recently selected as winner of the NIST lightweight cryptography competition. The mode underlying Ascon authenticated encryption (Ascon-AE) resembles ideas of SpongeWrap, but not quite, and various works have investigated the generic security of Ascon-AE, all covering different attack scenarios and with different bounds. This work systematizes knowledge on the mode security of Ascon-AE, and fills gaps where needed. We consider six mainstream security models, all in the multi-user setting: (i) nonce-respecting security, reflecting on the existing bounds of Chakraborty et al. (ASIACRYPT 2023, ACISP 2024) and Lefevre and Mennink (SAC 2024), (ii) nonce-misuse resistance, observing a non-fixable flaw in the proof of Chakraborty et al. (ACISP 2024), (iii) nonce-misuse resilience, delivering missing security analysis, (iv) leakage resilience, delivering a new security analysis that supersedes the informal proof sketch (though in a different model) of Guo et al. (ToSC 2020), (v) state-recovery security, expanding on the analysis of Lefevre and Mennink, and (vi) release of unverified plaintext, also delivering missing security analysis. We also match all bounds with tight attacks (up to constant and up to reasonable assumptions). As a bonus, we systematize the knowledge on Ascon-Hash and Ascon-PRF
Significantly Improved Cryptanalysis of Salsa20 with Two-Round Criteria
Get PDFOver the past decade and a half, cryptanalytic techniques for Salsa20 have been increasingly refined, largely following the overarching concept of Probabilistically Neutral Bits (PNBs) by Aumasson et al. (FSE 2008). In this paper, we present a novel criterion for choosing key-IV pairs using certain 2-round criteria and connect that with clever tweaks of existing techniques related to Probabilistically Independent IV bits (earlier used for ARX ciphers, but not for Salsa20) and well-studied PNBs. Through a detailed examination of the matrix after initial rounds of Salsa20, we introduce the first-ever cryptanalysis of Salsa20 exceeding 8 rounds. Specifically, Salsa20/8.5, consisting of 256 secret key bits, can be cryptanalyzed with a time complexity of 2245.84 and data amounting to 299.47. Further, the sharpness of our attack can be highlighted by showing that Salsa20/8 can be broken with time 2186.01 and data 299.73, which is a significant improvement over the best-known result of Coutinho et al. (Journal of Cryptology, 2023, time 2217.14 and data 2113.14). Here, the refinements related to backward biases for PNBs are also instrumental in achieving the improvements. We also provide certain instances of how these ideas improve the cryptanalysis on 128-bit versions. In the process, a few critical points are raised on some existing state-of-the-art works in this direction, and in those cases, their estimates of time and data are revisited to note the correct complexities, revising the incorrect numbers
Addendum to How Small Can S-boxes Be?
Get PDFIn ToSC 2025(1), Jia et al. proposed an SAT-aided automatic search tool for the S-box design. A part of the functionality of this tool is to search for implementations of an S-box with good area and gate-depth complexity. However, it is well-known that the gate depth complexity cannot precisely reflect the latency of an implementation. To overcome this problem, Rasoolzadeh introduced the concept of latency complexity, a more precise metric for the latency cost of implementing an S-box than the gate depth complexity in the real world.In this addendum, we adapt Jia et al.’s tool to prioritize latency as the primary metric and area as the secondary metric to search for good implementations for existing S-boxes. The results show that the combination of Jia et al.’s tool and Rasoolzadeh’s latency complexity can lead to lower-latency S-box implementations. For S-boxes used in LBlock, Piccolo, SKINNY-64, RECTANGLE, PRESENT and TWINE, which are popular targets in this research line, we find new implementations with lower latency. We conducted synthesis comparisons of the area and latency under multiple standard libraries, where our results consistently outperformed in terms of latency. For example, for LBlock-S0, our solution reduces latency by around 50.0% ∼ 73.8% compared to previous implementations in TSMC 90nm library with the latency-optimized synthesis option
Improving MPCitH with Preprocessing: Mask Is All You Need
Get PDFThe MPC-in-the-head with preprocessing (MPCitH-PP) paradigm presents a novel approach for constructing post-quantum digital signatures like Picnic3. This paper revisits the MPCitH-PP construction, analyzing both its offline and online phases and proposing a reformulation of the protocol. By identifying redundant computations in these phases, we optimize them into a single phase, thereby enhancing the efficiency of MPCitH-PP. Furthermore, we explore the independence of the mask, demonstrating that it can be calculated in parallel, which also enables the optimization of the masked witness calculation.Our optimized implementation of Picnic3 shows significant improvements. At the L1 security level, the optimal software implementation reduces MPCitH-PP calculation time to about 30% of the previous implementation. The optimal signature implementation costs about 78% of the previous implementation time. At the L5 security level, MPCitH-PP with parallelism optimal is reduced to about 26% of the previous solution’s time, and the optimal signature implementation runs at about 53% of the previous solution’s time. For the hardware implementation, our optimizations reduce the clock cycles of MPCitH-PP from r sequential rounds to a single parallel round, where r denotes the number of rounds in the LowMC algorithm, with little change in hardware usage, and perform better in AT product, especially for parallel computing
A Code-Based ISE to Protect Boolean Masking in Software
Get PDFSide-Channel Attacks (SCAs) pose a significant threat to data security in embedded environments. To counteract the power-based SCAs, masking is a widely used defense technique, that introduces randomness to obscure the sidechannel information generated during the processing of secret data. However, in practice, some challenges exist when implementing masking schemes. For example, in the implementation of Boolean masking, they may refer to low noise level and implementation flaws. To address the said implementation challenges, we present an effective and efficient solution that incorporates the code-based masking technique: We mask the shares of Boolean masking with code-based masking and then use a selfdesigned Instruction Set Extension (ISE) to perform efficient private computations within this masked domain. Based on a 32-bit RISC-V Ibex core, we develop a prototype implementation of our ISE, whereby it mainly wraps the ALU with three code-based encoders/decoders and integrates a leakage-resilient pseudo-random generator (PRG). Compared to the base core (vanilla Ibex), the hardware overhead of the ISE implementation is only 8%. The security evaluation based on formal verification and practical evaluation demonstrates that our ISE can provide a more robust practical security guarantee. Furthermore, our approach significantly reduces the signal-to-noise ratio (SNR) of each share, decreasing it to just 2% of the original SNR on the base core