Electronic, Taiwan
Electronic, Taiwan

Time filter

Source Type

Lin T.-S.,National Taiwan University | Lin T.-S.,National Ilan University | Lu C.-Y.,Delin Institute of Technology | Kuo S.-Y.,National Taiwan University
2010 10th IEEE Conference on Nanotechnology, NANO 2010 | Year: 2010

Applications of quantum string matching can be found in quantum signature scheme and quantum fingerprinting. The major benefit of these applications is computation complexity. Quantum Boolean circuits can check the equivalence function: all inputs are quantum digital state. However, it is difficult to verify quantum strings if all input qubits are quantum superposition state. Quantum switching could be reversible circuits. These circuits have two major benefits: information lossless and energy saving. In this paper, we use quantum circuits to design the control module that can verify the equivalence of quantum strings and satisfy the following condition: all inputs qubits could be quantum superposition state. In the proposed circuits, the control module can form a special correlation between input sequence and output sequence. This correlation can design the equivalence function of quantum strings to solve the problem: input strings with superposition. In regard to the performance, the scalability of the proposed circuits can be achieved. ©2010 IEEE.


Lin T.-S.,National Ilan University | Chen Y.,National Taiwan University | Chang T.-H.,National Taiwan University | Lu C.-Y.,Delin Institute of Technology | Kuo S.-Y.,National Taiwan University
14th IEEE International Conference on Nanotechnology, IEEE-NANO 2014 | Year: 2014

Quantum circuit is a reversible circuit that can be designed the control module to derive the correlation between quantum input sequence and quantum output sequence. In addition, in this paper we use the control module of the quantum circuit to verify the equivalence of the quantum state such that quantum blind signature can achieve the security requirement of the signature scheme and resist eavesdropping from the outsider. The core concept of the proposed signature is based on the correlation of quantum entangled state to investigate that the message string and the signatory string is consistent. In regard to the security, the blindness and the failure of eavesdropping can be preserved by this work. The proposed signature can achieve impossibility of forgery and impossibility of disavowal. © 2014 IEEE.


Chen Y.,National Taiwan University | Lin T.-S.,National Ilan University | Chang T.-H.,National Taiwan University | Lu C.-Y.,Delin Institute of Technology | Kuo S.-Y.,National Taiwan University
14th IEEE International Conference on Nanotechnology, IEEE-NANO 2014 | Year: 2014

In the distributed network, quantum teleportation can teleport a quantum state from one quantum device to a remote site by using quantum entangled particles. Quantum entangled particles have the correlation among sharing party of distributed node to form a special relation for transmitting quantum message and classical message. In the paper, we derive a novel quantum key with indirect communication among sharing party. In the deriving process, random measurement outcome can resist eavesdropping from the outsider. An attacker is unable to break a secret quantum key in the deriving process. In addition, several types of attack in the transmission security can be considered in the distributed networks. © 2014 IEEE.


Lu C.-Y.,Delin Institute of Technology | Wang S.-A.,Delin Institute of Technology | Cheng Y.-J.,Chunghwa Telecommunication Laboratories | Kuo S.-Y.,National Taiwan University
International Journal of Quantum Information | Year: 2010

In this paper, we propose a quantum secure direct communication (QSDC) protocol based on EinsteinPodolskyRosen (EPR) pairs. Previous QSDC protocols usually consume one EPR pair to transmit a single qubit. If Alice wants to transmit an n-bit message, she needs at least n/2 EPR pairs when a dense coding scheme is used. In our protocol, if both Alice and Bob preshare 2c + 1 EPR pairs with the trusted server, where c is a constant, Alice can transmit an arbitrary number of qubits to Bob. The 2c EPR pairs are used by Alice and Bob to authenticate each other and the remaining EPR pair is used to encode and decode the message qubit. Thus the total number of EPR pairs used for one communication is a constant no matter how many bits will be transmitted. It is not necessary to transmit EPR pairs before transmitting the secret message except for the preshared constant number of EPR pairs. This reduces both the utilization of the quantum channel and the risk. In addition, after the authentication, the server is not involved in the message transmission. Thus we can prevent the server from knowing the message. © 2010 World Scientific Publishing Company.


Ma Y.-W.,National Cheng Kung University | Chen J.-L.,National Taiwan University of Science and Technology | Kuo S.-Y.,National Taiwan University | Hsieh W.-K.,Delin Institute of Technology | Huang Y.-M.,National Cheng Kung University
International Journal of Network Management | Year: 2012

This work presents novel design schemes for the code gateway between the electronic product code (EPC) and ubiquitous ID (uID) for radio-frequency identification (RFID) technology solutions. Interfaces of the gateway that are implemented include the system interface, EPC discovery service (DS), uID DS, and the certification card mechanism. Five major operations are also developed, including inquiry of EPC DS, uID DS, code diversion mechanism, PIN-IC interface, and code conversion mechanism. Simulation results indicate that in addition to providing codes diversion and conversion, the proposed code gateway achieves low-order conformity between these two systems. Moreover, the implemented EPC DS and uID DS interface provide immediate commodity news and exchange of historical information. In addition to delivering inevitable processing efficiency, the integrated system between these two systems significantly improves ubiquitous computing environments. Copyright © 2011 John Wiley & Sons, Ltd.


Pao T.-L.,Tatung University | Liao W.-Y.,DeLin Institute of Technology | Chen Y.-T.,Tatung University | Wu T.-N.,Tatung University
International Journal of Innovative Computing, Information and Control | Year: 2010

This paper presents a Mandarin audio-visual recognition system dealing with noisy and emotional speech signal. In the proposed approach, we extract the visual features of the lips. These features are very important to the recognition system especially in noisy condition or with emotional effects. In this recognition system, we propose to use the weighted-discrete KNN as the classifier and compare the results with two popular classifiers, the GMM and HMM, and evaluate their performance by applying to a Mandarin audio-visual speech corpus. The experimental results of different classifiers at various SNR levels are presented. The results show that using the WD-KNN classifier yields better recognition accuracy than other classifiers for the used Mandarin speech corpus. © 2010 ICIC International.


Wang S.-A.,Delin Institute of Technology | Lu C.-Y.,Delin Institute of Technology
Proceedings of the IEEE Conference on Nanotechnology | Year: 2013

In this paper, we propose a quantum secure direct communication (QSDC) network architecture based on EPR pairs. This network architecture can implement quantum secure direct communication with intermediate nodes. In this QSDC network architecture, there are several server nodes which are connected with quantum channels and classical channels. An authentication server is used to identify users. The server nodes can generate EPR pairs and deliver the qubits through the quantum channel to the other node. We also propose a QSDC protocol. The users request to share constant number of EPR pairs with the nearest server nodes. The server nodes teleport the sender's qubits to the receiver. The sender can transmit arbitrary number of qubits to the receiver. © 2013 IEEE.


Lu C.-Y.,Delin Institute of Technology | Wang S.-A.,Delin Institute of Technology
Proceedings of the IEEE Conference on Nanotechnology | Year: 2013

At present, only the exhaustive synthesis algorithm can find all the optimal quantum Boolean circuits. It is more difficult to synthesize a more complicated quantum Boolean circuit. In this paper, we use the method of circuit bipartition to partition a more complicated quantum Boolean circuit into simpler circuits in order to reduce the difficulty of the more complicated quantum Boolean circuit synthesis. And find these partitioned quantum Boolean circuits by searched the database of quantum Boolean circuits according the method of the shortest path in the circuit. Finally, combine these partitioned circuits to become the more complicated quantum Boolean circuit. This approach can significantly reduce the synthesis complexity of a more complicated quantum Boolean circuit. We can see that the results are very close to the optimal circuits according to the experimental results of all the 3-variable reversible functions. © 2013 IEEE.


Lu C.-Y.,Delin Institute of Technology | Wang S.-A.,Delin Institute of Technology
2011 International Conference on Multimedia Technology, ICMT 2011 | Year: 2011

An important property of reversible circuits is that they can reduce the energy consumption which is now a big problem for the advanced circuit design. If a circuit is reversible, it can reduce the energy consumption caused by information loss. The tabulation method is more efficient than other simplification methods for combination logic circuits. But the classical tabulation method is not directly applicable to reversible circuits because the basic logic gates, except the NOT gate, are not reversible gates. In this paper, we propose a method to solve the problem so that the tabulation method can be applied to the reversible circuit synthesis. Our algorithm provides a systematic method to simplify the reversible circuit. This can produce the resulting expression in exclusive-sum form and transform it into a final reversible circuit with lower quantum cost. Moreover, we can realize permutations to be reversible circuits with lower quantum cost and without unnecessary garbage bits. We can also convert irreversible circuits by adding qubits to make the circuits reversible. The experimental results show that the average saving in quantum cost is 15.82% compared with previous approaches. © 2011 IEEE.


Wang S.-A.,Delin Institute of Technology | Lu C.-Y.,Delin Institute of Technology
2011 International Conference on Multimedia Technology, ICMT 2011 | Year: 2011

So far there are no synthesis algorithms that can find all the optimal quantum boolean circuits except an exhaustive algorithm. In this paper, we propose a method based on the divide and conquer approach which can significantly improve the performance of the existing synthesis algorithms to synthesize quantum boolean circuits. A quantum boolean circuit is first divided into two subcircuits. The subcircuit with fewer gates will input all possible combinations of m gates excluding those with the same function specification. The other subcircuit can be synthesized by using the existing algorithm. The two subcircuits are combined and then we can choose the most simplified quantum boolean circuit. According to the experimental results of all the 3-variable functions, we can see that the performance of the existing algorithms can be significantly improved by using our method. Therefore the synthesized quantum boolean circuits are much more simplified than previous results. © 2011 IEEE.

Loading Delin Institute of Technology collaborators
Loading Delin Institute of Technology collaborators