Apparatus and method for preventing message exposure from attack caused by false disavowal of receiver by using true random number of arbitrator in arbitrator-based quantum signature technique

Abstract

According to various embodiments of the present disclosure, an operation method of a third node in a communication system is provided, the method comprising the steps of: sharing information of a first secret symmetric key with a first node; sharing information of a second secret symmetric key with a second node; generating first random-number information for quantum-state conversion of a first message qubit; transmitting, to the first node, first information generated by encrypting the first random-number information on the basis of the first secret symmetric key; and receiving, from the second node, second information generated by encrypting signature information and first converted-message information on the basis of the second secret symmetric key.

Description

Device and method for preventing message exposure from an attack due to a receiver's false denial by using a true random number of an arbitrator in an arbitrator-based quantum signature technique

[0001] The present disclosure relates to a device and method for preventing message exposure from an attack due to a false repudiation by a receiver using a true random number of an arbitrator in an arbitrator-based quantum signature technique. Specifically, the present disclosure relates to a device and method for a quantum signature technique utilizing the unique properties of quantum mechanics. Specifically, in a quantum signature technique for non-repudiation, authentication, and prevention of forgery of message information transmitted between a sender and a receiver, the present disclosure relates to a device and method for preventing non-repudiation and message exposure in a case where Bob, a verifier of signature information, denies having received a correct message and signature information and passed the verification process, and falsely claims to have received an incorrect message and signature information from the sender.

[0002]

[0003] In the existing arbitrator-based quantum signature technique, when there is an attack due to false denial by the receiver Bob, no one can determine whether the receiver is lying, so the attack cannot be defended against, and the security of the message exposed in this case cannot be guaranteed.

[0004] Existing quantum signature techniques also deal with methods to prevent denial by the receiver, but this means that in quantum signature techniques, the passing of a signature means that the receiver, Bob, received the signature information from Alice, encrypted it with a secret symmetric key that only he and the arbitrator have, transmitted it to the arbitrator, and then received the information required for verification, decrypted it with the same symmetric key, and completed the verification. Therefore, Bob cannot deny that he received the signature information and transmitted it to the arbitrator. However, there may be cases where Bob claims that he received incorrect signature information and failed the verification even though he received the correct signature information from Alice and the verification result was correct.

[0005] Specifically, in a conventional arbitrator-based quantum signature, Bob receives a qubit message from the sender and generated using information received from the mediator. Despite this match, Bob is falsely In this case, the existing arbitrator-based quantum signature scheme can be used to determine whether Bob received the correct signature from Alice but is lying, or whether Alice intentionally generated a different message and then sent incorrect signature information. Neither Alice, Bob, nor the arbitrator involved in signing can determine whether the receiver has determined the message. Therefore, if Bob makes a false denial, none of the users, including the arbitrators involved, can resolve the dispute, so Bob's false denial is always possible. In this process, an attacker can delay the system operation by making a false denial on the receiver and obtain the correct message information. There is also a possibility that it can be taken over.

[0006]

[0007] To solve the above-described problem, the present disclosure provides a device and method for preventing message exposure from an attack due to a false denial of a recipient by using a real random number of an arbitrator in an arbitrator-based quantum signature technique.

[0008] The present disclosure provides a device and method for a quantum signature technique utilizing the unique properties of quantum mechanics.

[0009] The present disclosure provides a device and method for preventing repudiation and message exposure in a quantum signature technique for preventing repudiation, authentication, and forgery of message information transmitted between a sender and a receiver, in a case where Bob, a verifier of signature information, denies having received a correct message and signature information and passed the verification process, and falsely states that he received an incorrect message and signature information from the sender.

[0010] The technical problems to be achieved in the present disclosure are not limited to the technical problems mentioned above, and other technical problems not mentioned can be clearly understood by a person having ordinary skill in the technical field to which the present disclosure belongs from the description below.

[0011]

[0012] According to various embodiments of the present disclosure, a method of operating a third node in a communication system is provided, the method comprising: sharing information of a first secret symmetric key with a first node; sharing information of a second secret symmetric key with a second node; generating first random number information for quantum state transformation of a first message qubit; transmitting first information generated by encrypting the first random number information based on the first secret symmetric key to the first node; and receiving second information generated by encrypting signature information and first transformation message information based on the second secret symmetric key from the second node.

[0013] According to various embodiments of the present disclosure, a method of operating a first node in a communication system is provided, the method comprising: sharing information of a first secret symmetric key with a third node; sharing information of a third secret symmetric key with a second node; generating a first message qubit; and receiving, from the third node, first information encrypted based on the first secret symmetric key with respect to first random number information for quantum state conversion of the first message qubit.

[0014] According to various embodiments of the present disclosure, a method of operating a second node in a communication system is provided, the method comprising: sharing information of a second secret symmetric key with a third node; sharing information of a third secret symmetric key with a first node; receiving signature information and first transformation message information from the first node; transmitting second information encrypted based on the second secret symmetric key with respect to the signature information and the first transformation message information to the third node; receiving third information encrypted based on the second secret symmetric key with respect to the first transformation message information, a result of a first verification, a second message qubit, GHZ state (Greenberger-Horne-Zeilinger state) information of the third node, and a Bell state measurement result from the third node; decrypting the third information to obtain the first transformation message information, the result of the first verification, the second message qubit, the GHZ state information, and the Bell state measurement result; and determining whether the signature information is secure, including forgery, based on the result of the first verification.

[0015] According to various embodiments of the present disclosure, in a communication system, a third node is provided, comprising: a transceiver; at least one processor; and at least one memory operably connectable to the at least one processor and storing instructions that, when executed by the at least one processor, perform operations, wherein the operations include all steps of a method of operating the third node according to various embodiments of the present disclosure.

[0016] According to various embodiments of the present disclosure, in a communication system, a third node is provided, comprising: a first node; a transceiver; at least one processor; and at least one memory operably connectable to the at least one processor and storing instructions that, when executed by the at least one processor, perform operations, wherein the operations include all steps of a method of operating a third node according to various embodiments of the present disclosure.

[0017] According to various embodiments of the present disclosure, in a communication system, a second node is provided, comprising: a transceiver; at least one processor; and at least one memory operably connectable to the at least one processor and storing instructions that, when executed by the at least one processor, perform operations, wherein the operations include all steps of a method of operating the second node according to various embodiments of the present disclosure.

[0018]

[0019] In order to solve the above-described problem, the present disclosure can provide a device and method for preventing message exposure from an attack due to a false denial of a recipient by using a real random number of an arbitrator in an arbitrator-based quantum signature technique.

[0020] The present disclosure can provide a device and method for a quantum signature technique utilizing the unique properties of quantum mechanics.

[0021] The present disclosure provides a device and method for preventing repudiation and message exposure in a quantum signature technique for preventing repudiation, authentication, and forgery of message information transmitted between a sender and a receiver, in a case where Bob, a verifier of signature information, denies having received a correct message and signature information and passed the verification process, and falsely states that he received an incorrect message and signature information from the sender.

[0022]

[0023] The accompanying drawings are intended to aid in understanding the present disclosure and, together with detailed descriptions, may provide embodiments of the present disclosure. However, the technical features of the present disclosure are not limited to specific drawings, and the features disclosed in each drawing may be combined with each other to form new embodiments. Reference numerals in each drawing may indicate structural elements.

[0024] Figure 1 is a diagram illustrating an example of physical channels and general signal transmission used in a 3GPP system.

[0025] Figure 2 is a diagram illustrating the system structure of a New Generation Radio Access Network (NG-RAN).

[0026] Figure 3 is a diagram illustrating the functional division between NG-RAN and 5GC.

[0027] Figure 4 is a diagram illustrating an example of a 5G usage scenario.

[0028] Figure 5 is a diagram illustrating an example of a communication structure that can be provided in a 6G system.

[0029] Figure 6 is a schematic diagram illustrating an example of a perceptron structure.

[0030] Figure 7 is a schematic diagram illustrating an example of a multilayer perceptron structure.

[0031] Figure 8 is a schematic diagram illustrating an example of a deep neural network.

[0032] Figure 9 is a schematic diagram illustrating an example of a convolutional neural network.

[0033] Figure 10 is a schematic diagram illustrating an example of a filter operation in a convolutional neural network.

[0034] Figure 11 is a schematic diagram illustrating an example of a neural network structure in which a recurrent loop exists.

[0035] Figure 12 is a diagram schematically illustrating an example of the operating structure of a recurrent neural network.

[0036] Figure 13 is a diagram illustrating an example of the electromagnetic spectrum.

[0037] Figure 14 is a diagram illustrating an example of a THz communication application.

[0038] Fig. 15 is a diagram illustrating an example of an electronic component-based THz wireless communication transmitter and receiver.

[0039] FIG. 16 is a diagram illustrating an example of a method for generating a THz signal based on an optical element.

[0040] Fig. 17 is a diagram illustrating an example of an optical element-based THz wireless communication transceiver.

[0041] Fig. 18 is a diagram illustrating the structure of a photon source-based transmitter.

[0042] Figure 19 is a drawing showing the structure of an optical modulator.

[0043] FIG. 20 is a diagram illustrating an example of an existing direct signature technique in a system applicable to the present disclosure.

[0044] FIG. 21 is a diagram illustrating an example of an existing arbitrator-based signature technique in a system applicable to the present disclosure.

[0045] FIG. 22 is a diagram illustrating an example of an arbitrator-based quantum signature technique using an existing GHZ state in a system applicable to the present disclosure.

[0046] FIG. 23 is a diagram illustrating the initial stages of a quantum signature technique based on an arbitrator using a GHZ state in a system applicable to the present disclosure.

[0047] Fig. 24 is a system applicable to the present disclosure. This is a diagram showing an example of the operator application rules for generating .

[0048] FIG. 25 is a diagram illustrating an example of an arbitrator-based quantum signature technique using GHZ state to counter false denial of a receiver in a system applicable to the present disclosure.

[0049] FIG. 26 is a flowchart illustrating a quantum signature technique based on an arbitrator using a GHZ state to counter false denial by a receiver in a system applicable to the present disclosure.

[0050] FIG. 27 is a diagram illustrating an example of an arbitrator-based quantum signature technique using Bell states to counter false denial by a receiver in a system applicable to the present disclosure.

[0051] FIG. 28 is a flowchart illustrating a quantum signature technique based on an arbitrator using Bell states to counter false denial by a receiver in a system applicable to the present disclosure.

[0052] FIG. 29 is a diagram illustrating an example of the operation process of a third node in a system applicable to the present disclosure.

[0053] FIG. 30 is a diagram illustrating an example of the operation process of the first node in a system applicable to the present disclosure.

[0054] FIG. 31 is a diagram illustrating an example of the operation process of a second node in a system applicable to the present disclosure.

[0055] FIG. 32 illustrates a communication system (1) applicable to various embodiments of the present disclosure.

[0056] FIG. 33 illustrates a wireless device that can be applied to various embodiments of the present disclosure.

[0057] FIG. 34 illustrates another example of a wireless device that can be applied to various embodiments of the present disclosure.

[0058] Figure 35 illustrates a signal processing circuit for a transmission signal.

[0059] FIG. 36 illustrates another example of a wireless device applicable to various embodiments of the present disclosure.

[0060] FIG. 37 illustrates a mobile device applicable to various embodiments of the present disclosure.

[0061] FIG. 38 illustrates a vehicle or autonomous vehicle applicable to various embodiments of the present disclosure.

[0062] FIG. 39 illustrates a vehicle applicable to various embodiments of the present disclosure.

[0063] FIG. 40 illustrates an XR device applicable to various embodiments of the present disclosure.

[0064] FIG. 41 illustrates a robot applicable to various embodiments of the present disclosure.

[0065] FIG. 42 illustrates an AI device applicable to various embodiments of the present disclosure.

[0066]

[0067] In various embodiments of the present disclosure, “A or B” may mean “only A,” “only B,” or “both A and B.” In other words, in various embodiments of the present disclosure, “A or B” may be interpreted as “A and / or B.” For example, in various embodiments of the present disclosure, “A, B or C” may mean “only A,” “only B,” “only C,” or “any combination of A, B and C.”

[0068] In various embodiments of the present disclosure, a slash ( / ) or a comma may mean "and / or." For example, "A / B" may mean "A and / or B." Accordingly, "A / B" may mean "only A," "only B," or "both A and B." For example, "A, B, C" may mean "A, B, or C."

[0069] In various embodiments of the present disclosure, “at least one of A and B” may mean “only A,” “only B,” or “both A and B.” Furthermore, in various embodiments of the present disclosure, the expressions “at least one of A or B” or “at least one of A and / or B” may be interpreted as equivalent to “at least one of A and B.”

[0070] Additionally, in various embodiments of the present disclosure, “at least one of A, B and C” can mean “only A,” “only B,” “only C,” or “any combination of A, B and C.” Additionally, “at least one of A, B or C” or “at least one of A, B and / or C” can mean “at least one of A, B and C.”

[0071] Additionally, parentheses used in various embodiments of the present disclosure may mean "for example." Specifically, when indicated as "control information (PDCCH)", "PDCCH" may be proposed as an example of "control information." In other words, "control information" in various embodiments of the present disclosure is not limited to "PDCCH", and "PDDCH" may be proposed as an example of "control information." Furthermore, even when indicated as "control information (i.e., PDCCH)", "PDCCH" may be proposed as an example of "control information."

[0072] Technical features individually described in a single drawing in various embodiments of the present disclosure may be implemented individually or simultaneously.

[0073]

[0074] The following technologies can be used in various wireless access systems, such as CDMA, FDMA, TDMA, OFDMA, and SC-FDMA. CDMA can be implemented using wireless technologies such as UTRA (Universal Terrestrial Radio Access) or CDMA2000. TDMA can be implemented using wireless technologies such as GSM (Global System for Mobile communications) / GPRS (General Packet Radio Service) / EDGE (Enhanced Data Rates for GSM Evolution). OFDMA can be implemented using wireless technologies such as IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802-20, and E-UTRA (Evolved UTRA). UTRA is a part of UMTS (Universal Mobile Telecommunications System). 3GPP (3rd Generation Partnership Project) LTE (Long Term Evolution) is a part of E-UMTS (Evolved UMTS) that uses E-UTRA, and LTE-A (Advanced) / LTE-A pro is an evolved version of 3GPP LTE. 3GPP NR (New Radio or New Radio Access Technology) is an evolved version of 3GPP LTE / LTE-A / LTE-A pro. 3GPP 6G may be an evolved version of 3GPP NR.

[0075]

[0076] For clarity, the description is based on 3GPP communication systems (e.g., LTE, NR, etc.), but the technical spirit of the present disclosure is not limited thereto. LTE refers to technology after 3GPP TS 36.xxx Release 8. Specifically, LTE technology after 3GPP TS 36.xxx Release 10 is referred to as LTE-A, and LTE technology after 3GPP TS 36.xxx Release 13 is referred to as LTE-A pro. 3GPP NR refers to technology after TS 38.xxx Release 15. 3GPP 6G may refer to technology after TS Release 17 and / or Release 18. “xxx” refers to a standard document detail number. LTE / NR / 6G may be collectively referred to as a 3GPP system. For background technology, terms, abbreviations, etc. used in the description of the present disclosure, reference may be made to matters described in standard documents published prior to the present disclosure. For example, reference may be made to the following documents.

[0077]

[0078] 3GPP LTE

[0079] - 36.211: Physical channels and modulation

[0080] - 36.212: Multiplexing and channel coding

[0081] - 36.213: Physical layer procedures

[0082] - 36.300: Overall description

[0083] - 36.331: Radio Resource Control (RRC)

[0084] 3GPP NR

[0085] - 38.211: Physical channels and modulation

[0086] - 38.212: Multiplexing and channel coding

[0087] - 38.213: Physical layer procedures for control

[0088] - 38.214: Physical layer procedures for data

[0089] - 38.300: NR and NG-RAN Overall Description

[0090] - 38.331: Radio Resource Control (RRC) protocol specification

[0091]

[0092] Physical Channel and Frame Structure

[0093] Physical channels and general signal transmission

[0094] Figure 1 is a diagram illustrating an example of physical channels and general signal transmission used in a 3GPP system.

[0095] In a wireless communication system, a terminal receives information from a base station via the downlink (DL) and transmits it to the base station via the uplink (UL). The information transmitted and received between the base station and the terminal includes data and various control information, and various physical channels exist depending on the type and purpose of the information being transmitted and received.

[0096]

[0097] When a terminal is powered on or enters a new cell, it performs an initial cell search operation, such as synchronizing with the base station (S11). To this end, the terminal receives a Primary Synchronization Signal (PSS) and a Secondary Synchronization Signal (SSS) from the base station to synchronize with the base station and obtain information such as a cell ID. Afterwards, the terminal can receive a Physical Broadcast Channel (PBCH) from the base station to obtain broadcast information within the cell. Meanwhile, the terminal can receive a Downlink Reference Signal (DL RS) during the initial cell search phase to check the downlink channel status.

[0098]

[0099] A terminal that has completed initial cell search can obtain more specific system information by receiving a physical downlink control channel (PDCCH) and a physical downlink shared channel (PDSCH) based on information contained in the PDCCH (S12).

[0100]

[0101] Meanwhile, when accessing a base station for the first time or when there are no radio resources for signal transmission, the terminal may perform a random access procedure (RACH) for the base station (S13 to S16). To this end, the terminal may transmit a specific sequence as a preamble via a physical random access channel (PRACH) (S13 and S15) and receive a response message (RAR (Random Access Response) message) to the preamble via a PDCCH and a corresponding PDSCH. In the case of a contention-based RACH, a contention resolution procedure may additionally be performed (S16).

[0102]

[0103] The terminal that has performed the procedure described above can then perform PDCCH / PDSCH reception (S17) and physical uplink shared channel (PUSCH) / physical uplink control channel (PUCCH) transmission (S18) as general uplink / downlink signal transmission procedures. In particular, the terminal can receive downlink control information (DCI) through the PDCCH. Here, the DCI includes control information such as resource allocation information for the terminal, and different formats can be applied depending on the purpose of use.

[0104]

[0105] Meanwhile, the control information that the terminal transmits to the base station via the uplink or that the terminal receives from the base station may include downlink / uplink ACK / NACK signals, CQI (Channel Quality Indicator), PMI (Precoding Matrix Index), RI (Rank Indicator), etc. The terminal may transmit the above-described control information such as CQI / PMI / RI via PUSCH and / or PUCCH.

[0106]

[0107] Structure of uplink and downlink channels

[0108] Downlink channel structure

[0109] The base station transmits a related signal to the terminal through a downlink channel described below, and the terminal receives the related signal from the base station through a downlink channel described below.

[0110]

[0111] (1) Physical Downlink Shared Channel (PDSCH)

[0112] PDSCH carries downlink data (e.g., DL-shared channel transport block, DL-SCH TB) and applies modulation methods such as Quadrature Phase Shift Keying (QPSK), 16 Quadrature Amplitude Modulation (QAM), 64 QAM, and 256 QAM. Codewords are generated by encoding the TBs. PDSCH can carry multiple codewords. Scrambling and modulation mapping are performed for each codeword, and modulation symbols generated from each codeword are mapped to one or more layers (Layer mapping). Each layer is mapped to resources along with a Demodulation Reference Signal (DMRS), generated as an OFDM symbol signal, and transmitted through the corresponding antenna port.

[0113]

[0114] (2) Physical downlink control channel (PDCCH)

[0115] The PDCCH carries downlink control information (DCI) and employs modulation methods such as QPSK. A PDCCH consists of 1, 2, 4, 8, or 16 Control Channel Elements (CCEs), depending on the Aggregation Level (AL). Each CCE is comprised of six Resource Element Groups (REGs). Each REG is defined by one OFDM symbol and one (P)RB.

[0116] The UE obtains DCI transmitted via the PDCCH by performing decoding (also known as blind decoding) on ​​a set of PDCCH candidates. The set of PDCCH candidates decoded by the UE is defined as a PDCCH search space set. The search space set may be a common search space or a UE-specific search space. The UE can obtain DCI by monitoring PDCCH candidates within one or more search space sets established by the MIB or higher layer signaling.

[0117]

[0118] Uplink channel structure

[0119] The terminal transmits a related signal to the base station through the uplink channel described below, and the base station receives the related signal from the terminal through the uplink channel described below.

[0120] (1) Physical Uplink Shared Channel (PUSCH)

[0121] PUSCH carries uplink data (e.g., UL-shared channel transport block, UL-SCH TB) and / or uplink control information (UCI), and is transmitted based on a CP-OFDM (Cyclic Prefix - Orthogonal Frequency Division Multiplexing) waveform, a DFT-s-OFDM (Discrete Fourier Transform - spread - Orthogonal Frequency Division Multiplexing) waveform, etc. When the PUSCH is transmitted based on a DFT-s-OFDM waveform, the UE transmits the PUSCH by applying transform precoding. For example, when transform precoding is disabled (e.g., transform precoding is disabled), the UE transmits the PUSCH based on the CP-OFDM waveform, and when transform precoding is enabled (e.g., transform precoding is enabled), the UE can transmit the PUSCH based on the CP-OFDM waveform or the DFT-s-OFDM waveform. PUSCH transmissions can be dynamically scheduled by UL grants in DCI, or semi-statically scheduled (configured grant) based on higher layer (e.g., RRC) signaling (and / or Layer 1 (L1) signaling (e.g., PDCCH)). PUSCH transmissions can be performed in a codebook-based or non-codebook-based manner.

[0122] (2) Physical Uplink Control Channel (PUCCH)

[0123] PUCCH carries uplink control information, HARQ-ACK and / or scheduling request (SR), and can be divided into multiple PUCCHs depending on the PUCCH transmission length.

[0124]

[0125] Below, we describe new radio access technology (new RAT, NR).

[0126] As more and more communication devices demand greater communication capacity, the need for improved mobile broadband communication compared to existing radio access technology (RAT) is emerging. Furthermore, massive Machine Type Communications (MTC), which connects numerous devices and objects to provide various services anytime, anywhere, is also a key issue to be considered in next-generation communication. Furthermore, communication system design that considers reliability and latency-sensitive services / terminals is being discussed. The introduction of next-generation radio access technologies that take into account enhanced mobile broadband communication, massive MTC, and URLLC (Ultra-Reliable and Low Latency Communication) is being discussed, and in various embodiments of the present disclosure, these technologies are conveniently referred to as new RAT or NR.

[0127]

[0128] Figure 2 is a diagram illustrating the system structure of a New Generation Radio Access Network (NG-RAN).

[0129] Referring to FIG. 2, the NG-RAN may include a gNB and / or an eNB that provides user plane and control plane protocol termination to the UE. FIG. 1 illustrates a case where only a gNB is included. The gNB and eNB are connected to each other via an Xn interface. The gNB and eNB are connected to the 5th generation core network (5G Core Network: 5GC) via the NG interface. More specifically, the gNB is connected to the access and mobility management function (AMF) via the NG-C interface, and the gNB is connected to the user plane function (UPF) via the NG-U interface.

[0130]

[0131] Figure 3 is a diagram illustrating the functional division between NG-RAN and 5GC.

[0132] Referring to FIG. 3, the gNB can provide functions such as inter-cell radio resource management (Inter Cell RRM), radio bearer management (RB control), connection mobility control (Connection Mobility Control), radio admission control (Radio Admission Control), measurement configuration and provision, and dynamic resource allocation. The AMF can provide functions such as NAS security and idle state mobility processing. The UPF can provide functions such as mobility anchoring and PDU processing. The SMF (Session Management Function) can provide functions such as terminal IP address allocation and PDU session control.

[0133]

[0134] Figure 4 is a diagram illustrating an example of a 5G usage scenario.

[0135] The 5G usage scenario illustrated in FIG. 4 is merely exemplary, and the technical features of various embodiments of the present disclosure can also be applied to other 5G usage scenarios not illustrated in FIG. 4.

[0136] Referring to Figure 4, the three key requirement areas for 5G include (1) enhanced mobile broadband (eMBB), (2) massive machine type communication (mMTC), and (3) ultra-reliable and low latency communications (URLLC). Some use cases may require optimization across multiple areas, while others may focus on just one key performance indicator (KPI). 5G supports these diverse use cases in a flexible and reliable manner.

[0137] eMBB focuses on improving data speeds, latency, user density, and overall capacity and coverage of mobile broadband connections. It targets throughputs of around 10 Gbps. eMBB significantly exceeds basic mobile internet access, enabling rich interactive experiences, media and entertainment applications in the cloud, and augmented reality. Data is a key driver of 5G, and for the first time, dedicated voice services may not be available in the 5G era. In 5G, voice is expected to be handled as an application, simply using the data connection provided by the communication system. The increased traffic volume is primarily due to the increasing content size and the growing number of applications that require high data rates. Streaming services (audio and video), interactive video, and mobile internet connectivity will become more prevalent as more devices connect to the internet. Many of these applications require always-on connectivity to push real-time information and notifications to users. Cloud storage and applications are rapidly growing on mobile communication platforms, and this can be applied to both work and entertainment. Cloud storage is a particular use case driving the growth of uplink data rates. 5G is also used for remote work in the cloud, requiring significantly lower end-to-end latency to maintain a superior user experience when tactile interfaces are used. In entertainment, for example, cloud gaming and video streaming are other key factors driving the demand for mobile broadband. Entertainment is essential on smartphones and tablets, regardless of location, including in highly mobile environments like trains, cars, and airplanes. Another use case is augmented reality and information retrieval for entertainment, where augmented reality requires extremely low latency and instantaneous data volumes.

[0138] mMTC is designed to enable communication between a large number of low-cost, battery-powered devices, supporting applications such as smart metering, logistics, field, and body sensors. mMTC targets a battery life of approximately 10 years and / or a population of approximately 1 million devices per square kilometer. mMTC enables seamless connectivity of embedded sensors across all sectors and is one of the most anticipated 5G use cases. The number of IoT devices is projected to reach 20.4 billion by 2020. Industrial IoT is one area where 5G will play a key role, enabling smart cities, asset tracking, smart utilities, agriculture, and security infrastructure.

[0139] URLLC is ideal for vehicle communications, industrial control, factory automation, remote surgery, smart grids, and public safety applications by enabling devices and machines to communicate with high reliability, very low latency, and high availability. URLLC targets latency on the order of 1 ms. URLLC encompasses new services that will transform industries through ultra-reliable, low-latency links, such as remote control of critical infrastructure and autonomous vehicles. This level of reliability and latency is essential for smart grid control, industrial automation, robotics, and drone control and coordination.

[0140] Next, we will look more specifically at a number of usage examples included within the triangle in Fig. 4.

[0141] 5G can complement fiber-to-the-home (FTTH) and cable-based broadband (or DOCSIS) by delivering streams rated at hundreds of megabits per second to gigabits per second. These high speeds may be required to deliver TV at resolutions beyond 4K (6K, 8K, and beyond), as well as virtual reality (VR) and augmented reality (AR). VR and AR applications include near-immersive sports events. Certain applications may require specialized network configurations. For example, for VR gaming, a gaming company may need to integrate its core servers with the network operator's edge network servers to minimize latency.

[0142] Automotive is expected to be a significant new driver for 5G, with numerous use cases for in-vehicle mobile communications. For example, passenger entertainment demands both high capacity and high mobile broadband, as future users will consistently expect high-quality connectivity regardless of their location and speed. Another automotive application is augmented reality dashboards. An AR dashboard allows drivers to identify objects in the dark on top of what they see through the windshield. The AR dashboard overlays information to inform the driver about the distance and movement of objects. In the future, wireless modules will enable vehicle-to-vehicle communication, information exchange between vehicles and supporting infrastructure, and information exchange between vehicles and other connected devices (e.g., devices accompanying pedestrians). Safety systems can guide drivers to safer driving behaviors, reducing the risk of accidents. The next step will be remotely controlled or autonomous vehicles, which require highly reliable and fast communication between different autonomous vehicles and / or between vehicles and infrastructure. In the future, autonomous vehicles will perform all driving tasks, leaving drivers to focus solely on traffic anomalies that the vehicle itself cannot detect. The technological requirements for autonomous vehicles will require ultra-low latency and ultra-high-speed reliability, increasing traffic safety to levels unattainable by humans.

[0143] Smart cities and smart homes, often referred to as smart societies, will be embedded with dense wireless sensor networks. A distributed network of intelligent sensors will identify conditions for cost- and energy-efficient maintenance of cities or homes. Similar setups can be implemented for individual homes. Temperature sensors, window and heating controllers, burglar alarms, and appliances will all be wirelessly connected. Many of these sensors typically require low data rates, low power, and low cost. However, for example, real-time HD video may be required from certain types of devices for surveillance purposes.

[0144] The consumption and distribution of energy, including heat and gas, are becoming increasingly decentralized, requiring automated control of distributed sensor networks. Smart grids interconnect these sensors using digital information and communication technologies to collect and act on information. This information can include the behavior of suppliers and consumers, enabling smart grids to improve efficiency, reliability, economic efficiency, sustainable production, and the automated distribution of fuels like electricity. Smart grids can also be viewed as another low-latency sensor network.

[0145] The health sector has numerous applications that can benefit from mobile communications. Telecommunications systems can support telemedicine, which provides clinical care in remote locations. This can help reduce distance barriers and improve access to health services that are otherwise unavailable in remote rural areas. It can also be used to save lives in critical care and emergency situations. Mobile-based wireless sensor networks can provide remote monitoring and sensors for parameters such as heart rate and blood pressure.

[0146] Wireless and mobile communications are becoming increasingly important in industrial applications. Wiring is expensive to install and maintain. Therefore, the potential to replace cables with reconfigurable wireless links presents an attractive opportunity for many industries. However, achieving this requires wireless connections to operate with similar latency, reliability, and capacity to cables, while simplifying their management. Low latency and extremely low error rates are new requirements for 5G connectivity.

[0147] Logistics and freight tracking are important use cases for mobile communications, enabling the tracking of inventory and packages anywhere using location-based information systems. Logistics and freight tracking typically require low data rates but may require wide-range and reliable location information.

[0148] Hereinafter, examples of next-generation communications (e.g., 6G) that can be applied to various embodiments of the present disclosure will be described.

[0149]

[0150] 6G system in general

[0151] The 6G (wireless communication) system aims to achieve (i) very high data rates per device, (ii) a very large number of connected devices, (iii) global connectivity, (iv) very low latency, (v) low energy consumption for battery-free IoT devices, (vi) ultra-reliable connectivity, and (vii) connected intelligence with machine learning capabilities. The vision of the 6G system can be divided into four aspects: intelligent connectivity, deep connectivity, holographic connectivity, and ubiquitous connectivity, and the 6G system can satisfy the requirements as shown in Table 1 below. In other words, Table 1 is a table showing an example of the requirements of a 6G system.

[0152]

[0153] Per device peak data rate1TbpsE2E latency1msMaximum spectral efficiency100bps / HzMobility supportUp to 1000km / hrSatellite integrationFullyAIFullyAutonomous vehicleFullyXRFullyHaptic CommunicationFully

[0154] 6G systems can have key factors such as enhanced mobile broadband (eMBB), ultra-reliable low latency communications (URLLC), massive machine-type communication (mMTC), AI integrated communication, tactile internet, high throughput, high network capacity, high energy efficiency, low backhaul and access network congestion, and enhanced data security.

[0155]

[0156] Figure 5 is a diagram illustrating an example of a communication structure that can be provided in a 6G system.

[0157] 6G systems are expected to have 50 times the simultaneous wireless connectivity of 5G systems. URLLC, a key feature of 5G, will become even more crucial in 6G communications by providing end-to-end latency of less than 1 ms. 6G systems will have significantly higher volumetric spectral efficiency, compared to the commonly used area spectral efficiency. 6G systems can offer extremely long battery life and advanced battery technologies for energy harvesting, eliminating the need for separate charging for mobile devices in 6G systems. New network characteristics in 6G may include:

[0158] - Satellite integrated network: 6G is expected to integrate with satellites to provide a global mobile network. The integration of terrestrial, satellite, and airborne networks into a single wireless communications system is crucial for 6G.

[0159] Connected Intelligence: Unlike previous generations of wireless communication systems, 6G is revolutionary, upgrading the wireless evolution from "connected objects" to "connected intelligence." AI can be applied at every stage of the communication process (or at every signal processing step, as described below).

[0160] - Seamless integration of wireless information and energy transfer: 6G wireless networks will transfer power to charge the batteries of devices such as smartphones and sensors. Therefore, wireless information and energy transfer (WIET) will be integrated.

[0161] - Ubiquitous super 3D connectivity: Access to networks and core network functions of drones and very low Earth orbit satellites will create super 3D connectivity in 6G ubiquitous.

[0162] Some general requirements for the new network characteristics of 6G, such as the above, may be as follows:

[0163] - Small cell networks: The concept of small cell networks was introduced to improve received signal quality in cellular systems by increasing throughput, energy efficiency, and spectral efficiency. Consequently, small cell networks are essential for 5G and beyond-5G (5GB) communication systems. Accordingly, 6G communication systems also adopt the characteristics of small cell networks.

[0164] Ultra-dense heterogeneous networks: Ultra-dense heterogeneous networks will be another key feature of 6G communication systems. Multi-tier networks comprised of heterogeneous networks improve overall QoS and reduce costs.

[0165] High-capacity backhaul: Backhaul connections are characterized by high-capacity backhaul networks to support high-volume traffic. High-speed fiber optics and free-space optics (FSO) systems may be potential solutions to this problem.

[0166] - Radar technology integrated with mobile technology: High-precision localization (or location-based services) through communications is a key feature of 6G wireless communication systems. Therefore, radar systems will be integrated with 6G networks.

[0167] - Softwarization and virtualization: Softwarization and virtualization are two critical features that form the foundation of the design process for 5GB networks to ensure flexibility, reconfigurability, and programmability. Furthermore, billions of devices can be shared on a shared physical infrastructure.

[0168]

[0169] Core implementation technology of 6G systems

[0170]

[0171] Artificial Intelligence

[0172] The most crucial and newly introduced technology for 6G systems is AI. 4G systems did not involve AI. 5G systems will support partial or very limited AI. However, 6G systems will fully support AI for automation. Advances in machine learning will create more intelligent networks for real-time communications in 6G. Incorporating AI into communications can streamline and improve real-time data transmission. AI can use numerous analyses to determine how complex target tasks should be performed. In other words, AI can increase efficiency and reduce processing delays.

[0173] Time-consuming tasks such as handover, network selection, and resource scheduling can be performed instantly using AI. AI can also play a crucial role in machine-to-machine (M2M), machine-to-human, and human-to-machine communications. Furthermore, AI can facilitate rapid communication in brain-computer interfaces (BCIs). AI-based communication systems can be supported by metamaterials, intelligent structures, intelligent networks, intelligent devices, intelligent cognitive radios, self-sustaining wireless networks, and machine learning.

[0174] Recent attempts to integrate AI into wireless communication systems have focused on the application layer, network layer, and especially deep learning in wireless resource management and allocation. However, this research is increasingly evolving to the MAC layer and physical layer, with attempts to combine deep learning with wireless transmission, particularly at the physical layer. AI-based physical layer transmission refers to the application of AI-based signal processing and communication mechanisms, rather than traditional communication frameworks, in the fundamental signal processing and communication mechanisms. For example, this may include deep learning-based channel coding and decoding, deep learning-based signal estimation and detection, deep learning-based MIMO mechanisms, and AI-based resource scheduling and allocation.

[0175] Machine learning can be used for channel estimation and channel tracking, as well as for power allocation and interference cancellation in the physical layer of the downlink (DL). Furthermore, machine learning can be used for antenna selection, power control, and symbol detection in MIMO systems.

[0176] However, the application of DNN for transmission at the physical layer may have the following problems.

[0177] Deep learning-based AI algorithms require a large amount of training data to optimize training parameters. However, due to limitations in obtaining training data from specific channel environments, a large amount of training data is used offline. This means that static training on training data in specific channel environments can lead to conflicts with the dynamic characteristics and diversity of the wireless channel.

[0178] Furthermore, current deep learning primarily targets real-world signals. However, signals at the physical layer of wireless communications are complex signals. Further research is needed on neural networks that detect complex-domain signals to match the characteristics of wireless communication signals.

[0179] Below, we will look at machine learning in more detail.

[0180] Machine learning refers to a series of operations that train machines to perform tasks that humans can or cannot perform. Machine learning requires data and a learning model. Data learning methods in machine learning can be broadly categorized into three types: supervised learning, unsupervised learning, and reinforcement learning.

[0181] Neural network training aims to minimize output errors. It involves repeatedly inputting training data into a neural network, calculating the neural network output and target error for the training data, and backpropagating the neural network error from the output layer to the input layer to update the weights of each node in the neural network to reduce the error.

[0182] Supervised learning uses labeled training data, while unsupervised learning may not have labeled training data. For example, in the case of supervised learning for data classification, the training data may be data in which each training data category is labeled. Labeled training data is input to a neural network, and the error can be calculated by comparing the output (categories) of the neural network with the training data labels. The calculated error is backpropagated through the neural network in the backward direction (i.e., from the output layer to the input layer), and the connection weights of each node in each layer of the neural network can be updated through backpropagation. The amount of change in the connection weights of each updated node can be determined by the learning rate. The neural network's calculation of the input data and the backpropagation of the error can constitute a learning cycle (epoch). The learning rate can be applied differently depending on the number of iterations of the neural network's learning cycle. For example, in the early stages of training a neural network, a high learning rate can be used to quickly allow the network to achieve a certain level of performance, thereby increasing efficiency. In the later stages of training, a low learning rate can be used to increase accuracy.

[0183] Learning methods may vary depending on the characteristics of the data. For example, if the goal is to accurately predict data transmitted by a transmitter in a communication system, supervised learning is preferable to unsupervised learning or reinforcement learning.

[0184] The learning model corresponds to the human brain, and the most basic linear model can be thought of, but the machine learning paradigm that uses highly complex neural network structures, such as artificial neural networks, as learning models is called deep learning.

[0185] The neural network cores used in learning methods are mainly divided into deep neural networks (DNN), convolutional deep neural networks (CNN), and recurrent boltzmann machines (RNN).

[0186] An artificial neural network is an example of a network of multiple perceptrons.

[0187]

[0188] Figure 6 is a schematic diagram illustrating an example of a perceptron structure.

[0189] Referring to Fig. 6, when an input vector x=(x1,x2,...,xd) is input, the entire process of multiplying each component by a weight (W1,W2,...,Wd), adding up all the results, and then applying the activation function σ(·) is called a perceptron. A large-scale artificial neural network structure can extend the simplified perceptron structure illustrated in Fig. 6 to apply the input vector to perceptrons of different dimensions. For convenience of explanation, input values ​​or output values ​​are called nodes.

[0190] Meanwhile, the perceptron structure illustrated in Fig. 6 can be explained as consisting of a total of three layers based on input and output values. An artificial neural network in which there are H perceptrons of (d+1) dimensions between the 1st layer and the 2nd layer, and K perceptrons of (H+1) dimensions between the 2nd layer and the 3rd layer can be expressed as in Fig. 7.

[0191]

[0192] Figure 7 is a schematic diagram illustrating an example of a multilayer perceptron structure.

[0193] The layer where the input vector is located is called the input layer, the layer where the final output value is located is called the output layer, and all layers located between the input layer and the output layer are called hidden layers. The example in Fig. 7 shows three layers, but when counting the number of layers in an actual artificial neural network, the input layer is excluded, so it can be viewed as a total of two layers. An artificial neural network is composed of perceptrons, which are basic blocks, connected in two dimensions.

[0194] The aforementioned input, hidden, and output layers can be applied jointly not only to multilayer perceptrons but also to various artificial neural network structures, such as CNNs and RNNs, which will be described later. The greater the number of hidden layers, the deeper the artificial neural network. The machine learning paradigm that uses sufficiently deep artificial neural networks as learning models is called deep learning. Furthermore, the artificial neural network used for deep learning is called a deep neural network (DNN).

[0195]

[0196] Figure 8 is a schematic diagram illustrating an example of a deep neural network.

[0197] The deep neural network illustrated in Figure 8 is a multilayer perceptron consisting of eight hidden layers and eight output layers. The multilayer perceptron structure is referred to as a fully connected neural network. In a fully connected neural network, there is no connection between nodes located in the same layer, and there is a connection only between nodes located in adjacent layers. DNN has a fully connected neural network structure and is composed of a combination of multiple hidden layers and activation functions, and can be usefully applied to identify correlation characteristics between inputs and outputs. Here, the correlation characteristic can mean the joint probability of inputs and outputs.

[0198] Meanwhile, depending on how multiple perceptrons are connected to each other, various artificial neural network structures different from the aforementioned DNN can be formed.

[0199]

[0200] Figure 9 is a schematic diagram illustrating an example of a convolutional neural network.

[0201] In DNN, nodes within a single layer are arranged vertically in a one-dimensional manner. However, Fig. 9 can assume a case where nodes are arranged two-dimensionally, with w nodes in width and h nodes in height (the convolutional neural network structure of Fig. 9). In this case, since a weight is added to each connection in the connection process from one input node to the hidden layer, a total of hΥw weights must be considered. Since there are hΥw nodes in the input layer, a total of h2w2 weights are required between two adjacent layers.

[0202] The convolutional neural network of Fig. 9 has a problem in that the number of weights increases exponentially according to the number of connections. Therefore, instead of considering the connections of all modes between adjacent layers, it assumes that there are small filters, and performs weighted sum and activation function operations on the overlapping portions of the filters, as in Fig. 10.

[0203]

[0204] Figure 10 is a schematic diagram illustrating an example of a filter operation in a convolutional neural network.

[0205] Each filter has a weight corresponding to the number of its size, and weight learning can be performed so that a specific feature on the image can be extracted as a factor and output. In Fig. 10, a filter of size 3Y3 is applied to the upper left 3Y3 region of the input layer, and the output value resulting from performing weighted sum and activation function operations on the corresponding node is stored in z22.

[0206] The above filter performs weighted sum and activation function operations while moving at a certain horizontal and vertical interval while scanning the input layer, and places the output value at the current filter position. This operation method is similar to the convolution operation for images in the field of computer vision, so a deep neural network with this structure is called a convolutional neural network (CNN), and the hidden layer generated as a result of the convolution operation is called a convolutional layer. In addition, a neural network with multiple convolutional layers is called a deep convolutional neural network (DCNN).

[0207] In the convolutional layer, the number of weights can be reduced by calculating a weighted sum that includes only the nodes located in the area covered by the filter, starting from the node where the current filter is located. This allows a single filter to focus on features within a local area. Accordingly, CNNs can be effectively applied to image data processing where physical distance in a two-dimensional area is an important criterion for judgment. Meanwhile, CNNs can apply multiple filters immediately before the convolutional layer, and can generate multiple output results through the convolution operation of each filter.

[0208] Meanwhile, depending on the data properties, there may be data for which sequence characteristics are important. Considering the length variability and chronological relationship of such sequence data, a structure that applies a method of inputting one element of the data sequence at each timestep and inputting the output vector (hidden vector) of the hidden layer output at a specific timestep together with the immediately following element in the sequence is called a recurrent neural network structure.

[0209]

[0210] Figure 11 is a schematic diagram illustrating an example of a neural network structure in which a recurrent loop exists.

[0211] Referring to Figure 11, a recurrent neural network (RNN) is a structure that inputs elements (x1(t), x2(t), ,..., xd(t)) of a data sequence at a time point t into a fully connected neural network, and then inputs the hidden vectors (z1(t-1), z2(t-1),..., zH(t-1)) of the immediately preceding time point t-1 together and applies a weighted sum and activation function. The reason for transmitting the hidden vector to the next time point in this way is because the information in the input vectors of the preceding time points is considered to be accumulated in the hidden vector of the current time point.

[0212]

[0213] Figure 12 is a diagram schematically illustrating an example of the operating structure of a recurrent neural network.

[0214] Referring to Figure 12, the recurrent neural network operates in a predetermined order of time for the input data sequence.

[0215] When the input vector (x1(t), x2(t), ,..., xd(t)) at time point 1 is input to the recurrent neural network, the hidden vector (z1(1), z2(1),..., zH(1)) is input together with the input vector (x1(2), x2(2),..., xd(2)) at time point 2, and the vector (z1(2), z2(2),..., zH(2)) of the hidden layer is determined through a weighted sum and an activation function. This process is repeatedly performed until time points 2, 3, ,,, T.

[0216] Meanwhile, when multiple hidden layers are placed within a recurrent neural network, it is called a deep recurrent neural network (DRNN). Recurrent neural networks are designed to be useful for processing sequence data (e.g., natural language processing).

[0217] It is a neural network core used in a learning manner, and includes various deep learning techniques such as DNN, CNN, RNN, Restricted Boltzmann Machine (RBM), Deep Belief Network (DBN), and Deep Q-Network, and can be applied to fields such as computer vision, speech recognition, natural language processing, and speech / signal processing.

[0218] Recent attempts to integrate AI into wireless communication systems have focused on the application layer, network layer, and especially deep learning in wireless resource management and allocation. However, this research is increasingly evolving to the MAC layer and physical layer, with attempts to combine deep learning with wireless transmission, particularly at the physical layer. AI-based physical layer transmission refers to the application of AI-based signal processing and communication mechanisms, rather than traditional communication frameworks, in the fundamental signal processing and communication mechanisms. For example, this may include deep learning-based channel coding and decoding, deep learning-based signal estimation and detection, deep learning-based MIMO mechanisms, and AI-based resource scheduling and allocation.

[0219] THz (Terahertz) communication

[0220] Data rates can be increased by increasing bandwidth. This can be achieved by utilizing sub-THz communications with wide bandwidths and applying advanced massive MIMO technology. THz waves, also known as sub-millimeter waves, typically refer to the frequency range between 0.1 THz and 10 THz, with corresponding wavelengths ranging from 0.03 mm to 3 mm. The 100 GHz to 300 GHz band (sub-THz band) is considered a key part of the THz band for cellular communications. Adding the sub-THz band to the mmWave band will increase the capacity of 6G cellular communications. Among the defined THz bands, 300 GHz to 3 THz lies in the far infrared (IR) frequency band. While part of the optical band, the 300 GHz to 3 THz band lies at the boundary of the optical band, immediately following the RF band. Therefore, this 300 GHz to 3 THz band exhibits similarities to RF.

[0221]

[0222] Figure 13 is a diagram illustrating an example of the electromagnetic spectrum.

[0223] Key characteristics of THz communications include (i) the widely available bandwidth to support very high data rates and (ii) the high path loss that occurs at high frequencies (requiring highly directional antennas). The narrow beamwidths generated by highly directional antennas reduce interference. The small wavelength of THz signals allows for a significantly larger number of antenna elements to be integrated into devices and base stations operating in this band. This enables the use of advanced adaptive array technologies to overcome range limitations.

[0224] Optical wireless technology

[0225] OWC technology is designed for 6G communications, in addition to RF-based communications for all possible device-to-access networks. These networks connect to network-to-backhaul / fronthaul networks. OWC technology has already been used in 4G communication systems, but it will be used more widely to meet the demands of 6G communication systems. OWC technologies such as light fidelity, visible light communication, optical camera communication, and wideband-based FSO communication are already well-known. Communications based on optical wireless technology can provide very high data rates, low latency, and secure communications. LiDAR can also be used for ultra-high-resolution 4D mapping in 6G communications based on wideband.

[0226] FSO backhaul network

[0227] The transmitter and receiver characteristics of an FSO system are similar to those of a fiber-optic network. Therefore, data transmission in an FSO system is similar to that of a fiber-optic system. Therefore, FSO can be a promising technology for providing backhaul connectivity in 6G systems, in conjunction with fiber-optic networks. Using FSO, ultra-long-distance communications are possible, even over distances exceeding 10,000 km. FSO supports high-capacity backhaul connectivity for remote and non-remote areas, such as the ocean, space, underwater, and isolated islands. FSO also supports cellular base station (BS) connections.

[0228] Massive MIMO technology

[0229] One of the key technologies for improving spectral efficiency is the application of MIMO technology. As MIMO technology improves, spectral efficiency also improves. Therefore, massive MIMO technology will be crucial in 6G systems. Because MIMO technology utilizes multiple paths, multiplexing technology must be considered to ensure that data signals can be transmitted along more than one path, as well as beam generation and operation technologies suitable for the THz band.

[0230] Blockchain

[0231] Blockchain will become a crucial technology for managing massive amounts of data in future communication systems. Blockchain is a form of distributed ledger technology. A distributed ledger is a database distributed across numerous nodes or computing devices. Each node replicates and stores an identical copy of the ledger. Blockchains are managed by a peer-to-peer network and can exist without being managed by a central authority or server. Data on a blockchain is collected and organized into blocks. Blocks are linked together and protected using cryptography. Blockchain perfectly complements large-scale IoT with its inherently enhanced interoperability, security, privacy, reliability, and scalability. Therefore, blockchain technology offers several features, such as interoperability between devices, traceability of large amounts of data, autonomous interaction with other IoT systems, and the massive connectivity stability of 6G communication systems.

[0232] 3D networking

[0233] 6G systems integrate terrestrial and airborne networks to support vertically expanded user communications. 3D BS will be provided via low-orbit satellites and UAVs. Adding a new dimension in altitude and associated degrees of freedom, 3D connections differ significantly from existing 2D networks.

[0234] Quantum communication

[0235] Unsupervised reinforcement learning holds promise in the context of 6G networks. Supervised learning approaches cannot label the massive amounts of data generated by 6G networks. Unsupervised learning does not require labeling. Therefore, this technology can be used to autonomously build representations of complex networks. Combining reinforcement learning and unsupervised learning allows for truly autonomous network operation.

[0236] drone

[0237] Unmanned Aerial Vehicles (UAVs), or drones, will be a key element in 6G wireless communications. In most cases, high-speed wireless connections will be provided using UAV technology. BS entities are installed on UAVs to provide cellular connectivity. UAVs offer specific capabilities not found in fixed BS infrastructure, such as easy deployment, robust line-of-sight links, and controlled mobility. During emergencies such as natural disasters, deploying terrestrial communication infrastructure is not economically feasible, and sometimes, volatile environments make it impossible to provide services. UAVs can easily handle these situations. UAVs will become a new paradigm in wireless communications. This technology facilitates three fundamental requirements for wireless networks: enhanced mobile broadband (eMBB), URLLC, and mMTC. UAVs can also support various purposes, such as enhancing network connectivity, fire detection, disaster emergency services, security and surveillance, pollution monitoring, parking monitoring, and accident monitoring. Therefore, UAV technology is recognized as one of the most important technologies for 6G communications.

[0238] Cell-free Communication

[0239] Tight integration of multiple frequencies and heterogeneous communication technologies is crucial in 6G systems. As a result, users will be able to seamlessly move from one network to another without requiring any manual configuration on their devices. The best network will be automatically selected from available communication technologies. This will break the limitations of the cell concept in wireless communications. Currently, user movement from one cell to another in dense networks results in excessive handovers, resulting in handover failures, handover delays, data loss, and a ping-pong effect. 6G cell-free communications will overcome all of these challenges and provide better QoS. Cell-free communications will be achieved through multi-connectivity and multi-tier hybrid technologies, as well as heterogeneous radios on devices.

[0240] Integration of wireless information and energy transmission

[0241] WIET uses the same fields and waves as wireless communication systems. Specifically, sensors and smartphones will be charged using wireless power transfer during communication. WIET is a promising technology for extending the life of battery-powered wireless systems. Therefore, battery-less devices will be supported by 6G communications.

[0242] Integration of sensing and communication

[0243] Autonomous wireless networks are capable of continuously sensing dynamically changing environmental conditions and exchanging information between different nodes. In 6G, sensing will be tightly integrated with communications to support autonomous systems.

[0244] Integration of Access Backhaul Networks

[0245] In 6G, the density of access networks will be enormous. Each access network will be connected to backhaul connections, such as fiber optics and FSO networks. To accommodate the massive number of access networks, there will be tight integration between access and backhaul networks.

[0246] Holographic beam forming

[0247] Beamforming is a signal processing procedure that adjusts an antenna array to transmit a wireless signal in a specific direction. It is a subset of smart antennas or advanced antenna systems. Beamforming technology offers several advantages, including high signal-to-noise ratio, interference avoidance and rejection, and high network efficiency. Holographic beamforming (HBF) is a novel beamforming method that differs significantly from MIMO systems because it uses software-defined antennas. HBF will be a highly effective approach for efficient and flexible signal transmission and reception in multi-antenna communication devices in 6G.

[0248] Big data analysis

[0249] Big data analytics is a complex process for analyzing diverse, large-scale data sets, or "big data." This process uncovers hidden data, unknown correlations, and customer trends, ensuring complete data management. Big data is collected from various sources, such as video, social networks, images, and sensors. This technology is widely used to process massive amounts of data in 6G systems.

[0250] Large Intelligent Surface (LIS)

[0251] THz-band signals have strong linearity, which can create many shadow areas due to obstacles. LIS technology, which enables expanded communication coverage, enhanced communication stability, and additional value-added services by installing LIS near these shadow areas, is becoming increasingly important. LIS is an artificial surface made of electromagnetic materials that can alter the propagation of incoming and outgoing radio waves. While LIS can be viewed as an extension of massive MIMO, it differs from massive MIMO in its array structure and operating mechanism. Furthermore, LIS operates as a reconfigurable reflector with passive elements, passively reflecting signals without using active RF chains, which offers the advantage of low power consumption. Furthermore, because each passive reflector in LIS must independently adjust the phase shift of the incoming signal, this can be advantageous for wireless communication channels. By appropriately adjusting the phase shift via the LIS controller, the reflected signal can be collected at the target receiver to boost the received signal power.

[0252]

[0253] Terahertz (THz) wireless communications in general

[0254]

[0255] THz wireless communication uses THz waves with a frequency of approximately 0.1 to 10 THz (1 THz = 1012 Hz), and can refer to terahertz (THz) band wireless communication using a very high carrier frequency of 100 GHz or higher. THz waves are located between the RF (Radio Frequency) / millimeter (mm) and infrared bands, and (i) compared to visible light / infrared light, they penetrate non-metallic / non-polarizable materials well, and compared to RF / millimeter waves, they have a shorter wavelength, so they have high linearity and can focus beams. In addition, since the photon energy of THz waves is only a few meV, they have the characteristic of being harmless to the human body. The frequency bands expected to be used for THz wireless communication may be the D-band (110 GHz to 170 GHz) or H-band (220 GHz to 325 GHz), which have low propagation loss due to molecular absorption in the air. Discussions on standardization of THz wireless communication are being centered around the IEEE 802.15 THz working group in addition to 3GPP, and standard documents issued by the IEEE 802.15 Task Group (TG3d, TG3e) may specify or supplement the contents described in various embodiments of the present disclosure. THz wireless communication can be applied to wireless cognition, sensing, imaging, wireless communication, THz navigation, etc.

[0256]

[0257] Figure 14 is a diagram illustrating an example of a THz communication application.

[0258] As illustrated in Figure 14, THz wireless communication scenarios can be categorized into macro networks, micro networks, and nanoscale networks. In macro networks, THz wireless communication can be applied to vehicle-to-vehicle and backhaul / fronthaul connections. In micro networks, THz wireless communication can be applied to fixed point-to-point or multi-point connections, such as indoor small cells, wireless connections in data centers, and near-field communications, such as kiosk downloads.

[0259] Table 2 below shows examples of technologies that can be used in THz waves.

[0260] Transceivers DeviceAvailable immature: UTC-PD, RTD and SBDModulation and CodingLow order modulation techniques (OOK, QPSK), LDPC, Reed Soloman, Hamming, Polar, TurboAntennaOmni and Directional, phased array with low number of antenna elementsBandwidth69GHz (or 23 GHz) at 300GHzChannel modelsPartiallyData rate100GbpsOutdoor deploymentNoFree space lossHighCoverageLowRadio Measurements300GHz indoorDevice sizeFew micrometers

[0261] THz wireless communications can be categorized based on the methods used to generate and receive THz waves. THz generation methods can be categorized as either optical or electronic-based.

[0262]

[0263] Fig. 15 is a diagram illustrating an example of an electronic component-based THz wireless communication transmitter and receiver.

[0264] Methods for generating THz using electronic components include a method using semiconductor components such as a resonant tunneling diode (RTD), a method using a local oscillator and a multiplier, a MMIC (Monolithic Microwave Integrated Circuits) method using an integrated circuit based on a compound semiconductor HEMT (High Electron Mobility Transistor), and a method using a Si-CMOS-based integrated circuit. In the case of Fig. 15, a multiplier (doubler, tripler, multiplier) is applied to increase the frequency, and it passes through a subharmonic mixer and is radiated by an antenna. Since the THz band forms a high frequency, a multiplier is essential. Here, the multiplier is a circuit that has an output frequency that is N times that of the input, and matches it to the desired harmonic frequency and filters out all remaining frequencies. In addition, beamforming can be implemented by applying an array antenna or the like to the antenna of Fig. 15. In Fig. 15, IF represents intermediate frequency, tripler and multiplexer represent multipliers, PA represents power amplifier, LNA represents low noise amplifier, and PLL represents phase-locked loop.

[0265]

[0266] FIG. 16 is a diagram illustrating an example of a method for generating a THz signal based on an optical element.

[0267] Fig. 17 is a diagram illustrating an example of an optical element-based THz wireless communication transceiver.

[0268] Optical component-based THz wireless communication technology refers to a method of generating and modulating THz signals using optical components. Optical component-based THz signal generation technology generates an ultra-high-speed optical signal using a laser and an optical modulator, and converts it into a THz signal using an ultra-high-speed photodetector. Compared to technologies that use only electronic components, this technology can easily increase the frequency, generate high-power signals, and obtain flat response characteristics over a wide frequency band. As illustrated in Figure 16, optical component-based THz signal generation requires a laser diode, a wideband optical modulator, and an ultra-high-speed photodetector. In the case of Figure 16, the light signals of two lasers with different wavelengths are combined to generate a THz signal corresponding to the wavelength difference between the lasers. In Fig. 16, an optical coupler refers to a semiconductor device that transmits an electrical signal using optical waves to provide electrical isolation and coupling between circuits or systems, and a UTC-PD (Uni-Travelling Carrier Photo-Detector) is a type of photodetector that uses electrons as active carriers and reduces the travel time of electrons with bandgap grading. The UTC-PD is capable of detecting light at 150 GHz or higher. In Fig. 17, an EDFA (Erbium-Doped Fiber Amplifier) ​​represents an erbium-doped fiber amplifier, a PD (Photo Detector) represents a semiconductor device that can convert an optical signal into an electrical signal, an OSA represents an optical module (Optical Sub Assembly) that modularizes various optical communication functions (photoelectric conversion, electro-optical conversion, etc.) into a single component, and a DSO represents a digital storage oscilloscope.

[0269]

[0270] The structure of a photoelectric converter (or photoelectric converter) is described with reference to FIGS. 18 and 19.

[0271] Fig. 18 is a diagram illustrating the structure of a photon source-based transmitter.

[0272] Figure 19 is a drawing showing the structure of an optical modulator.

[0273] In general, the phase of a signal can be changed by passing the optical source of a laser through an optical wave guide. At this time, data is loaded by changing the electrical characteristics through a microwave contact, etc. Therefore, the optical modulator output is formed as a modulated waveform. An opto-electrical modulator (O / E converter) can generate THz pulses by optical rectification operation by a nonlinear crystal, photoelectric conversion by a photoconductive antenna, emission from a bunch of relativistic electrons, etc. Terahertz pulses generated in the above manner can have a length in units of femtoseconds to picoseconds. An optical / electronic converter (O / E converter) performs down conversion by utilizing the non-linearity of the device.

[0274] Considering the THz spectrum usage, it is likely that THz systems will use multiple contiguous gigahertz bands for fixed or mobile service purposes. Based on the outdoor scenario criteria, the available bandwidth can be classified based on the oxygen attenuation of 10^2 dB / km in the spectrum up to 1 THz. Accordingly, a framework in which the available bandwidth is composed of multiple band chunks can be considered. As an example of the above framework, if the THz pulse length for one carrier is set to 50 ps, ​​the bandwidth (BW) becomes approximately 20 GHz.

[0275] Effective down-conversion from the infrared band (IR band) to the terahertz band (THz band) depends on how to utilize the nonlinearity of the optical / electrical converter (O / E converter). In other words, to down-convert to the desired terahertz band (THz band), it is necessary to design an optical / electrical converter (O / E converter) with the most ideal non-linearity for transferring to the corresponding terahertz band (THz band). If an optical / electrical converter (O / E converter) that is not suitable for the target frequency band is used, errors are likely to occur in the amplitude and phase of the corresponding pulse.

[0276] In a single-carrier system, a terahertz transmission and reception system can be implemented using a single optical-to-electrical converter. Depending on the channel environment, in a multi-carrier system, the number of optical-to-electrical converters may be equal to the number of carriers. This phenomenon will be particularly noticeable in a multi-carrier system that utilizes multiple broadbands according to the aforementioned spectrum usage plan. In this regard, a frame structure for the multi-carrier system may be considered. A signal down-converted using an optical-to-electrical converter may be transmitted in a specific resource region (e.g., a specific frame). The frequency region of the specific resource region may include multiple chunks. Each chunk may be composed of at least one component carrier (CC).

[0277]

[0278] Specific descriptions of various embodiments of the present disclosure

[0279] Hereinafter, various embodiments of the present disclosure will be described in more detail.

[0280]

[0281] The present disclosure relates to a device and method for a quantum signature technique based on an arbitrator utilizing the unique properties of quantum.

[0282]

[0283] Background to various embodiments of the present disclosure

[0284] Digital signature technology provides a solution that guarantees message integrity, message authentication, and non-repudiation, excluding confidentiality, among the four goals of information security. Existing authentication techniques cannot respond when trust between the parties exchanging information is broken. Therefore, digital signature technology is necessary, providing third-party verification for dispute resolution, authentication of the origin of message content, and verification of forgery.

[0285]

[0286] FIG. 20 is a diagram illustrating an example of an existing direct signature technique in a system applicable to the present disclosure.

[0287] Existing electronic signature techniques

[0288] Existing electronic signature techniques can be broadly divided into direct signature techniques and intermediary-based signature techniques. Direct signature techniques, as shown in Figure 20, utilize a digital signature structure where only the sender and receiver exist. They are primarily modeled using public-key cryptography algorithms and hash functions. The recipient is assumed to possess the sender's public key, and the entire message or hash is signed with the sender's private key and decrypted with the recipient's public key. ElGamal signatures and discrete logarithm-based public key algorithms are representative electronic signature techniques that follow this method. However, the validity of these electronic signature techniques depends on the security of the sender's private key. The sender can claim that their private key has been lost or stolen, and theft of the sender's private key still exists, ultimately requiring third-party intervention. Therefore, while offering the advantage of structural simplicity, they may be difficult to apply in environments requiring extremely high security.

[0289]

[0290] FIG. 21 is a diagram illustrating an example of an existing arbitrator-based signature technique in a system applicable to the present disclosure.

[0291] To solve this problem, an arbitrator-based quantum signature technique was introduced, and unlike the direct signature technique, an arbitrator is introduced. That is, this signature technique is a model that uses a common cryptographic algorithm and an arbitrator, and the arbitrator performs the role of verifying the validity of the signed message. Therefore, the arbitrator must maintain neutrality and require appropriate trust, and can be implemented with either a private key or a public key algorithm. This technique can secure a higher level of information security than the direct signature technique, but it still has the problem of a more complex configuration due to the use of an arbitrator, and the reliability of the arbitrator must always be maintained. Figure 21 shows an example of the signature process of a quantum signature method using a symmetric key-based cryptosystem and an unconditionally trustworthy arbitrator (TTP). First, Alice generates a message m and generates a hash value H using her own hash function h. Then, she uses the secret key K shared with the arbitrator. A It is encrypted and sent to the arbitrator. The arbitrator who receives it then decrypts it with the same key and uses the key K that only he has. T and sends it back to Alice. Alice sends the signature information S and the message m to Bob. Next, Bob encrypts the received signature information with his and the arbitrator's secret key K. B The message is encrypted and sent to the arbitrator, and the message is kept by Bob. The arbitrator uses his private keys to recover H included in the signature information, encrypts it with KB, and sends it back to Bob. Based on this, Bob determines whether the signature is passed by checking whether H' generated from his message m matches H. In other words, the electronic signature technique consists of three stages: an initialization stage where a symmetric key is shared, a stage where signature information is generated from a message, and a stage where Bob performs signature verification with the help of an arbitrator after transmitting the signature information.

[0292]

[0293] Quantum electronic signature technique

[0294] Quantum electronic signature techniques can ensure unconditional security by leveraging the characteristics of quantum mechanics. Similar to existing electronic signature technologies, they can be categorized into quantum one-time signatures, which consist of a quantum one-way function and a combination of private and public keys, and arbitrated quantum signatures based on an arbitrator. Among quantum electronic signature techniques, quantum one-time signatures follow the structure of Lamport-Diffle One-Time Signatures. The transmitter generates a public key to be shared by the transmitter and receiver using the private key as input to the quantum one-way function. Next, the transmitter transmits the message and the information corresponding to the location of the private key mapped to the message as signature information to the receiver. During the verification process, the receiver generates a message using the received signature information and the same quantum one-way function as the transmitter, and verifies whether the signature has passed by checking whether it matches the message received from the transmitter. Like the direct signature technique among existing signature techniques, signing is performed using only the transmitter and receiver.

[0295] FIG. 22 is a diagram illustrating an example of an arbitrator-based quantum signature technique using an existing GHZ state in a system applicable to the present disclosure.

[0296] On the other hand, arbitrated quantum signatures, introduced by G. Zeng in 2002, are a quantum signature technique based on a symmetric key and an arbitrator using GHZ states using quantum key distribution technology. Figure 22 illustrates the architecture of an arbitrator-based quantum electronic signature technique, which proceeds through the stages of preparation, signature generation, and signature verification.

[0297] First, in the preparation phase, a symmetric key K is created between Alice and the mediator. Aand a symmetric key K between Bob and the arbitrator B The arbitrator creates a GHZ state and distributes it to Alice and Bob upon their request.

[0298] Next, in the signature generation step, Alice generates N quantum messages After generating, the quantum one time pad algorithm and K A Using a message quantum state to another quantum state Convert to . Next, your message And Alice's GHZ state particle's Bell state measurement is performed and the results are Save it in . Next, Alice signs the information This process creates and In quantum one time pad algorithm and K A It is done using. As an example of application, and to Signature information by applying the quantum one time pad algorithm operation defined as can be created. Created and is sent to Bob. Bob receives the sent and One of them is saved for use in the signature verification process and the other is and One of them is K B and transmits it to the arbitrator. Bob also measures his GHZ state particle along the X-axis and the measurement result is stored in . The mediator receives y b to K B Decrypt with and get. Among them to K ADecrypt using and save, In K A When applying a conversion operator based on . Based on whether the two values ​​obtained through this are the same, it is possible to determine whether the signature information is forged. Determines whether the argument is 0 or 1. Next, the arbitrator determines Alice's measurement value , Bob's measurements , , GHZ state particles not measured in the arbitrator , signature information About K B After encrypting it using , it is sent back to Bob.

[0299] Finally, in the signature verification step, Bob sends the same K B After decryption using , the verification process of the signature information is performed in two steps. First, among the signature information, Whether it is forged or not It is verified through the value of . If Since the signature on the back is forged, Bob can't send the message and stop the process. But Among the components of the back signature information Since this means correctness, we proceed to the second signature verification process. In the second signature verification process, we first receive the unmeasured GHZ state particle of the arbitrator from the arbitrator. to and From the measurement results, it can be inferred from the correlation of GHZ state. From the state Take the appropriate operator required to create it. . Next, we create the file that we previously saved in Bob. Wow, I saved it earlier Verify the complete correctness of the signature information by checking whether it matches and send a message only when it matches. Accept or else message Reject.

[0300] The quantum signature described above must satisfy the following four properties:

[0301] ① It must be impossible for the recipient or attacker to forge the signature after it is created.

[0302] ② The signer must not be able to deny the signature and the signed message, and the recipient must not be able to deny receiving the message and signature.

[0303] ③Each message must be assigned a new signature and must not be separated from that signature.

[0304] ④ Quantum signatures must contain quantum mechanical characteristics.

[0305] Ref. 1) Arbitrated quantum-signature scheme, Guihua Zeng and Christoph H. Keitel, Phys. Rev. A 65, 042312

[0306] Ref. 2) Comment on “Arbitrated quantum-signature scheme” Marcos Curty and Norbert Lutkenhaus, Phys. Rev. A 77, 046301

[0307] Ref. 3) Reply to “Comment on ‘Arbitrated quantum-signature scheme””, Guihua Zeng, Phys. Rev. A 78, 016301

[0308] Ref. 4) Quantum signature method by arbitrator and system using the same (ETRI, 2014, KR20140060022A)

[0309] Ref. 5) Quantum digital signatures, D Gottesman, I Chuang, arXiv preprint quant-ph / 0105032, 2001

[0310]

[0311] The symbols / abbreviations / terms used in this disclosure are as follows.

[0312] - AQS: Arbitrated quantum signature

[0313] - GHZ state: Greenberger-Horne-Zeilinger state (quantum state in which three particles are entangled and correlated)

[0314] - Bell state: A quantum state in which two particles are entangled and correlated.

[0315] - BSM: Bell state measurement

[0316] - : Qubit message

[0317] - : Quantum signature information

[0318] - k A , k B , k AB : A secret symmetric key shared between Alice and the Arbitrator, Bob and the Arbitrator, and Alice and Bob using QKD.

[0319] - : The quantum state resulting from applying the quantum one time pad algorithm to the message

[0320] - : Verification factor

[0321] - Arbitrator: A mediator (who helps verify Bob's signature)

[0322] - QKD: Quantum key distribution

[0323] - Quantum one time pad encryption:

[0324] - Unitary transform:

[0325] - CE k (r)=Modulo 2 sum(k, r)

[0326]

[0327] Technical problems to be solved by various embodiments of the present disclosure

[0328] In the existing arbitrator-based quantum signature technique, when there is an attack due to false denial by the receiver Bob, no one can determine whether the receiver is lying, so the attack cannot be defended against and the security of the message exposed in this case cannot be guaranteed.

[0329] Existing quantum signature techniques also deal with methods to prevent denial by the receiver, but this means that in quantum signature techniques, the passing of the signature means that the receiver, Bob, received the signature information from Alice, encrypted it with a secret symmetric key that only he and the arbitrator have, sent it to the arbitrator, and then received the information required for verification, decrypted it with the same symmetric key, and completed the verification. Therefore, Bob cannot deny that he received the signature information and sent it to the arbitrator. However, there may be cases where Bob claims that he received incorrect signature information and failed the verification even though he received the correct signature information from Alice and the verification result was correct.

[0330] Specifically, in a conventional arbitrator-based quantum signature, Bob receives a qubit message from the sender and generated using information received from the mediator. Despite this match, Bob is falsely In this case, the existing arbitrator-based quantum signature scheme can be used to determine whether Bob received the correct signature from Alice but is lying, or whether Alice intentionally generated a different message and then sent incorrect signature information. Neither Alice, Bob, nor the arbitrator involved in signing can determine whether the receiver made the decision. Therefore, if Bob makes a false denial, none of the users, including the arbitrators involved, can resolve the dispute, so Bob's false denial is always possible. In addition, an attacker can delay the operation of the system by falsely denial of the receiver and obtain the correct message information. There is also a possibility that it can be taken over.

[0331]

[0332] Composition of various embodiments of the present disclosure

[0333] This disclosure addresses an efficient method for countering a type of Denial of Service (DOS) attack caused by false denial by the receiver, which poses a security issue in existing arbitrator-based quantum signature techniques using GHZ states or Bell states. To this end, this disclosure proposes a method in which the arbitrator and the sender can provide random number information that allows the encrypted message to be received only when the verification process is completed and the receiver does not deny it, after transmitting an encrypted message to the receiver based on a true random number generated by the arbitrator. The entire quantum signature process proposed in the present invention consists of three stages: an initial setup stage, a quantum signature generation stage, and a verification stage.

[0334]

[0335] Example 1. Arbitrator-based quantum signature scheme using GHZ state

[0336] Example 1 presents a method for countering false denial by the receiver in a GHZ state-based arbitrator-based quantum signature scheme. The scheme proceeds through the following steps: generating and verifying signature information.

[0337]

[0338] FIG. 23 is a diagram illustrating the initial stages of a quantum signature technique based on an arbitrator using a GHZ state in a system applicable to the present disclosure.

[0339] (1) Initial setup phase

[0340] The quantum signature technique considered in the present invention is as shown in Fig. 23, in which the mediator generates N GHZ triplet states, which is the number of message qubits, and then divides them at the request of Alice and Bob, the sender and receiver, and proceeds with signing using the correlation between them. Alice and the mediator use QKD to generate a symmetric key K. A , Bob and the mediator also K B , K between Alice and Bob AB Share the dictionary with a symmetric key.

[0341]

[0342] (2) Quantum signature generation step:

[0343] (2-1) Alice first sends n qubit messages Creates.

[0344] (2-2) Arbitrator generates an n-bit random number Creates.

[0345] (2-3) Arbitrator is a true random number After encrypting, Send to Alice.

[0346] (2-4) Alice Decrypt the random information Restores.

[0347] (2-5) Alice converts the message qubit information using random number information (message conversion).

[0348]

[0349] (2-6) Alice sends the converted message information to k A Convert using .

[0350]

[0351] (2-7) Alice Wow GHZ state Bell state measurement is performed using .

[0352]

[0353] (2-8) Alice's measurement results Save it.

[0354] (2-9) Signature information After creation Send it to Bob along with .

[0355]

[0356] (3) Verification phase:

[0357] (3-1) Process performed by Bob:

[0358] (3-1-1) Measurement of Bob's particles in the X-axis direction during the GHZ state and the results are as follows: Save it.

[0359] (3-1-2) Bob's secret symmetric key k is used to receive information from Alice. B encrypted with and send it to the Arbitrator.

[0360]

[0361] (3-2) Process performed by the arbitrator:

[0362] (3-2-1) Secret symmetric key k held by the arbitrator A , k BUsing y b From After decrypting, From is generated through the following operations.

[0363]

[0364] On the other hand, the verification factor Save as, otherwise Save as .

[0365] (3-2-2) The arbitrator Through Perform restoration and GHZ particles of the mediator Receive without measurement.

[0366] (3-2-3) and send it to Bob.

[0367]

[0368] (3-3) Process performed by Bob:

[0369] (3-3-1) y A By decrypting Get .

[0370] (3-3-2) Back side is forged, so Bob Discard it. Otherwise, continue with the next step.

[0371] Fig. 24 is a system applicable to the present disclosure. This is a diagram showing an example of the operator application rules for generating .

[0372] (3-3-3) According to the measurement results By applying the same operator as in Fig. 24 Convert to .

[0373] (3-3-4) Since the signature is complete correct, Bob sends a message to Alice and the Arbitrator. To inform you, If so, Bob rejects the message. This process confirms to Alice and the arbitrator, the remaining users of the signing protocol, that Bob did not make a false denial. Only in this case can the receiver proceed with the next step to recover the original message. This allows the present invention to address the problem of false denial by the receiver.

[0374] (3-4) Process performed by Alice

[0375] Alice from Bob Hearing this, he obtains the random number he has and the secret symmetric key k that Alice and Bob have. AB Created by encrypting with Send to Bob.

[0376] (3-5) Process performed by the Arbitrator

[0377] The Arbitrator is from Bob Hearing this, he uses the random number he has and the secret symmetric key k that Bob has. B Created by encrypting with Send to Bob.

[0378] (3-6) Process performed by Bob

[0379] Bob is and By decrypting and , and check whether the two random numbers match to determine whether the random number sent by Alice is forged. If the two random numbers match, By using cast If not, the message recovered using the random number is discarded as it is not the original message. In this process, Alice's random number As well as the arbitrator's random number The reason for comparing is Alice's random number This is because, when using only , there is a possibility that Alice's random number used to convert message information during the signature generation process and the random number information that Alice will provide to restore the message information of the receiver may not match.

[0380]

[0381] FIG. 25 is a diagram illustrating an example of an arbitrator-based quantum signature technique using GHZ state to counter false denial of a receiver in a system applicable to the present disclosure.

[0382] Figure 25 shows the overall configuration of the arbitrator-based quantum signature technique presented in the present disclosure, as well as the operations performed in the transmitter, receiver, and arbitrator, and the information exchanged between them.

[0383] In Fig. 25, the initial setup step for signing corresponds to processes I-1) to I-2), and the signature generation step corresponds to processes S-1) to S-11). Finally, the signature verification step is performed in processes V-1) to V-15).

[0384]

[0385] FIG. 26 is a flowchart illustrating a quantum signature technique based on an arbitrator using a GHZ state to counter false denial by a receiver in a system applicable to the present disclosure.

[0386] Referring to Figure 26, Alice first sends n qubit messages Creates.

[0387] Alice from the Arbitrator Receive.

[0388] Alice is Decrypt the random information Restores.

[0389] Alice is Creates.

[0390] Alice is Creates.

[0391] Alice is Wow GHZ state Bell state measurement is performed using , and the measurement results Save it.

[0392] Alice's signature information and generate signature information cast Send it to Bob with .

[0393] Alice from Bob Alice and Bob receive the random number they have and the secret symmetric key k that they have. AB Created by encrypting with Send to Bob.

[0394]

[0395] Bob performs measurements of Bob's particles in the X-axis direction during the GHZ state and the results are Save it.

[0396] Bob receives the information from Alice using Bob's secret symmetric key k B encrypted with and send it to the Abitrator.

[0397] Bob is y A By decrypting Get .

[0398] Bob is Back side is forged, so Bob Discard it. Otherwise, continue with the next step.

[0399] Bob is According to the measurement results By applying the same operator as in Fig. 24 Convert to .

[0400] Bob is Since the signature is complete correct, Bob sends a message to Alice and the Arbitrator. To inform you, If so, Bob refuses.

[0401] Bob receives encrypted random information from Alice and the intermediary. and By decrypting and , and checks whether the two random number pieces of information match to determine whether the random number sent by Alice is forged.

[0402] If the two random numbers match, Bob By using cast If not, Bob discards the message recovered using random numbers, as it is not the original message.

[0403]

[0404] Arbitrator is an n-bit random number Creates.

[0405] Arbitrator is a true random number After encrypting, Send to Alice.

[0406] The Arbitrator is from Bob Receive.

[0407] The arbitrator has a secret symmetric key k A , k B Using y b From After decrypting, From is generated through the following operations.

[0408] On the other hand, the Arbitrator is the verification factor Save as. Otherwise, the Arbitrator Save as .

[0409] The Arbitrator is Through Perform restoration and GHZ particles of the Arbitrator Receive without measurement.

[0410] The Arbitrator is and send it to Bob.

[0411] The Arbitrator is from Bob Hearing this, he uses the random number he has and the secret symmetric key k that Bob has. B Created by encrypting with Send to Bob.

[0412]

[0413] Example 2. Arbitrator-based quantum signature scheme using Bell states

[0414] FIG. 27 is a diagram illustrating an example of an arbitrator-based quantum signature technique using Bell states to counter false denial by a receiver in a system applicable to the present disclosure.

[0415] In Example 2, a method for applying a method to counter false denial by a receiver in a arbitrator-based quantum signature technique based on Bell state is presented. The detailed procedure of this technique is identical to that of the arbitrator-based quantum signature technique using GHZ state described in Example 1 above, but the difference is that, unlike the GHZ state-based method that shares entangled particles among the three parties participating in the signature, the Bell state-based method shares entangled particles only between the sender and receiver.

[0416] Figure 27 illustrates the overall configuration process of a arbitrator-based quantum signature technique utilizing Bell states, including the proposed technique for countering false denial by the receiver. In Figure 27, the initial setup step for signing corresponds to steps I-1) to I-2), the signature generation step corresponds to steps S-1) to S-11), and finally, the signature verification step occurs in steps V-1) to V-14).

[0417]

[0418] FIG. 28 is a flowchart illustrating a quantum signature technique based on an arbitrator using Bell states to counter false denial by a receiver in a system applicable to the present disclosure.

[0419] Referring to Figure 28, Alice first sends n qubit messages Creates.

[0420] Alice from the Arbitrator Receive.

[0421] Alice is Decrypt the random information Restores.

[0422] Alice is Creates.

[0423] Alice is Creates.

[0424] Alice is Wow Bell state Bell state measurement is performed using , and the measurement results Save it.

[0425] Alice's signature information and generate signing information cast Send it to Bob with .

[0426] Alice from Bob Alice and Bob receive the random number they have and the secret symmetric key k that they have. AB Created by encrypting with Send to Bob.

[0427]

[0428] Bob receives the information from Alice using Bob's secret symmetric key k B encrypted with and send it to the Arbitrator.

[0429] Bob is y A By decrypting Get .

[0430] Bob is Back side is forged, so Bob Discard it. Otherwise, continue with the next step.

[0431] Bob is According to the measurement results By applying the operator Convert to .

[0432] Bob is Since the signature is complete correct, Bob sends a message to Alice and the Arbitrator. To inform you, If so, Bob refuses.

[0433] Bob is and By decrypting and , and checks whether the two random number pieces of information match to determine whether the random number sent by Alice is forged.

[0434] If the two random numbers match, Bob By using cast If not, Bob discards the message recovered using random numbers, as it is not the original message.

[0435]

[0436] Arbitrator is an n-bit random number Creates.

[0437] Arbitrator is a true random number After encrypting, Send to Alice.

[0438] The Arbitrator is from Bob Receive.

[0439] The arbitrator has a secret symmetric key k A , k B Using y b From After decrypting, From is generated through the following operations.

[0440] On the other hand, the Arbitrator is the verification factor Save as. Otherwise, the Arbitrator Save as .

[0441] The Arbitrator is Through Perform restoration and GHZ particles of the Arbitrator is performed without measurement.

[0442] The Arbitrator is and send it to Bob.

[0443] The Arbitrator is from Bob Hearing this, he uses the random number he has and the secret symmetric key k that Bob has. B Created by encrypting with Send to Bob.

[0444]

[0445] Security Analysis

[0446] This paper analyzes the security of the arbitrator-based quantum signature technique proposed in this disclosure. The two conditions required to ensure security in quantum signatures are non-repudiation by the sender and receiver and unforgeability of the signature. The arbitrator-based quantum signature technique proposed in this disclosure enhances the security of existing arbitrator-based quantum signature techniques by maintaining the non-repudiation and unforgeability of existing arbitrator-based quantum signature techniques while also providing a method to counter false denial by the receiver.

[0447] (1) Non-repudiation of the transmitter

[0448] If Alice never sent the signing information, only Alice and the arbitrator have the secret key k A Since the arbitrator can determine that the signature information came from Alice by using the fact that it is included in the signature information received by the arbitrator, non-repudiation of the sender is possible.

[0449] (2) Non-repudiation by the recipient (prevents Bob from claiming he never received the signature)

[0450] To verify a signature in the case where Bob has never received the signature, the recipient must receive the signature and use the same secret key k B Since it requires interaction with the intermediary who is sharing the transaction, once verification is complete, Bob must assume that he has received the signature and transmitted it to the intermediary, thus preventing repudiation by the recipient.

[0451] (3) Prevention of false denial by the recipient (prevention of the recipient denying receipt of a correct message and signature, but claiming to have received an incorrect message and signature)

[0452] Only when the receiver acknowledges that it is not making a false denial and provides a notice to the sender and the arbitrator that it acknowledges that the received message and signature are not incorrect, can the sender and the arbitrator provide the receiver with random information that allows the receiver to recover the message, thereby preventing the exposure of message information due to a type of DOS attack that exploits the receiver's false denial.

[0453] (4) Impossible to forge

[0454] If Bob or Eve forges Alice's signature, the secret symmetric key k A We need to know k through quantum mechanics-based QKD. A Since it is distributed only between Alice and the mediator, it is impossible for Bob or Eve to find out the key information, so the mediator is correct. The verification step cannot be passed because it cannot be generated.

[0455] Secret symmetric key k A If Eve attempts to forge her signature, Eve will be exposed to the k A Even if we know the correct Alice, we can get the same Bell state measurement result from the new message we generated. is not possible to generate, so it is used in the second verification process. Since the condition cannot be met, forgery of the signature information is impossible.

[0456]

[0457] Effects of various embodiments of the present disclosure

[0458] Various embodiments of the present disclosure propose a method for securing security against a DOS attack using false denial of service (FDS) by a receiver, which can occur in existing arbitrator-based quantum signature techniques. The reason for the possibility of false denial of service by the receiver lies in the verification process of the receiver. Despite this, Because the sender, receiver and mediator who participated in the signing can claim that the recipient When claiming that Bob received the correct signature from Alice, does this mean that he is falsely claiming that the verification result is inconsistent? Does this mean that the sender actually did the verification result because he measured the bell state using a different message? It is not possible to know exactly whether there is a mismatch. Therefore, a problem may arise in which the correct message information sent by the sender is exposed to an attacker through a delay in the operation of the signature system due to a false denial. In the present disclosure, this problem can be solved by encrypting the message information using random information generated by an arbitrator and transmitting it, and then providing the receiver with random information that can recover the original message only if the receiver does not deny it.

[0459]

[0460] Characteristic configurations of various embodiments of the present disclosure are as follows.

[0461] Various embodiments of the present disclosure deal with a technique for preventing repudiation and ensuring message security from a DOS attack due to a false denial of a receiver in an arbitrator-based quantum signature technique, and the main components are as follows.

[0462] (1) Portion to be claimed based on arbitrator standards:

[0463] In the process of preventing message exposure that may occur due to false denial by the receiver,

[0464] The arbitrator generates random information to be used in the quantum state transformation of the message qubit to prevent direct exposure of the message;

[0465] A step of encrypting the random number information generated in the above step with a secret symmetric key shared only by the mediator and the sender Alice and transmitting it to the sender;

[0466] A step of providing random number information to be used for restoring the quantum state-converted message of the receiver to the receiver after the arbitrator receives a message confirming that the receiver is not denying the signature during the signature verification process;

[0467]

[0468] (2) Portion to be charged based on sender:

[0469] In the process where the sender creates a modified (randomly encrypted) message and sends it to the receiver Bob,

[0470] A step of converting the quantum state of the message qubit using random information received from the arbitrator to prevent direct exposure of the message qubit generated by the sender;

[0471] A step of transmitting the converted message qubit information to the receiver;

[0472] A step of providing random number information to be used for restoring a quantum state-converted message to the receiver after the sender receives a message confirming that the receiver is not denying the signature during the signature verification process;

[0473]

[0474] (3) Portion to be charged based on recipient:

[0475] In the process of restoring the original message after the receiver completes signature verification on its own,

[0476] If there is no problem with the signature verification process, a step for sending a notification message to the sender and the arbitrator confirming that there is no problem with the signature information as a result of the signature verification (a process to prevent false denial);

[0477] After the above step, a step of decrypting the encrypted random number information received from the transmitter and the arbitrator using a secret symmetric key that only the receiver and the transmitter have and a secret symmetric key that only the arbitrator and the receiver have;

[0478] A step for confirming whether the random number information sent by the sender and the arbitrator decrypted in the above step matches (a process for preventing the sender from providing a discrepancy between the random number used for message encryption and the random number information used for message restoration);

[0479] In the above process, if the two pieces of random information match, a step of restoring the quantum state-converted message qubit to the original message qubit using the random information;

[0480]

[0481] [Explanation regarding the third node (Arbitrator) claim]

[0482] The embodiments described below are specifically described with reference to FIG. 29 in terms of the operation of the third node. The methods described below are distinguished for convenience of explanation, and it is understood that some components of one method may be substituted for some components of another method, or may be applied in combination with each other, as long as they are not mutually exclusive.

[0483] FIG. 29 is a diagram illustrating an example of the operation process of a third node in a system applicable to the present disclosure.

[0484] According to various embodiments of the present disclosure, a method performed by a third node in a communication system is provided.

[0485] According to various embodiments of the present disclosure, each of the first node, the second node, the third node, and the plurality of nodes may correspond to one of a terminal or a base station in a wireless communication system.

[0486] The embodiment of FIG. 29 may further include, before step S2901, one or more of the following steps: a step in which the third node receives one or more synchronization signals from the first node; a step in which the third node receives system information from the first node; a step in which the third node receives configuration information from the first node; and a step in which the third node receives control information from the first node.

[0487] The embodiment of FIG. 29 may further include, before step S2901, one or more of the steps of: a third node transmitting a random access preamble to the first node; a third node receiving a random access response (RAR) from the first node; a third node transmitting a random access message 3 to the first node; and a third node receiving a contention resolution message from the first node. Message 3 is a first PUSCH transmission scheduled by RAR together with an RAR UL grant.

[0488] At step S2901, the third node shares information about the first secret symmetric key with the first node.

[0489] At step S2902, the third node shares information about the second secret symmetric key with the second node.

[0490] At step S2903, the third node generates first random number information for quantum state conversion of the first message qubit.

[0491] In step S2904, the third node transmits first information generated by encrypting the first random number information based on the first secret symmetric key to the first node.

[0492] At step S2905, the third node receives second information generated by encrypting the signature information and the first transformation message information based on the second secret symmetric key from the second node.

[0493]

[0494] According to various embodiments of the present disclosure, the embodiment of FIG. 29 may further include: obtaining the signature information and the first transformation message information by decrypting the second information based on the second secret symmetric key; obtaining a Bell state measurement result and a second message qubit by decrypting the signature information based on the first secret symmetric key; generating a third message qubit based on the first secret symmetric key from the first transformation message information; and performing a first verification based on whether the second message qubit and the third message qubit match.

[0495] According to various embodiments of the present disclosure, the embodiment of FIG. 29 may further include: a step of restoring the first transformation message information based on the first secret symmetric key from the third message qubit; a step of obtaining GHZ state (Greenberger-Horne-Zeilinger state) information of the third node; a step of generating third information encrypted based on the second secret symmetric key with respect to the first transformation message information, the result of the first verification, the second message qubit, the GHZ state information, and the Bell state measurement result; and a step of transmitting the third information to the second node.

[0496] According to various embodiments of the present disclosure, the result of the first verification that the second message qubit and the third message qubit do not match may indicate to the second node that the signature information has been forged.

[0497] According to various embodiments of the present disclosure, the embodiment of FIG. 29 may further include a step of receiving a result of a second verification related to the consistency of the first conversion message information and the second conversion message information from the second node.

[0498] According to various embodiments of the present disclosure, the second conversion message information may be based on the GHZ state information and the bell state measurement result.

[0499] According to various embodiments of the present disclosure, the embodiment of FIG. 29 may further include a step of generating first transformed random number information by encrypting the first random number information based on the second secret symmetric key based on the consistency of the first transformed message information and the second transformed message information; and a step of transmitting the first transformed random number information to the second node.

[0500]

[0501] According to various embodiments of the present disclosure, a third node is provided in a communication system. The third node includes a transceiver and at least one processor, wherein the at least one processor may be configured to perform the operating method of the third node according to FIG. 29.

[0502]

[0503] According to various embodiments of the present disclosure, a device for controlling a third node in a communication system is provided. The device includes at least one processor and at least one memory operably connected to the at least one processor. The at least one memory may be configured to store instructions for performing the operating method of the third node according to FIG. 29 based on instructions executed by the at least one processor.

[0504]

[0505] According to various embodiments of the present disclosure, one or more non-transitory computer-readable media (CRM) storing one or more instructions are provided. The one or more instructions, when executed by one or more processors, perform operations, and the operations may include the operating method of a third node according to FIG. 29.

[0506]

[0507] [Description of Node 1 (Alice) Claim]

[0508] The embodiments described below are specifically described with reference to FIG. 30 in terms of the operation of the first node. The methods described below are distinguished for convenience of explanation, and it is understood that some components of one method may be substituted for or combined with some components of another method, as long as they are not mutually exclusive.

[0509] FIG. 30 is a diagram illustrating an example of the operation process of the first node in a system applicable to the present disclosure.

[0510] According to various embodiments of the present disclosure, a method performed by a first node in a communication system is provided.

[0511] According to various embodiments of the present disclosure, each of the first node, the second node, the third node, and the plurality of nodes may correspond to one of a terminal or a base station in a wireless communication system.

[0512] The embodiment of FIG. 30 may further include, before step S3001, one or more of the following steps: a step in which the first node transmits one or more synchronization signals to one or more of the second node or the third node; a step in which the first node transmits system information to one or more of the second node or the third node; a step in which the first node transmits configuration information to one or more of the second node or the third node; and a step in which the first node transmits control information to one or more of the second node or the third node.

[0513] The embodiment of FIG. 30 may further include, before step S3001, one or more of the following steps: a first node receiving a random access preamble from at least one of a second node or a third node; a first node transmitting a random access response (RAR) to at least one of the second node or the third node; a first node receiving a random access message 3 from at least one of the second node or the third node; and a first node transmitting a contention resolution message to at least one of the second node or the third node. Message 3 is a first PUSCH transmission scheduled by RAR together with an RAR UL grant.

[0514] At step S3001, the first node shares information about the first secret symmetric key with the third node.

[0515] At step S3002, the first node shares information about the third secret symmetric key with the second node.

[0516] At step S3003, the first node generates a first message qubit.

[0517] In step S3004, the first node receives, from the third node, first information encrypted based on the first secret symmetric key for first random number information for quantum state conversion of the first message qubit.

[0518]

[0519] According to various embodiments of the present disclosure, the embodiment of FIG. 30 may further include: obtaining second random number information by decrypting the first information based on the first secret symmetric key; generating first transformed message information by transforming the first message qubit based on the second random number information; generating a second message qubit by transforming the first transformed message information based on the first secret symmetric key; generating signature information based on a Bell state measurement result and the second message qubit; and transmitting the signature information and the first transformed message information to the second node.

[0520] According to various embodiments of the present disclosure, a mismatch between the first random number information and the second random number information may indicate to the second node that the signature information has been forged.

[0521] According to various embodiments of the present disclosure, the embodiment of FIG. 30 may further include a step of receiving a result of a second verification related to the consistency of the first conversion message information and the second conversion message information from the second node.

[0522] The second conversion message information may be based on the GHZ state (Greenberger-Horne-Zeilinger state) information of the third node and the bell state measurement result.

[0523] According to various embodiments of the present disclosure, the embodiment of FIG. 30 may further include a step of generating second transformed random number information by encrypting the second random number information based on the third secret symmetric key based on the consistency of the first transformed message information and the second transformed message information; and a step of transmitting the second transformed random number information to the second node.

[0524] According to various embodiments of the present disclosure, the result of the second verification, in which the first transformation message information and the second transformation message information do not match, may indicate to the second node that the signature information has been forged.

[0525]

[0526] According to various embodiments of the present disclosure, a first node is provided in a communication system. The first node includes a transceiver and at least one processor, wherein the at least one processor may be configured to perform the operating method of the first node according to FIG. 30.

[0527]

[0528] According to various embodiments of the present disclosure, a device for controlling a third node in a communication system is provided. The device includes at least one processor and at least one memory operably connected to the at least one processor. The at least one memory may be configured to store instructions for performing an operating method of a first node according to FIG. 30 based on instructions executed by the at least one processor.

[0529]

[0530] According to various embodiments of the present disclosure, one or more non-transitory computer-readable media (CRM) storing one or more instructions are provided. The one or more instructions, when executed by one or more processors, perform operations, and the operations may include the operating method of the first node according to FIG. 30.

[0531]

[0532] [Description of the second node (bob) claim]

[0533] The embodiments described below are specifically described with reference to FIG. 31 in terms of the operation of the second node. The methods described below are distinguished for convenience of explanation, and it is understood that some components of one method may be substituted for or combined with some components of another method, as long as they are not mutually exclusive.

[0534] FIG. 31 is a diagram illustrating an example of the operation process of a second node in a system applicable to the present disclosure.

[0535] According to various embodiments of the present disclosure, a method performed by a second node in a communication system is provided.

[0536] According to various embodiments of the present disclosure, each of the first node, the second node, the third node, and the plurality of nodes may correspond to one of a terminal or a base station in a wireless communication system.

[0537] The embodiment of FIG. 31 may further include, before step S3101, one or more of the following steps: a step in which the second node receives one or more synchronization signals from the first node; a step in which the second node receives system information from the first node; a step in which the second node receives configuration information from the first node; and a step in which the second node receives control information from the first node.

[0538] The embodiment of FIG. 31 may further include, before step S3101, one or more of the following steps: a step in which the second node transmits a random access preamble to the first node; a step in which the second node receives a random access response (RAR) from the first node; a step in which the second node transmits a random access message 3 to the first node; and a step in which the second node receives a contention resolution message from the first node. Message 3 is a first PUSCH transmission scheduled by RAR together with an RAR UL grant.

[0539] At step S3101, the second node shares information about the second secret symmetric key with the third node.

[0540] At step S3102, the second node shares information about the third secret symmetric key with the first node.

[0541] At step S3103, the second node receives signature information and first conversion message information from the first node.

[0542] In step S3104, the second node transmits second information encrypted based on the second secret symmetric key with respect to the signature information and the first conversion message information to the third node.

[0543]

[0544] In step S3105, the second node receives third information encrypted based on the second secret symmetric key from the third node, including the first transformation message information, the result of the first verification, the second message qubit, the GHZ state (Greenberger-Horne-Zeilinger state) information of the third node, and the Bell state measurement result.

[0545] In step S3106, the second node obtains the first transformation message information, the result of the first verification, the second message qubit, the GHZ state information, and the bell state measurement result through decryption of the third information.

[0546] At step S3107, the second node determines whether the signature information is secure, including forgery, based on the result of the first verification.

[0547]

[0548] According to various embodiments of the present disclosure, the embodiment of FIG. 31 may further include: a step of generating second conversion message information using the GHZ state information and the bell state measurement result based on the signature information not being forged; a step of performing a second verification based on whether the first conversion message information and the second conversion message information match; and a step of transmitting a result of the second verification related to the match between the conversion message information and the second conversion message information to the first node and the third node.

[0549] According to various embodiments of the present disclosure, the embodiment of FIG. 31 may further include: receiving, from the third node, first transformed random number information generated by encrypting the first random number information based on the second secret symmetric key, based on a result of the second verification related to the consistency of the first transformed message information and the second transformed message information; and receiving, from the first node, second transformed random number information generated by encrypting the second random number information based on the third secret symmetric key, based on the consistency of the first transformed message information and the second transformed message information.

[0550] According to various embodiments of the present disclosure, the embodiment of FIG. 31 may further include a step of obtaining the first random number information by decrypting the first converted random number information based on the second secret symmetric key; a step of obtaining the second random number information by decrypting the second converted random number information based on the third secret symmetric key; and a step of performing a third verification based on whether the first random number information and the second random number information match.

[0551] According to various embodiments of the present disclosure, the embodiment of FIG. 31 may further include: a step of restoring a first message qubit from the transformation message information using the second random number information based on a match between the first random number information and the second random number information; and a step of discarding the transformation message information based on a non-match between the first random number information and the second random number information.

[0552]

[0553] According to various embodiments of the present disclosure, a second node is provided in a communication system. The second node includes a transceiver and at least one processor, wherein the at least one processor may be configured to perform the operating method of the second node according to FIG. 31.

[0554]

[0555] According to various embodiments of the present disclosure, a device for controlling a second node in a communication system is provided. The device includes at least one processor and at least one memory operably connected to the at least one processor. The at least one memory may be configured to store instructions for performing an operating method of the second node according to FIG. 31 based on instructions executed by the at least one processor.

[0556]

[0557] According to various embodiments of the present disclosure, one or more non-transitory computer-readable media (CRM) storing one or more instructions are provided. The one or more instructions, when executed by one or more processors, perform operations, and the operations may include the operating method of a second node according to FIG. 31.

[0558]

[0559] Communication system applicable to the present disclosure

[0560] FIG. 32 illustrates a communication system (1) applicable to various embodiments of the present disclosure.

[0561] Referring to FIG. 32, a communication system (1) applicable to various embodiments of the present disclosure includes a wireless device, a base station, and a network. Here, the wireless device refers to a device that performs communication using a wireless access technology (e.g., 5G NR (New RAT), LTE (Long Term Evolution), 6G wireless communication), and may be referred to as a communication / wireless / 5G device / 6G device. Although not limited thereto, the wireless device may include a robot (100a), a vehicle (100b-1, 100b-2), an XR (eXtended Reality) device (100c), a hand-held device (100d), a home appliance (100e), an IoT (Internet of Things) device (100f), and an AI device / server (400). For example, the vehicle may include a vehicle equipped with a wireless communication function, an autonomous vehicle, a vehicle capable of performing vehicle-to-vehicle communication, etc. Here, the vehicle may include an Unmanned Aerial Vehicle (UAV) (e.g., a drone). XR devices include AR (Augmented Reality) / VR (Virtual Reality) / MR (Mixed Reality) devices, and may be implemented in the form of a Head-Mounted Device (HMD), a Head-Up Display (HUD) installed in a vehicle, a television, a smartphone, a computer, a wearable device, a home appliance, digital signage, a vehicle, a robot, etc. Mobile devices may include a smartphone, a smart pad, a wearable device (e.g., a smart watch, smart glasses), a computer (e.g., a laptop, etc.), etc. Home appliances may include a TV, a refrigerator, a washing machine, etc. IoT devices may include a sensor, a smart meter, etc. For example, a base station and a network may also be implemented as a wireless device, and a specific wireless device (200a) may act as a base station / network node to other wireless devices.

[0562] Wireless devices (100a to 100f) can be connected to a network (300) via a base station (200). Artificial Intelligence (AI) technology can be applied to the wireless devices (100a to 100f), and the wireless devices (100a to 100f) can be connected to an AI server (400) via the network (300). The network (300) can be configured using a 3G network, a 4G (e.g., LTE) network, a 5G (e.g., NR) network, or a 6G network. The wireless devices (100a to 100f) can communicate with each other via the base station (200) / network (300), but can also communicate directly (e.g., sidelink communication) without going through the base station / network. For example, vehicles (100b-1, 100b-2) can communicate directly (e.g., V2V (Vehicle to Vehicle) / V2X (Vehicle to Everything) communication). In addition, IoT devices (e.g., sensors) can communicate directly with other IoT devices (e.g., sensors) or other wireless devices (100a to 100f).

[0563] Wireless communication / connection (150a, 150b, 150c) can be established between wireless devices (100a~100f) / base stations (200), and base stations (200) / base stations (200). Here, wireless communication / connection can be achieved through various wireless access technologies (e.g., 5G NR) such as uplink / downlink communication (150a), sidelink communication (150b) (or D2D communication), and communication between base stations (150c) (e.g., relay, IAB (Integrated Access Backhaul). Through wireless communication / connection (150a, 150b, 150c), wireless devices and base stations / wireless devices, and base stations and base stations can transmit / receive wireless signals to each other. For example, wireless communication / connection (150a, 150b, 150c) can transmit / receive signals through various physical channels. To this end, at least some of various configuration information setting processes for transmitting / receiving wireless signals, various signal processing processes (e.g., channel encoding / decoding, modulation / demodulation, resource mapping / demapping, etc.), and resource allocation processes can be performed based on various proposals of various embodiments of the present disclosure.

[0564] Meanwhile, NR supports multiple numerologies (or subcarrier spacing (SCS)) to support various 5G services. For example, an SCS of 15 kHz supports a wide area in traditional cellular bands; an SCS of 30 kHz / 60 kHz supports dense urban areas, lower latency, and wider carrier bandwidth; and an SCS of 60 kHz or higher supports a bandwidth greater than 24.25 GHz to overcome phase noise.

[0565] The NR frequency band can be defined by two types of frequency ranges (FR1, FR2). The numerical values ​​of the frequency ranges can be changed, and for example, the frequency ranges of the two types (FR1, FR2) can be as shown in Table 3 below. For convenience of explanation, among the frequency ranges used in the NR system, FR1 can mean the "sub 6 GHz range", and FR2 can mean the "above 6 GHz range" and can be called millimeter wave (mmW).

[0566] Frequency Range designationCorresponding frequency rangeSubcarrier SpacingFR1450MHz-6000MHz15, 30, 60kHzFR224250MHz-52600MHz60, 120, 240kHz

[0567] As described above, the numerical value of the frequency range of the NR system can be changed. For example, FR1 may include a band from 410 MHz to 7125 MHz, as shown in Table 4 below. That is, FR1 may include a frequency band above 6 GHz (or 5850, 5900, 5925 MHz, etc.). For example, the frequency band above 6 GHz (or 5850, 5900, 5925 MHz, etc.) included within FR1 may include an unlicensed band. The unlicensed band may be used for various purposes, such as for vehicular communications (e.g., autonomous driving).

[0568] Frequency Range designationCorresponding frequency rangeSubcarrier SpacingFR141MHz-7125MHz15, 30, 60kHzFR224250MHz-52600MHz60, 120, 240kHz

[0569] According to various embodiments of the present disclosure, the communication system (1) can support terahertz (THz) wireless communication. THz wireless communication is a wireless communication using THz waves having a frequency of approximately 0.1 to 10 THz (1 THz = 1012 Hz), and may refer to terahertz (THz) band wireless communication using a very high carrier frequency of 100 GHz or higher. The frequency band expected to be used for THz wireless communication may be a D-band (110 GHz to 170 GHz) or H-band (220 GHz to 325 GHz) band where propagation loss due to absorption of molecules in the air is small.

[0570]

[0571] Wireless devices applicable to the present disclosure

[0572] Below, examples of wireless devices to which various embodiments of the present disclosure are applied are described.

[0573] FIG. 33 illustrates a wireless device that can be applied to various embodiments of the present disclosure.

[0574] Referring to FIG. 33, the first wireless device (100) and the second wireless device (200) can transmit and receive wireless signals via various wireless access technologies (e.g., LTE, NR). Here, {the first wireless device (100), the second wireless device (200)} can correspond to {the wireless device (100x), the base station (200)} and / or {the wireless device (100x), the wireless device (100x)} of FIG. 32.

[0575] A first wireless device (100) includes one or more processors (102) and one or more memories (104), and may further include one or more transceivers (106) and / or one or more antennas (108). The processor (102) controls the memories (104) and / or the transceivers (106), and may be configured to implement the descriptions, functions, procedures, proposals, methods, and / or operational flowcharts disclosed in this document. For example, the processor (102) may process information in the memory (104) to generate first information / signal, and then transmit a wireless signal including the first information / signal via the transceiver (106). In addition, the processor (102) may receive a wireless signal including second information / signal via the transceiver (106), and then store information obtained from signal processing of the second information / signal in the memory (104). The memory (104) may be connected to the processor (102) and may store various information related to the operation of the processor (102). For example, the memory (104) may perform some or all of the processes controlled by the processor (102), or may store software code including commands for performing the descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document. Here, the processor (102) and the memory (104) may be part of a communication modem / circuit / chip designed to implement a wireless communication technology (e.g., LTE, NR). The transceiver (106) may be connected to the processor (102) and may transmit and / or receive wireless signals via one or more antennas (108). The transceiver (106) may include a transmitter and / or a receiver. The transceiver (106) may be used interchangeably with an RF (Radio Frequency) unit. In various embodiments of the present disclosure, a wireless device may mean a communication modem / circuit / chip.

[0576] The second wireless device (200) includes one or more processors (202), one or more memories (204), and may further include one or more transceivers (206) and / or one or more antennas (208). The processor (202) controls the memories (204) and / or the transceivers (206), and may be configured to implement the descriptions, functions, procedures, proposals, methods, and / or operational flowcharts disclosed in this document. For example, the processor (202) may process information in the memory (204) to generate third information / signals, and then transmit a wireless signal including the third information / signals via the transceivers (206). Furthermore, the processor (202) may receive a wireless signal including fourth information / signals via the transceivers (206), and then store information obtained from signal processing of the fourth information / signals in the memory (204). The memory (204) may be connected to the processor (202) and may store various information related to the operation of the processor (202). For example, the memory (204) may perform some or all of the processes controlled by the processor (202), or may store software code including commands for performing the descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document. Here, the processor (202) and the memory (204) may be part of a communication modem / circuit / chip designed to implement wireless communication technology (e.g., LTE, NR). The transceiver (206) may be connected to the processor (202) and may transmit and / or receive wireless signals via one or more antennas (208). The transceiver (206) may include a transmitter and / or a receiver. The transceiver (206) may be used interchangeably with an RF unit. In various embodiments of the present disclosure, a wireless device may also mean a communication modem / circuit / chip.

[0577] Hereinafter, the hardware elements of the wireless device (100, 200) will be described in more detail. Although not limited thereto, one or more protocol layers may be implemented by one or more processors (102, 202). For example, one or more processors (102, 202) may implement one or more layers (e.g., functional layers such as PHY, MAC, RLC, PDCP, RRC, SDAP). One or more processors (102, 202) may generate one or more Protocol Data Units (PDUs) and / or one or more Service Data Units (SDUs) according to the descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document. One or more processors (102, 202) may generate messages, control information, data, or information according to the descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document. One or more processors (102, 202) can generate signals (e.g., baseband signals) including PDUs, SDUs, messages, control information, data or information according to the functions, procedures, proposals and / or methods disclosed herein, and provide the signals to one or more transceivers (106, 206). One or more processors (102, 202) can receive signals (e.g., baseband signals) from one or more transceivers (106, 206) and obtain PDUs, SDUs, messages, control information, data or information according to the descriptions, functions, procedures, proposals, methods and / or operational flowcharts disclosed herein.

[0578] One or more processors (102, 202) may be referred to as a controller, a microcontroller, a microprocessor, or a microcomputer. One or more processors (102, 202) may be implemented by hardware, firmware, software, or a combination thereof. For example, one or more Application Specific Integrated Circuits (ASICs), one or more Digital Signal Processors (DSPs), one or more Digital Signal Processing Devices (DSPDs), one or more Programmable Logic Devices (PLDs), or one or more Field Programmable Gate Arrays (FPGAs) may be included in one or more processors (102, 202). The descriptions, functions, procedures, proposals, methods, and / or operational flowcharts disclosed in this document may be implemented using firmware or software, and the firmware or software may be implemented to include modules, procedures, functions, etc. The descriptions, functions, procedures, suggestions, methods and / or operation flowcharts disclosed in this document may be implemented using firmware or software configured to perform one or more processors (102, 202) or stored in one or more memories (104, 204) and executed by one or more processors (102, 202). The descriptions, functions, procedures, suggestions, methods and / or operation flowcharts disclosed in this document may be implemented using firmware or software in the form of codes, instructions and / or sets of instructions.

[0579] One or more memories (104, 204) may be coupled to one or more processors (102, 202) and may store various forms of data, signals, messages, information, programs, codes, instructions, and / or commands. The one or more memories (104, 204) may be configured as ROM, RAM, EPROM, flash memory, hard drives, registers, cache memory, computer-readable storage media, and / or combinations thereof. The one or more memories (104, 204) may be located internally and / or externally to the one or more processors (102, 202). Additionally, the one or more memories (104, 204) may be coupled to the one or more processors (102, 202) via various technologies, such as wired or wireless connections.

[0580] One or more transceivers (106, 206) can transmit user data, control information, wireless signals / channels, etc., as mentioned in the methods and / or flowcharts of this document, to one or more other devices. One or more transceivers (106, 206) can receive user data, control information, wireless signals / channels, etc., as mentioned in the descriptions, functions, procedures, proposals, methods and / or flowcharts of this document, from one or more other devices. For example, one or more transceivers (106, 206) can be connected to one or more processors (102, 202) and can transmit and receive wireless signals. For example, one or more processors (102, 202) can control one or more transceivers (106, 206) to transmit user data, control information, or wireless signals to one or more other devices. Additionally, one or more processors (102, 202) may control one or more transceivers (106, 206) to receive user data, control information, or wireless signals from one or more other devices. Additionally, one or more transceivers (106, 206) may be coupled to one or more antennas (108, 208), and one or more transceivers (106, 206) may be configured to transmit and receive user data, control information, wireless signals / channels, or the like, as referred to in the descriptions, functions, procedures, proposals, methods, and / or operational flowcharts disclosed herein, via one or more antennas (108, 208). In this document, one or more antennas may be multiple physical antennas or multiple logical antennas (e.g., antenna ports). One or more transceivers (106, 206) can convert received user data, control information, wireless signals / channels, etc. from RF band signals to baseband signals in order to process the received user data, control information, wireless signals / channels, etc. using one or more processors (102, 202).One or more transceivers (106, 206) may convert user data, control information, wireless signals / channels, etc. processed by one or more processors (102, 202) from baseband signals to RF band signals. For this purpose, one or more transceivers (106, 206) may include an (analog) oscillator and / or filter.

[0581] FIG. 34 illustrates another example of a wireless device that can be applied to various embodiments of the present disclosure.

[0582] According to FIG. 34, the wireless device may include at least one processor (102, 202), at least one memory (104, 204), at least one transceiver (106, 206), and one or more antennas (108, 208).

[0583] The difference between the example of the wireless device described in FIG. 33 and the example of the wireless device in FIG. 34 is that in FIG. 33, the processor (102, 202) and the memory (104, 204) are separated, but in the example of FIG. 34, the memory (104, 204) is included in the processor (102, 202).

[0584] Here, the specific description of the processor (102, 202), memory (104, 204), transceiver (106, 206), and one or more antennas (108, 208) is as described above, so in order to avoid unnecessary repetition of description, the description of the repeated description is omitted.

[0585] Below, examples of signal processing circuits to which various embodiments of the present disclosure are applied are described.

[0586] Figure 35 illustrates a signal processing circuit for a transmission signal.

[0587] Referring to FIG. 35, the signal processing circuit (1000) may include a scrambler (1010), a modulator (1020), a layer mapper (1030), a precoder (1040), a resource mapper (1050), and a signal generator (1060). Although not limited thereto, the operations / functions of FIG. 35 may be performed in the processor (102, 202) and / or the transceiver (106, 206) of FIG. 33. The hardware elements of FIG. 35 may be implemented in the processor (102, 202) and / or the transceiver (106, 206) of FIG. 33. For example, blocks 1010 to 1060 may be implemented in the processor (102, 202) of FIG. 33. Additionally, blocks 1010 to 1050 may be implemented in the processor (102, 202) of FIG. 33, and block 1060 may be implemented in the transceiver (106, 206) of FIG. 33.

[0588] The codeword can be converted into a wireless signal through the signal processing circuit (1000) of FIG. 35. Here, the codeword is an encoded bit sequence of an information block. The information block may include a transport block (e.g., an UL-SCH transport block, a DL-SCH transport block). The wireless signal may be transmitted through various physical channels (e.g., a PUSCH or a PDSCH).

[0589] Specifically, the codeword can be converted into a bit sequence scrambled by a scrambler (1010). The scramble sequence used for scrambling is generated based on an initialization value, and the initialization value may include ID information of the wireless device, etc. The scrambled bit sequence can be modulated into a modulation symbol sequence by a modulator (1020). The modulation method may include pi / 2-BPSK (pi / 2-Binary Phase Shift Keying), m-PSK (m-Phase Shift Keying), m-QAM (m-Quadrature Amplitude Modulation), etc. The complex modulation symbol sequence can be mapped to one or more transmission layers by a layer mapper (1030). The modulation symbols of each transmission layer can be mapped to the corresponding antenna port(s) by a precoder (1040) (precoding). The output z of the precoder (1040) can be obtained by multiplying the output y of the layer mapper (1030) by a precoding matrix W of N*M. Here, N is the number of antenna ports, and M is the number of transmission layers. Here, the precoder (1040) can perform precoding after performing transform precoding (e.g., DFT transform) on complex modulation symbols. In addition, the precoder (1040) can perform precoding without performing transform precoding.

[0590] The resource mapper (1050) can map modulation symbols of each antenna port to time-frequency resources. The time-frequency resources can include multiple symbols (e.g., CP-OFDMA symbols, DFT-s-OFDMA symbols) in the time domain and multiple subcarriers in the frequency domain. The signal generator (1060) generates a wireless signal from the mapped modulation symbols, and the generated wireless signal can be transmitted to another device through each antenna. To this end, the signal generator (1060) can include an Inverse Fast Fourier Transform (IFFT) module, a Cyclic Prefix (CP) inserter, a Digital-to-Analog Converter (DAC), a frequency uplink converter, etc.

[0591] The signal processing process for receiving signals in a wireless device can be configured in reverse order of the signal processing process (1010 to 1060) of FIG. 35. For example, a wireless device (e.g., 100, 200 of FIG. 33) can receive wireless signals from the outside through an antenna port / transceiver. The received wireless signals can be converted into baseband signals through a signal restorer. For this purpose, the signal restorer can include a frequency downlink converter, an analog-to-digital converter (ADC), a CP remover, and a fast Fourier transform (FFT) module. Thereafter, the baseband signal can be restored to a codeword through a resource demapper process, a postcoding process, a demodulation process, and a descrambling process. The codewords can be restored to the original information blocks through decoding. Accordingly, a signal processing circuit (not shown) for a received signal may include a signal restorer, a resource de-mapper, a postcoder, a demodulator, a de-scrambler, and a decoder.

[0592] Below, examples of wireless device utilization to which various embodiments of the present disclosure are applied are described.

[0593] Figure 36 illustrates another example of a wireless device applicable to various embodiments of the present disclosure. The wireless device may be implemented in various forms depending on the use case / service (see Figure 32).

[0594] Referring to FIG. 36, the wireless device (100, 200) corresponds to the wireless device (100, 200) of FIG. 33 and may be composed of various elements, components, units / units, and / or modules. For example, the wireless device (100, 200) may include a communication unit (110), a control unit (120), a memory unit (130), and an additional element (140). The communication unit may include a communication circuit (112) and a transceiver(s) (114). For example, the communication circuit (112) may include one or more processors (102, 202) and / or one or more memories (104, 204) of FIG. 33. For example, the transceiver(s) (114) may include one or more transceivers (106, 206) and / or one or more antennas (108, 208) of FIG. 33. The control unit (120) is electrically connected to the communication unit (110), the memory unit (130), and the additional elements (140) and controls the overall operation of the wireless device. For example, the control unit (120) may control the electrical / mechanical operation of the wireless device based on the program / code / command / information stored in the memory unit (130). In addition, the control unit (120) may transmit information stored in the memory unit (130) to an external device (e.g., another communication device) via a wireless / wired interface through the communication unit (110), or store information received from an external device (e.g., another communication device) via a wireless / wired interface in the memory unit (130).

[0595] The additional element (140) may be configured in various ways depending on the type of the wireless device. For example, the additional element (140) may include at least one of a power unit / battery, an input / output unit (I / O unit), a driving unit, and a computing unit. Although not limited thereto, the wireless device may be implemented in the form of a robot (Fig. 32, 100a), a vehicle (Fig. 32, 100b-1, 100b-2), an XR device (Fig. 32, 100c), a portable device (Fig. 32, 100d), a home appliance (Fig. 32, 100e), an IoT device (Fig. 32, 100f), a digital broadcasting terminal, a hologram device, a public safety device, an MTC device, a medical device, a fintech device (or a financial device), a security device, a climate / environmental device, an AI server / device (Fig. 32, 400), a base station (Fig. 32, 200), a network node, etc. Wireless devices may be mobile or stationary depending on the use / service.

[0596] In FIG. 36, various elements, components, units / parts, and / or modules within the wireless device (100, 200) may be entirely interconnected via a wired interface, or at least some may be wirelessly connected via a communication unit (110). For example, within the wireless device (100, 200), the control unit (120) and the communication unit (110) may be wired, and the control unit (120) and a first unit (e.g., 130, 140) may be wirelessly connected via the communication unit (110). In addition, each element, component, unit / part, and / or module within the wireless device (100, 200) may further include one or more elements. For example, the control unit (120) may be composed of a set of one or more processors. For example, the control unit (120) may be composed of a set of a communication control processor, an application processor, an electronic control unit (ECU), a graphics processing processor, a memory control processor, etc. As another example, the memory unit (130) may be composed of RAM (Random Access Memory), DRAM (Dynamic RAM), ROM (Read Only Memory), flash memory, volatile memory, non-volatile memory, and / or a combination thereof.

[0597] Below, the implementation example of Fig. 36 is described in more detail with reference to the drawings.

[0598] Figure 37 illustrates a mobile device applicable to various embodiments of the present disclosure. The mobile device may include a smartphone, a smart pad, a wearable device (e.g., a smartwatch, smartglasses), or a portable computer (e.g., a laptop, etc.). The mobile device may be referred to as a Mobile Station (MS), a User Terminal (UT), a Mobile Subscriber Station (MSS), a Subscriber Station (SS), an Advanced Mobile Station (AMS), or a Wireless Terminal (WT).

[0599] Referring to FIG. 37, the portable device (100) may include an antenna unit (108), a communication unit (110), a control unit (120), a memory unit (130), a power supply unit (140a), an interface unit (140b), and an input / output unit (140c). The antenna unit (108) may be configured as a part of the communication unit (110). Blocks 110 to 130 / 140a to 140c correspond to blocks 110 to 130 / 140 of FIG. 36, respectively.

[0600] The communication unit (110) can transmit and receive signals (e.g., data, control signals, etc.) with other wireless devices and base stations. The control unit (120) can control components of the mobile device (100) to perform various operations. The control unit (120) can include an AP (Application Processor). The memory unit (130) can store data / parameters / programs / codes / commands required for operating the mobile device (100). In addition, the memory unit (130) can store input / output data / information, etc. The power supply unit (140a) supplies power to the mobile device (100) and can include a wired / wireless charging circuit, a battery, etc. The interface unit (140b) can support connection between the mobile device (100) and other external devices. The interface unit (140b) can include various ports (e.g., audio input / output ports, video input / output ports) for connection with external devices. The input / output unit (140c) can input or output video information / signals, audio information / signals, data, and / or information input from a user. The input / output unit (140c) may include a camera, a microphone, a user input unit, a display unit (140d), a speaker, and / or a haptic module.

[0601] For example, in the case of data communication, the input / output unit (140c) obtains information / signals (e.g., touch, text, voice, image, video) input by the user, and the obtained information / signals can be stored in the memory unit (130). The communication unit (110) converts the information / signals stored in the memory into wireless signals, and can directly transmit the converted wireless signals to other wireless devices or to a base station. In addition, the communication unit (110) can receive wireless signals from other wireless devices or base stations, and then restore the received wireless signals to the original information / signals. The restored information / signals can be stored in the memory unit (130) and then output in various forms (e.g., text, voice, image, video, haptic) through the input / output unit (140c).

[0602] FIG. 38 illustrates a vehicle or autonomous vehicle applicable to various embodiments of the present disclosure.

[0603] Vehicles or autonomous vehicles can be implemented as mobile robots, cars, trains, manned or unmanned aerial vehicles (AVs), ships, etc.

[0604] Referring to FIG. 38, a vehicle or autonomous vehicle (100) may include an antenna unit (108), a communication unit (110), a control unit (120), a driving unit (140a), a power supply unit (140b), a sensor unit (140c), and an autonomous driving unit (140d). The antenna unit (108) may be configured as a part of the communication unit (110). Blocks 110 / 130 / 140a to 140d correspond to blocks 110 / 130 / 140 of FIG. 36, respectively.

[0605] The communication unit (110) can transmit and receive signals (e.g., data, control signals, etc.) with external devices such as other vehicles, base stations (e.g., base stations, road side units, etc.), and servers. The control unit (120) can control elements of the vehicle or autonomous vehicle (100) to perform various operations. The control unit (120) can include an ECU (Electronic Control Unit). The drive unit (140a) can drive the vehicle or autonomous vehicle (100) on the ground. The drive unit (140a) can include an engine, a motor, a power train, wheels, brakes, a steering device, etc. The power supply unit (140b) supplies power to the vehicle or autonomous vehicle (100) and can include a wired / wireless charging circuit, a battery, etc. The sensor unit (140c) can obtain vehicle status, surrounding environment information, user information, etc. The sensor unit (140c) may include an IMU (inertial measurement unit) sensor, a collision sensor, a wheel sensor, a speed sensor, an incline sensor, a weight detection sensor, a heading sensor, a position module, a vehicle forward / backward sensor, a battery sensor, a fuel sensor, a tire sensor, a steering sensor, a temperature sensor, a humidity sensor, an ultrasonic sensor, an illuminance sensor, a pedal position sensor, etc. The autonomous driving unit (140d) may implement a technology for maintaining a driving lane, a technology for automatically controlling speed such as adaptive cruise control, a technology for automatically driving along a set path, a technology for automatically setting a path and driving when a destination is set, etc.

[0606] For example, the communication unit (110) can receive map data, traffic information data, etc. from an external server. The autonomous driving unit (140d) can generate an autonomous driving route and driving plan based on the acquired data. The control unit (120) can control the drive unit (140a) so that the vehicle or autonomous vehicle (100) moves along the autonomous driving route according to the driving plan (e.g., speed / direction control). During autonomous driving, the communication unit (110) can irregularly / periodically acquire the latest traffic information data from an external server and can acquire surrounding traffic information data from surrounding vehicles. In addition, during autonomous driving, the sensor unit (140c) can acquire vehicle status and surrounding environment information. The autonomous driving unit (140d) can update the autonomous driving route and driving plan based on newly acquired data / information. The communication unit (110) can transmit information regarding the vehicle location, autonomous driving route, driving plan, etc. to the external server. External servers can predict traffic information data in advance using AI technology or other technologies based on information collected from vehicles or autonomous vehicles, and provide the predicted traffic information data to the vehicles or autonomous vehicles.

[0607] Figure 39 illustrates a vehicle applicable to various embodiments of the present disclosure. The vehicle may also be implemented as a means of transportation, a train, an aircraft, a ship, or the like.

[0608] Referring to FIG. 39, the vehicle (100) may include a communication unit (110), a control unit (120), a memory unit (130), an input / output unit (140a), and a position measurement unit (140b). Here, blocks 110 to 130 / 140a to 140b correspond to blocks 110 to 130 / 140 of FIG. 36, respectively.

[0609] The communication unit (110) can transmit and receive signals (e.g., data, control signals, etc.) with other vehicles or external devices such as base stations. The control unit (120) can control components of the vehicle (100) to perform various operations. The memory unit (130) can store data / parameters / programs / codes / commands that support various functions of the vehicle (100). The input / output unit (140a) can output AR / VR objects based on information in the memory unit (130). The input / output unit (140a) can include a HUD. The position measurement unit (140b) can obtain position information of the vehicle (100). The position information can include absolute position information of the vehicle (100), position information within a driving line, acceleration information, position information with respect to surrounding vehicles, etc. The position measurement unit (140b) can include GPS and various sensors.

[0610] For example, the communication unit (110) of the vehicle (100) can receive map information, traffic information, etc. from an external server and store them in the memory unit (130). The location measurement unit (140b) can obtain vehicle location information through GPS and various sensors and store the information in the memory unit (130). The control unit (120) can create a virtual object based on the map information, traffic information, and vehicle location information, and the input / output unit (140a) can display the created virtual object on the vehicle window (1410, 1420). In addition, the control unit (120) can determine whether the vehicle (100) is being driven normally within the driving line based on the vehicle location information. If the vehicle (100) abnormally deviates from the driving line, the control unit (120) can display a warning on the vehicle window through the input / output unit (140a). Additionally, the control unit (120) can broadcast a warning message regarding driving abnormalities to surrounding vehicles through the communication unit (110). Depending on the situation, the control unit (120) can transmit vehicle location information and information regarding driving / vehicle abnormalities to relevant authorities through the communication unit (110).

[0611] Figure 40 illustrates an XR device applicable to various embodiments of the present disclosure. The XR device may be implemented as an HMD, a head-up display (HUD) installed in a vehicle, a television, a smartphone, a computer, a wearable device, a home appliance, digital signage, a vehicle, a robot, and the like.

[0612] Referring to FIG. 40, the XR device (100a) may include a communication unit (110), a control unit (120), a memory unit (130), an input / output unit (140a), a sensor unit (140b), and a power supply unit (140c). Here, blocks 110 to 130 / 140a to 140c correspond to blocks 110 to 130 / 140 of FIG. 36, respectively.

[0613] The communication unit (110) can transmit and receive signals (e.g., media data, control signals, etc.) with external devices such as other wireless devices, portable devices, or media servers. The media data can include videos, images, sounds, etc. The control unit (120) can control components of the XR device (100a) to perform various operations. For example, the control unit (120) can be configured to control and / or perform procedures such as video / image acquisition, (video / image) encoding, metadata generation and processing, etc. The memory unit (130) can store data / parameters / programs / codes / commands required for driving the XR device (100a) / generating XR objects. The input / output unit (140a) can obtain control information, data, etc. from the outside, and output the generated XR objects. The input / output unit (140a) can include a camera, a microphone, a user input unit, a display unit, a speaker, and / or a haptic module, etc. The sensor unit (140b) can obtain the XR device status, surrounding environment information, user information, etc. The sensor unit (140b) may include a proximity sensor, an illuminance sensor, an acceleration sensor, a magnetic sensor, a gyro sensor, an inertial sensor, an RGB sensor, an IR sensor, a fingerprint recognition sensor, an ultrasonic sensor, a light sensor, a microphone, and / or a radar. The power supply unit (140c) supplies power to the XR device (100a) and may include a wired / wireless charging circuit, a battery, etc.

[0614] For example, the memory unit (130) of the XR device (100a) may include information (e.g., data, etc.) required for creating an XR object (e.g., AR / VR / MR object). The input / output unit (140a) may obtain a command to operate the XR device (100a) from the user, and the control unit (120) may operate the XR device (100a) according to the user's operating command. For example, when a user attempts to watch a movie, news, etc. through the XR device (100a), the control unit (120) may transmit content request information to another device (e.g., a mobile device (100b)) or a media server through the communication unit (130). The communication unit (130) may download / stream content such as movies and news from another device (e.g., a mobile device (100b)) or a media server to the memory unit (130). The control unit (120) controls and / or performs procedures such as video / image acquisition, (video / image) encoding, and metadata generation / processing for content, and can generate / output an XR object based on information about surrounding space or real objects acquired through the input / output unit (140a) / sensor unit (140b).

[0615] In addition, the XR device (100a) is wirelessly connected to the mobile device (100b) through the communication unit (110), and the operation of the XR device (100a) can be controlled by the mobile device (100b). For example, the mobile device (100b) can act as a controller for the XR device (100a). To this end, the XR device (100a) can obtain three-dimensional position information of the mobile device (100b), and then generate and output an XR object corresponding to the mobile device (100b).

[0616] Figure 41 illustrates robots applicable to various embodiments of the present disclosure. Robots may be classified into industrial, medical, household, military, and other categories depending on their intended use or field.

[0617] Referring to FIG. 41, the robot (100) may include a communication unit (110), a control unit (120), a memory unit (130), an input / output unit (140a), a sensor unit (140b), and a driving unit (140c). Here, blocks 110 to 130 / 140a to 140c correspond to blocks 110 to 130 / 140 of FIG. 36, respectively.

[0618] The communication unit (110) can transmit and receive signals (e.g., driving information, control signals, etc.) with external devices such as other wireless devices, other robots, or control servers. The control unit (120) can control components of the robot (100) to perform various operations. The memory unit (130) can store data / parameters / programs / codes / commands that support various functions of the robot (100). The input / output unit (140a) can obtain information from the outside of the robot (100) and output information to the outside of the robot (100). The input / output unit (140a) can include a camera, a microphone, a user input unit, a display unit, a speaker, and / or a haptic module. The sensor unit (140b) can obtain internal information of the robot (100), surrounding environment information, user information, etc. The sensor unit (140b) may include a proximity sensor, an illuminance sensor, an acceleration sensor, a magnetic sensor, a gyro sensor, an inertial sensor, an IR sensor, a fingerprint recognition sensor, an ultrasonic sensor, a light sensor, a microphone, a radar, etc. The driving unit (140c) may perform various physical operations such as moving the robot joints. In addition, the driving unit (140c) may enable the robot (100) to drive on the ground or fly in the air. The driving unit (140c) may include an actuator, a motor, wheels, brakes, propellers, etc.

[0619] FIG. 42 illustrates an AI device applicable to various embodiments of the present disclosure.

[0620] AI devices can be implemented as fixed or mobile devices, such as TVs, projectors, smartphones, PCs, laptops, digital broadcasting terminals, tablet PCs, wearable devices, set-top boxes (STBs), radios, washing machines, refrigerators, digital signage, robots, and vehicles.

[0621] Referring to FIG. 42, the AI ​​device (100) may include a communication unit (110), a control unit (120), a memory unit (130), an input / output unit (140a / 140b), a learning processor unit (140c), and a sensor unit (140d). Blocks 110 to 130 / 140a to 140d correspond to blocks 110 to 130 / 140 of FIG. 36, respectively.

[0622] The communication unit (110) can transmit and receive wired and wireless signals (e.g., sensor information, user input, learning models, control signals, etc.) with external devices such as other AI devices (e.g., FIG. W1, 100x, 200, 400) or AI servers (200) using wired and wireless communication technology. To this end, the communication unit (110) can transmit information within the memory unit (130) to the external device or transfer a signal received from the external device to the memory unit (130).

[0623] The control unit (120) may determine at least one executable operation of the AI ​​device (100) based on information determined or generated using a data analysis algorithm or a machine learning algorithm. In addition, the control unit (120) may control components of the AI ​​device (100) to perform the determined operation. For example, the control unit (120) may request, search, receive, or utilize data from the learning processor unit (140c) or the memory unit (130), and may control components of the AI ​​device (100) to perform at least one executable operation, a predicted operation, or an operation determined to be desirable. In addition, the control unit (120) may collect history information including the operation contents of the AI ​​device (100) or user feedback on the operation, and store the collected history information in the memory unit (130) or the learning processor unit (140c), or transmit the collected history information to an external device such as an AI server (FIG. W1, 400). The collected history information may be used to update a learning model.

[0624] The memory unit (130) can store data that supports various functions of the AI ​​device (100). For example, the memory unit (130) can store data obtained from the input unit (140a), data obtained from the communication unit (110), output data of the learning processor unit (140c), and data obtained from the sensing unit (140). In addition, the memory unit (130) can store control information and / or software codes necessary for the operation / execution of the control unit (120).

[0625] The input unit (140a) can obtain various types of data from the outside of the AI ​​device (100). For example, the input unit (120) can obtain learning data for model learning, input data to which the learning model will be applied, etc. The input unit (140a) may include a camera, a microphone, and / or a user input unit. The output unit (140b) may generate output related to sight, hearing, or touch. The output unit (140b) may include a display unit, a speaker, and / or a haptic module, etc. The sensing unit (140) can obtain at least one of internal information of the AI ​​device (100), information about the surrounding environment of the AI ​​device (100), and user information using various sensors. The sensing unit (140) may include a proximity sensor, an illuminance sensor, an acceleration sensor, a magnetic sensor, a gyro sensor, an inertial sensor, an RGB sensor, an IR sensor, a fingerprint recognition sensor, an ultrasonic sensor, a light sensor, a microphone, and / or a radar, etc.

[0626] The learning processor unit (140c) can train a model composed of an artificial neural network using learning data. The learning processor unit (140c) can perform AI processing together with the learning processor unit of the AI ​​server (Figure W1, 400). The learning processor unit (140c) can process information received from an external device via the communication unit (110) and / or information stored in the memory unit (130). In addition, the output value of the learning processor unit (140c) can be transmitted to an external device via the communication unit (110) and / or stored in the memory unit (130).

[0627] The claims described in the various embodiments of the present disclosure may be combined in various ways. For example, the technical features of the method claims of the various embodiments of the present disclosure may be combined and implemented as a device, and the technical features of the device claims of the various embodiments of the present disclosure may be combined and implemented as a method. Furthermore, the technical features of the method claims of the various embodiments of the present disclosure may be combined and implemented as a device, and the technical features of the method claims of the various embodiments of the present disclosure may be combined and implemented as a method.

Claims

1. In the method of operation of a third node in a communication system, A step of sharing information about the first node and the first secret symmetric key; A step of sharing information about a second node and a second secret symmetric key; A step of generating first random number information for quantum state conversion of a first message qubit; A step of transmitting first information generated by encrypting the first random number information based on the first secret symmetric key to the first node; A step of receiving second information generated by encrypting the signature information and the first transformation message information based on the second secret symmetric key from the second node, method.

2. In paragraph 1, A step of obtaining the signature information and the first conversion message information by decrypting the second information based on the second secret symmetric key; A step of obtaining a Bell state measurement result and a second message qubit by decrypting the above signature information based on the first secret symmetric key; A step of generating a third message qubit based on the first secret symmetric key from the first transformation message information; Further comprising a step of performing a first verification based on whether the second message qubit and the third message qubit match. method.

3. In paragraph 2, A step of restoring the first transformation message information based on the first secret symmetric key from the third message qubit; A step of acquiring GHZ state (Greenberger-Horne-Zeilinger state) information of the third node; A step of generating encrypted third information based on the second secret symmetric key for the first conversion message information, the result of the first verification, the second message qubit, the GHZ state information, and the bell state measurement result; Further comprising a step of transmitting the third information to the second node, The result of the first verification in which the second message qubit and the third message qubit do not match indicates to the second node that the signature information has been forged. method.

4. In paragraph 3, Further comprising a step of receiving a result of a second verification related to the consistency of the first conversion message information and the second conversion message information from the second node, The second conversion message information is based on the GHZ state information and the bell state measurement result. method.

5. In paragraph 4, A step of generating first conversion random number information by encrypting the first random number information based on the second secret symmetric key based on the consistency between the first conversion message information and the second conversion message information; Further comprising the step of transmitting the first conversion random number information to the second node, method.

6. In the method of operation of the first node in the communication system, A step of sharing information about the third node and the first secret symmetric key; A step of sharing information about the second node and the third secret symmetric key; Step of generating a first message qubit; A step of receiving encrypted first information based on the first secret symmetric key from the third node, with respect to the first random number information for quantum state conversion of the first message qubit, method.

7. In paragraph 6, A step of obtaining second random number information by decrypting the first information based on the first secret symmetric key; A step of generating first transformed message information by transforming the first message qubit based on the second random number information; A step of generating a second message qubit by converting the first conversion message information based on the first secret symmetric key; A step of generating signature information based on the bell state measurement result and the second message qubit; Further comprising a step of transmitting the above signature information and the first conversion message information to the second node, The discrepancy between the first random number information and the second random number information indicates to the second node that the signature information has been forged. method.

8. In paragraph 7, Further comprising a step of receiving a result of a second verification related to the consistency of the first conversion message information and the second conversion message information from the second node, The second conversion message information is based on the GHZ state (Greenberger-Horne-Zeilinger state) information of the third node and the bell state measurement result. method.

9. In paragraph 8, A step of generating second conversion random number information by encrypting the second random number information based on the consistency between the first conversion message information and the second conversion message information based on the third secret symmetric key; Further comprising the step of transmitting the second conversion random number information to the second node, method.

10. In paragraph 8, The result of the second verification, in which the first conversion message information and the second conversion message information do not match, indicates to the second node that the signature information has been forged. method.

11. In the method of operation of the second node in the communication system, A step of sharing information about the third node and the second secret symmetric key; A step of sharing information about the first node and the third secret symmetric key; A step of receiving signature information and first conversion message information from the first node; A step of transmitting second information encrypted based on the second secret symmetric key with respect to the above signature information and the first conversion message information to the third node; A step of receiving third information encrypted based on the second secret symmetric key from the third node with respect to the first transformation message information, the result of the first verification, the second message qubit, the GHZ state (Greenberger-Horne-Zeilinger state) information of the third node, and the Bell state measurement result; A step of obtaining the first conversion message information, the result of the first verification, the second message qubit, the GHZ state information, and the Bell state measurement result through decryption of the third information; A step of determining whether the signature information is secure, including forgery, based on the result of the first verification, method.

12. In paragraph 11, A step of generating second conversion message information using the GHZ state information and the bell state measurement result based on the above signature information not being falsified; A step of performing a second verification based on whether the first conversion message information and the second conversion message information match; Further comprising a step of transmitting the result of the second verification related to the consistency of the conversion message information and the second conversion message information to the first node and the third node. method.

13. In paragraph 12, A step of receiving first conversion random number information generated by encrypting first random number information based on the second secret symmetric key from the third node based on the result of the second verification related to the consistency of the first conversion message information and the second conversion message information; Further comprising a step of receiving second conversion random number information generated by encrypting second random number information based on the third secret symmetric key from the first node based on the consistency between the first conversion message information and the second conversion message information. method.

14. In paragraph 13, A step of obtaining the first random number information by decrypting the first transformed random number information based on the second secret symmetric key; A step of obtaining the second random number information by decrypting the second converted random number information based on the third secret symmetric key; Further comprising a step of performing a third verification based on whether the first random number information and the second random number information match. method.

15. In paragraph 14, A step of restoring a first message qubit using the second random number information from the conversion message information based on the consistency between the first random number information and the second random number information; Further comprising a step of discarding the conversion message information based on a non-match between the first random number information and the second random number information. method.

16. In the third node of the communication system, Transmitter and receiver; at least one processor; and At least one memory operably connectable to said at least one processor and storing instructions that, when executed by said at least one processor, perform operations; The above actions are, Comprising all steps of the method according to any one of claims 1 to 5, Third node.

17. In the first node of the communication system, Transmitter and receiver; at least one processor; and At least one memory operably connectable to said at least one processor and storing instructions that, when executed by said at least one processor, perform operations; The above actions are, Comprising all steps of the method according to any one of paragraphs 6 to 10, Node 1.

18. In the second node of the communication system, Transmitter and receiver; at least one processor; and At least one memory operably connectable to said at least one processor and storing instructions that, when executed by said at least one processor, perform operations; The above actions are, Comprising all steps of the method according to any one of claims 11 to 15, Second node.

Images