CN116170368A - Quantum key routing algorithm based on link contribution degree - Google Patents
Quantum key routing algorithm based on link contribution degree Download PDFInfo
- Publication number
- CN116170368A CN116170368A CN202111415619.5A CN202111415619A CN116170368A CN 116170368 A CN116170368 A CN 116170368A CN 202111415619 A CN202111415619 A CN 202111415619A CN 116170368 A CN116170368 A CN 116170368A
- Authority
- CN
- China
- Prior art keywords
- node
- link
- routing
- information
- key
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 230000005540 biological transmission Effects 0.000 claims abstract description 17
- 238000000034 method Methods 0.000 claims description 5
- 230000000977 initiatory effect Effects 0.000 claims description 3
- 230000009191 jumping Effects 0.000 claims description 3
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000011160 research Methods 0.000 abstract description 11
- 238000005259 measurement Methods 0.000 abstract description 7
- 238000004088 simulation Methods 0.000 abstract description 2
- 238000004891 communication Methods 0.000 description 7
- 238000000354 decomposition reaction Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000002596 correlated effect Effects 0.000 description 2
- 230000000875 corresponding effect Effects 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000002950 deficient Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000005610 quantum mechanics Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0852—Quantum cryptography
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention is oriented to remote and reliable relay type key routing, and aims at solving the problems that the existing research measurement mode is not comprehensive enough, the routing algorithm is not reasonable enough and the like, comprehensively considering various factors such as link length, link hop count, channel noise, available key quantity, service quality and the like, designing a new routing measurement function-link contribution degree, and providing a quantum key routing algorithm-BLC-QKRA based on the link contribution degree. Simulation experiments show that the algorithm is superior to the existing research in aspects of key distribution rate, average key transmission delay, network service quality and the like.
Description
Technical Field
The invention belongs to the field of network security, and particularly relates to a quantum key routing algorithm based on link contribution degree, which is used for secure communication of remote equipment.
Background
Nowadays, information security becomes one of the most interesting problems, and a plurality of information security accidents occur in recent years, so that people are promoted to research more advanced information encryption technology. As a core of information security, cryptography plays a vital role. In 1994, shor proposed a large number decomposition quantum algorithm, so that all asymmetric algorithms based on mathematical problems such as discrete logarithm decomposition and large prime number decomposition are invalid, and the security of network communication is seriously threatened. With the continuous progress of theoretical research and hardware technology, the security of the conventional encryption means in the visible time range is extremely reduced, an encryption means capable of resisting quantum computing attack is urgently needed, and the quantum key distribution technology perfectly solves the problem.
When a large quantum communication network is designed and built, not only the realization of a point-to-point short-distance key negotiation scheme is considered, but also the problem of how to find an optimal routing link and transmit a key to equipment nodes far away is solved. With the continuous establishment of large-scale quantum key networks around the world, the complexity of network models is continuously increased, and key routing problems in the networks are valued by vast researchers. According to the different compositions of the quantum communication network, the quantum key routing can be divided into four modes: optical switch routing, quantum repeater routing, trusted trunk routing, and QKD overlay routing. Since the preparation of optical switches and quantum repeaters is very difficult and expensive, routing schemes based on trusted trunking are the focus of current research. However, the existing research still has the problems of unreasonable routing path selection, defects of a key algorithm and the like, so the invention mainly researches the path transmission problem of the quantum key in the network and realizes the efficient transmission of the remote key. In summary, how to design a reasonable and effective key routing algorithm and apply the key routing algorithm to a real environment has very important significance in future unconditional secure communication networks.
Disclosure of Invention
Aiming at solving the problems of unreasonable measurement mode, defective algorithm design and the like of the conventional representative quantum key routing algorithm, the invention provides a quantum key routing algorithm-BLC-QKRA (Based on Link Contribution Quantum Key Routing Algorithm) based on link contribution degree. The algorithm comprehensively considers the influence of the link length, the link key generation rate, the available key quantity and the channel noise, and provides a new measurement mode, namely the link contribution degree. K alternative links are found according to the contribution degree of the links, and key transmission is carried out according to the arrangement of the hop count of the links from small to large. In the transmission process, the service quality conditions of the link and the network are simultaneously concerned, and the routing link is changed in time. The technical scheme adopted by the invention comprises the following steps:
step 1, broadcasting a Hello message by all equipment nodes, establishing a neighbor table according to the received message, recording the link contribution degree of a direct link, and then broadcasting the Hello message by each node at fixed time to assist in completing the updating of the neighbor table;
step 2, after obtaining the routing table, a certain node v s Initiating a routing request, expecting a key K SD To the destination node v d . Node v s Firstly, inquiring a neighbor table of the node v, and selecting the node v with the minimum contribution degree of the direct connection path link i Passing routing information to v i And v is set i And the corresponding link contribution is recorded in the own routing table, and then the source point v is recorded s Adding the data into the set S, and initializing an array D;
step 3, v i After receiving the routing information, firstly inquiring whether the destination node in the information is the destination node, and if the destination node is the destination node, jumping to the step six; if not, carrying out the fourth step;
step 4, observing all v i If there is a side starting from v i To v j Record the new path v s To v j Is of the degree of link contribution dv i ]+W[e i,j ]Such asIf the link contribution degree is higher than that of the original DV j ]If it is small, then replace the original D v with the new value j ]And node v j Adding to the set S;
step 5, continuously repeating the step four until the set U is an empty set, and performing a step six;
step 6, the route information is transmitted to the destination node v d After that, v d And calculating route information according to the transmitted information, and returning all the calculated route information to the previous node according to the original route. Each node returns in turn according to the route information and finally transmits to the source node v s ；
Step 7, v s Recording the routing path as P (i), calculating the routing information of the path according to the information, regarding all nodes except the destination node as offset nodes, calculating the minimum link contribution degree from each offset node to the destination node, and splicing the path from the source node to the offset node on the previous P (i) to form a candidate path. Then selecting a path with the smallest link contribution degree in the candidate paths as a next route path P (i+1);
step 8, after obtaining all K paths, sequencing all paths according to the hop count from small to large, starting key transmission from a first path, and calculating QoS conditions on other paths at regular time in the transmission process;
and 9, when the key generation rate of a certain section of link on the path is smaller than or equal to 0, a key resource exhaustion alarm is needed. The node with problems continuously returns an alarm message to the upper stage according to the routing table, the source node stops the key transmission of the link after receiving the message, sends an attempt message to the next hop node of the alternative next path, and detects whether the path is available. Switching to a new path as a new route when the path is available;
the positive effects of the invention
(1) The invention provides a new quantum key routing metric, namely link contribution degree, which comprehensively considers a plurality of factors such as link length, link hop count, channel noise, available key quantity, service quality and the like, and converts the multi-constraint NPC problem into a single-constraint optimal problem which can be solved in polynomial time.
(2) The link contribution degree provided by the invention is positively correlated with the available key quantity of the link, is negatively correlated with the link noise, and accords with the routing strategy under the actual condition.
(3) The quantum key routing algorithm based on the link contribution degree provided by the invention is superior to the existing representative quantum key routing algorithm in the evaluation of key distribution rate, average key transfer delay and network service quality through experimental verification.
Drawings
FIG. 1 is a schematic of the basic flow of an example method of the invention.
Fig. 2 is a message format diagram.
Fig. 3 is a network topology establishment flow chart.
Detailed Description
Due to the unique properties of quantum mechanics, quantum secret communication has theoretically unconditional security, and quantum key routing algorithms are the focus of current research. However, the existing studies still have the following problems to be solved: (1) The quantum key routing algorithm has the defects that the consideration factors are not comprehensive enough and the link measurement mode has. (2) theoretical research results are not combined with practical practices.
The point-to-point quantum key agreement protocol has unavoidable physical limitations in practical applications, which are also critical to the efficiency of QKD network communications. In addition, key transmission across devices, remote distances, is also an important application in QKD networks in addition to key agreement between directly connected devices. Therefore, the design of a proper and effective quantum key routing algorithm has extremely important significance for realizing remote key transmission and large-scale network application.
The invention is oriented to remote and reliable relay type key routing, and aims at solving the problems that the existing research measurement mode is not comprehensive enough, the routing algorithm is not reasonable enough and the like, comprehensively considering various factors such as link length, link hop count, channel noise, available key quantity, service quality and the like, designing a new routing measurement function-link contribution degree, and providing a quantum key routing algorithm-BLC-QKRA based on the link contribution degree. Simulation experiments show that the algorithm is superior to the existing research in aspects of key distribution rate, average key transmission delay, network service quality and the like.
The invention relates to a quantum key routing algorithm based on link contribution degree, which comprises the following specific processes:
step 1, broadcasting a Hello message by all equipment nodes, establishing a neighbor list according to the received message, recording the link contribution degree of a direct link, and then broadcasting the Hello message at regular time by each node to assist in completing the updating of the neighbor list, wherein the message structure is shown in figure 2, and the network topology establishment process is shown in figure 3;
step 2, after obtaining the routing table, a certain node v s Initiating a routing request, expecting a key K SD To the destination node v d . Node v s Firstly, inquiring a neighbor table of the node v, and selecting the node v with the minimum contribution degree of the direct connection path link i Passing routing information to v i And v is set i And the corresponding link contribution is recorded in the own routing table, and then the source point v is recorded s Adding the data into the set S, and initializing an array D;
step 3, v i After receiving the routing information, firstly inquiring whether the destination node in the information is the destination node, and if the destination node is the destination node, jumping to the step six; if not, go to step four.
Step 4, observing all v i If there is a side starting from v i To v j Record the new path v s To v j Is of the degree of link contribution dv i ]+W[e i,j ]If the link contribution is higher than the original dv j ]If it is small, then replace the original D v with the new value j ]And node v j Adding to the set S;
step 5, continuously repeating the step four until the set U is an empty set, and performing a step six;
step 6, the route information is transmitted to the destination node v d After that, v d The routing information is calculated from the information delivered,and then returning all the calculated route information to the previous node according to the original route. Each node returns in turn according to the route information and finally transmits to the source node v s ；
Step 7, v s Recording the routing path as P (i), calculating the routing information of the path according to the information, regarding all nodes except the destination node as offset nodes, calculating the minimum link contribution degree from each offset node to the destination node, and splicing the path from the source node to the offset node on the previous P (i) to form a candidate path. Then selecting a path with the smallest link contribution degree in the candidate paths as a next route path P (i+1);
step 8, after obtaining all K paths, sequencing all paths according to the hop count from small to large, starting key transmission from a first path, and calculating QoS conditions on other paths at regular time in the transmission process;
and 9, when the key generation rate of a certain section of link on the path is smaller than or equal to 0, a key resource exhaustion alarm is needed. The node with problems continuously returns an alarm message to the upper stage according to the routing table, the source node stops the key transmission of the link after receiving the message, sends an attempt message to the next hop node of the alternative next path, and detects whether the path is available. When a path is available, a switch is made to the new path as a new route.
Claims (5)
1. A quantum key routing algorithm based on link contribution, the method comprising the steps of:
step 1, broadcasting a Hello message by all equipment nodes, establishing a neighbor table according to the received message, recording the link contribution degree of a direct link, and then broadcasting the Hello message by each node at fixed time to assist in completing the updating of the neighbor table;
step 2, after obtaining the routing table, a certain node v s Initiating a routing request, expecting a key K SD To the destination node v d Node v s Firstly, inquiring a neighbor table of the node v, and selecting the node v with the minimum contribution degree of the direct connection path link i Passing routing information to v i And v is set i And the corresponding link contribution is recorded in the own routing table, and then the source point v is recorded s Adding the data into the set S, and initializing an array D;
step 3, v i After receiving the routing information, firstly inquiring whether the destination node in the information is the destination node, and if the destination node is the destination node, jumping to the step six; if not, carrying out the fourth step;
step 4, observing all v i If there is a side starting from v i To v j Record the new path v s To v j Is of the degree of link contribution dv i ]+W[e i,j ]If the link contribution is higher than the original dv j ]If it is small, then replace the original D v with the new value j ]And node v j Adding to the set S;
step 5, continuously repeating the step four until the set U is an empty set, and performing a step six;
step 6, the route information is transmitted to the destination node v d After that, v d Calculating route information according to the transmitted information, returning all calculated route information to the previous node according to the original route, and sequentially returning each node according to the route information and finally transmitting the route information to the source node v s ；
Step 7, v s Recording the route path as P (i), calculating route information of the route according to the information, regarding all nodes except the destination node as offset nodes, calculating the minimum link contribution degree from each offset node to the destination node, splicing the offset nodes with the route from the source node to the offset node on the previous P (i) to form a candidate route, and selecting the route with the minimum link contribution degree in the candidate route as a next route P (i+1);
step 8, after obtaining all K paths, sequencing all paths according to the hop count from small to large, starting key transmission from a first path, and calculating QoS conditions on other paths at regular time in the transmission process;
and 9, when the key generation rate of a certain section of link on the path is smaller than or equal to 0, carrying out key resource exhaustion alarm, continuously reporting an alarm message to the upper stage by the node with problems according to the routing table, stopping key transmission of the link after receiving the message by the source node, sending an attempt message to the next hop node of the next path to be replaced, detecting whether the path is available, and switching to a new path as new routing when the path is available.
2. The quantum key routing algorithm based on link contribution according to claim 1, wherein: in the network topology establishment process described in the first step, in the QKD network, each device node needs to broadcast a Hello message periodically, the device receiving the message may add the address of the sending device to its own neighbor table according to the message information, if one device does not receive the Hello message of a certain link for more than a specified time, the link is considered to be disconnected, and the device address corresponding to the link is set to be inactive from the neighbor table, when the device node exits the network, two strategies may be adopted, one strategy is that the node exiting the network actively broadcasts a farwell message to inform the surrounding nodes of its own exit information, the node receiving the farwell message queries the local neighbor table, deletes the corresponding device address information, and the other may use the timeout strategy of the Hello message body, and when the Hello message of a certain device in the neighbor table is not received for more than a certain predetermined time, the current device node will actively delete the unresponsive device address information.
3. The quantum key routing algorithm based on the link contribution according to claim 1, wherein the rule of initializing the array D in the second step is as follows.
4. The quantum key routing algorithm based on link contribution according to claim 1, wherein the rule of the fourth step can be described by the following formula.
D[v j ]＝min{D[v j ],D[v i ]+W[e i,j ]} (2)
5. A quantum key routing algorithm based on link contribution according to claim 1, wherein a new quantum key routing metric, the link contribution, is defined as follows.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111415619.5A CN116170368A (en) | 2021-11-25 | 2021-11-25 | Quantum key routing algorithm based on link contribution degree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111415619.5A CN116170368A (en) | 2021-11-25 | 2021-11-25 | Quantum key routing algorithm based on link contribution degree |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116170368A true CN116170368A (en) | 2023-05-26 |
Family
ID=86411925
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111415619.5A Pending CN116170368A (en) | 2021-11-25 | 2021-11-25 | Quantum key routing algorithm based on link contribution degree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116170368A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117527239A (en) * | 2024-01-08 | 2024-02-06 | 中国科学技术大学 | Distributed routing method and system for load balancing in quantum key distribution network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7706535B1 (en) * | 2003-03-21 | 2010-04-27 | Bbn Technologies Corp. | Systems and methods for implementing routing protocols and algorithms for quantum cryptographic key transport |
| US20160344714A1 (en) * | 2014-02-14 | 2016-11-24 | Nokia Technologies Oy | Key distribution in a wireless system |
| CN106230582A (en) * | 2016-07-17 | 2016-12-14 | 西安电子科技大学 | Random routing method in quantum secret communication network |
| CN109962774A (en) * | 2017-12-22 | 2019-07-02 | 山东量子科学技术研究院有限公司 | Quantum cryptography networks key relays dynamic routing method |
| CN110086713A (en) * | 2019-04-17 | 2019-08-02 | 北京邮电大学 | It is a kind of to divide domain method for routing for wide area quantum key distribution network |
-
2021
- 2021-11-25 CN CN202111415619.5A patent/CN116170368A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7706535B1 (en) * | 2003-03-21 | 2010-04-27 | Bbn Technologies Corp. | Systems and methods for implementing routing protocols and algorithms for quantum cryptographic key transport |
| US20160344714A1 (en) * | 2014-02-14 | 2016-11-24 | Nokia Technologies Oy | Key distribution in a wireless system |
| CN106230582A (en) * | 2016-07-17 | 2016-12-14 | 西安电子科技大学 | Random routing method in quantum secret communication network |
| CN109962774A (en) * | 2017-12-22 | 2019-07-02 | 山东量子科学技术研究院有限公司 | Quantum cryptography networks key relays dynamic routing method |
| CN110086713A (en) * | 2019-04-17 | 2019-08-02 | 北京邮电大学 | It is a kind of to divide domain method for routing for wide area quantum key distribution network |
Non-Patent Citations (5)
| Title |
|---|
| IVAN B.DJORDJEVIC: "On the Photon Subtraction-Based Measurement-Device-Independent CV-QKD Protocols", IEEE ACCESS, 14 October 2019 (2019-10-14) * |
| JIANCHUAN XING:LIANGYIN CHEN: "The Architecture of Hospitital Information System for Cancer Collaboration Projects", 2007 IEEE/ICME INTERNATIONAL CONFERENCE ON COMPLEX MEDICAL ENGINEERING, 12 November 2007 (2007-11-12) * |
| VERNAM G S.CIPER: "For secret wire and radio telegraphic communications", JOURNAL OF THE AIEE, vol. 45, no. 2, 31 December 1926 (1926-12-31) * |
| 李杨: "QKD网络中的认证组密钥协商协议设计", 现代计算机, 5 March 2021 (2021-03-05) * |
| 杨超;张红旗;苏锦海;陈华城;: "基于密钥中继的广域量子密钥网络路由方案", 网络与信息安全学报, no. 11, 15 November 2017 (2017-11-15) * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117527239A (en) * | 2024-01-08 | 2024-02-06 | 中国科学技术大学 | Distributed routing method and system for load balancing in quantum key distribution network |
| CN117527239B (en) * | 2024-01-08 | 2024-03-29 | 中国科学技术大学 | Distributed routing method and system for load balancing in quantum key distribution network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10263885B2 (en) | Wireless home network routing protocol | |
| Mao et al. | Multipath routing for multiple description video in wireless ad hoc networks | |
| Le et al. | DCAR: Distributed coding-aware routing in wireless networks | |
| Batayneh et al. | On routing and transmission-range determination of multi-bit-rate signals over mixed-line-rate WDM optical networks for carrier ethernet | |
| Yu et al. | Distributed wireless quantum communication networks with partially entangled pairs | |
| KR20120042892A (en) | Control element, forwarding element and routing method for internet protocol network | |
| CN105681028B (en) | Multi-user network system with football structure and quantum key distribution method thereof | |
| CN106850436B (en) | Mine hybrid wireless mesh network routing method based on virtual potential energy field | |
| Zhang et al. | Fragmentation-aware entanglement routing for quantum networks | |
| Li et al. | Node-disjointness-based multipath routing for mobile ad hoc networks | |
| Yang et al. | QoS routing protocol based on link stability with dynamic delay prediction in MANET | |
| Cohen et al. | Bringing network coding into SDN: Architectural study for meshed heterogeneous communications | |
| CN116170368A (en) | Quantum key routing algorithm based on link contribution degree | |
| CN116866899B (en) | Multi-node wireless ad hoc network communication method and device, electronic equipment and storage medium | |
| Renold et al. | Source based trusted AODV routing protocol for mobile ad hoc networks | |
| Sing et al. | Routing Protocols and Their Performance in Mobile Ad hoc Networks: A Quality of Service Optimization Perspective | |
| CN206807465U (en) | The multi-user quantum key distribution network structure of football alkene structure | |
| Baolin et al. | QoS-aware multicast routing protocol for Ad hoc networks | |
| CN115460129A (en) | Quantum key distribution routing method based on OSPF protocol | |
| Xu-Tao et al. | Distributed wireless quantum communication networks | |
| JP3742571B2 (en) | Route maintenance method, route maintenance system, and wireless node device in wireless network | |
| Kou et al. | Multipath routing with erasure coding in underwater delay tolerant sensor networks | |
| Mohammed et al. | Performance Analysis of DSR, AODV On-Demand Routing Protocols in Mobile Ad Hoc Networks | |
| Brito et al. | On supporting forwarding strategies and sync protocols through NDN distance vector routing | |
| Monita et al. | A Quantum Key Distribution Network Routing Performance Based on Software-Defined Network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |