Text-to-MIDI generation offers editable and hierarchical control over symbolic music generation. Previous approaches either convert text into a limited set of musical attributes and generate music based on these attributes, which limits semantic controllability, or use end-to-end models that map text directly to music without deeply aligning the features of both modalities, often resulting in a lack of structural coherence and mismatches in key, meter, and tempo. We propose MIDILM, which addresses these limitations by employing text conditioning with a dual-path decoder that processes textual and musical information through separate feedforward paths following a shared masked self-attention mechanism. On the MidiCaps benchmark, MIDILM outperformed the strongest baseline, with relative improvements ranging from 6.07% on CLAP to 144.77% on TB across semantic alignment and structural metrics. These gains confirm its ability to enhance both semantic controllability and structural coherence. Collectively, we expect that MIDILM will serve as a useful reference framework for future investigations into controllable and structurally faithful cross-modal music generation.

In various applications, such as access to mobile device, web application access, etc., user’s voice biometric authentication is one of the easy and excellent authentication factors for these applications. It can increase user’s usability, be believed to provide enhanced security unlike PINs, and improves customer experience. However, generally, in the authentication process, false acceptance is one of the fatal weaknesses since it leads to system access for the unauthorized person. Especially, in the case of the mobile environment with only a small training dataset, it is very hard to reduce the fault acceptance rate. To address this limitation of user’s voice biometric authentication, in this paper, we propose a novel approach that dramatically reduces the weakness of mis-acceptance from a given deep learning-based voice authentication with a small training dataset. To prove this improvement, we experimentally show that all test samples that were mis-accepted in a given deep learning-based voice authentication trained with a small dataset are correctly validated after applying our technique.

Abstract To perform a quantum brute force attack on a cryptosystem based on Grover's algorithm, it is necessary to implement a quantum circuit of the cryptographic algorithm. Therefore, an efficient quantum circuit design of a given cryptographic algorithm is essential, especially in terms of quantum security analysis, and it is well known that T‐depth should be reduced for time complexity efficiency. In this paper, the authors propose a novel technique to reduce T‐depth (and T‐count) when some quantum circuits located in between two Toffoli‐gates are interchangeable with a controlled phase gate (CP gate), and the authors apply this technique to five types of quantum adders, reducing T‐depth by more than 33%. The authors also present new SHA‐256 quantum circuits which have a critical path with only three quantum adders while the critical paths of quantum circuits in the previous studies consist of seven or 10 quantum adders, and the authors also apply our technique to the proposed SHA‐256 quantum circuits. Four versions of SHA‐256 quantum circuit are presented. Among the previous results, T‐depth of the circuit with the smallest Width (the number of qubits) 801 was approximately 109,104. On the other hand, T‐depth of the proposed SHA‐256 quantum circuit with the Width 797 is 16,055, which is remarkably reduced by about 85%. Another proposed quantum circuit only requires 768 qubits, which is the smallest Width compared to the previous results to the best of our knowledge. Furthermore, one other version is the most time‐efficient circuit with an overall Toffoli‐depth (and T‐depth) that is less than 5000.

Covert communications, or covert channels, are commonly exploited to establish a data exfiltration channel from an insider on a trusted network to a malicious receiver outside the network without using normal communication of the network. It is because the malicious receiver is an unauthorized user of the communication network and so he cannot communicate with any entity in the network. In this study, we construct a new covert wireless unidirectional communication mechanism in an IEEE 802.11 environment. Our covert communication is based on a covert timing channel exploiting the beacon interval of a given commercial-like AP. Because the wireless covert channel we proposed can be implemented only with firmware modification to the WLAN MAC protocol, it is very suitable for application in a real public AP environment. In order to dramatically reduce the chance of covert signals being detected by others, a new and simple covert data encoding scheme, called ping-pong covert timing channel (PPCTC), is proposed, and we show that the covertness of the PPCTC is excellent compared to the previous timing-based covert channels. Although this wireless covert communication is unidirectional communication, since PPCTC has recovery characteristics against consecutive 2-bit errors, stable communication is guaranteed. Furthermore, a covert frame structure is presented for providing the confidentiality and integrity of the information transmitted via our covert channel. To the best of our knowledge, this is the first attempt.

Grover’s search algorithm allows a quantum adversary to find a$k$-bit secret key of a block cipher by making O($2^{k/2}$) block cipher queries. Resistance of a block cipher to such an attack is evaluated by quantum resources required to implement Grover’s oracle for the target cipher. The quantum resources are typically estimated by the$\textit {T}$-depth of its circuit implementation and the number of qubits used by the circuit (width). Since the AES S-box is the only component which requires$\textit {T}$-gates in a quantum implementation of AES, recent research has put its focus on efficient implementation of the AES S-box. However, any efficient implementation with low$\textit {T}$-depth will not be practical in the real world without considering qubit consumption of the implementation. In this work, we propose three methods of trade-off between time and space for the quantum implementation of the AES S-box. In particular, one of our methods turns out to use the smallest number of qubits among the existing methods, significantly reducing its$\textit {T}$-depth.

To create an environment for IoT devices, securely, it is necessary to establish a cryptographic key for those devices. Conventionally, this key has been stored on the actual device, but this leaves the key vulnerable to physical attacks in the IoT environment. To solve this problem, several research studies have been conducted on how best to conceal the cryptographic key. Recently, these studies have most often focused on generating the key dynamically from noisy data using a fuzzy extractor or providing secure storage using a fuzzy commitment. Thus, far, all of these studies use only one type of noisy source data, such as biometric data or physical unclonable function (PUF). However, since most IoT devices are operated in unmanned environments, where biometric data is unavailable, the method using biometric data cannot be utilized for unmanned IoT devices. Although the method using PUF is applied to these unmanned devices, these are still vulnerable against physical attacks including unintended move or theft. In this paper, we present a novel way to use the fuzzy commitment on such devices, called two-factor fuzzy commitment scheme. The proposed method utilizes two noisy factors from the inside and outside of the IoT device. Therefore, although an attacker acquiring the IoT device can access the internal noisy source, the attacker cannot extract the right key from that information only. We also give a prototype implementation for ensuring the feasibility of our two-factor fuzzy commitment concept by utilizing the image data and PUF data for two noisy factors.

Document filter extracts text of UTF-16, Unicode or UTF-8 format from documents files of smart device. The extracted text is used at viewer and index search of smart device. This paper researches document filter of text based smart device files. The result of this research is useful to develop the mobile device search, which lets you find easily all your docs, pdf, text and email on smart device.

The IVEF protocol developed by IALA is focused on the technical implementation. But, It does not contain the description of the information encryption for IVEF protocol data protection. The vessel traffic information is high sensitive information. So a necessary part of the absolute reliability of the information client and data security. This paper suggests the authentication protocol to increase the security of the VTS systems using the main certification server and IVEF.

Abstract Batch verification is a method to verify multiple digital signatures at a batch in time less than total individual verification time. Batch verification for an identity‐based signature scheme (IBS) is attractive because a short public identity such as an e‐mail address can be used as a verification key. In this paper, we first review the recent IBS scheme proposed by Shim and its batch verifier to show that the batch verifier is vulnerable to a forgery attack. In order to resist to the attack, we propose a new efficient batch verifier for the IBS scheme. The proposed batch verifier can deal with arbitrary number of signatures as a batch. We prove formally that the proposed batch verifier is secure. Then, we analyze the computation cost of the proposed batch verifier using concrete parameters and compare it with well‐known batch verifiers. The comparison shows that our batch verifier can significantly outperform the existing batch verifiers in computation. We finally present a one‐round three‐party identity‐based key agreement protocol as an application of our batch verifier, which requires only three pairing operations in verification. Copyright © 2015 John Wiley & Sons, Ltd.

In this paper, we study exponentiation in the specific finite fields F, with very special exponents such as those that occur in algorithms for computing square roots. Here, q is a prime power, q = pk, where k > 1, and k is odd. Our algorithmic approach improves the corresponding exponentiation resulted from the better rewritten exponent. To the best of our knowledge, it is the first major improvement to the Tonelli-Shanks algorithm, for example, the number of multiplications can be reduced to at least 60 percent on the average when p= 1 (mod 16). Several numerical examples are given that show the speedup of the proposed methods.

Mobile RFID (Radio Frequency Identification) is a new application to use mobile phone as RFID reader with a wireless technology and provides new valuable services to user by integrating RFID and ubiquitous sensor network infrastructure with mobile communication and wireless internet. However, there are an increasing number of concerns, and even some resistances, related to consumer tracking and profiling using RFID technology. Therefore, in this paper, we describe the security analysis and implementation leveraging globally networked mobile RFID service which complies with the Korea’s mobile RFID forum standard.