Abstract
The article introduces a revolutionary Nanorouter structure, which is a crucial component in the Nano communication regime. To complete the connection, many key properties of Nanorouters are investigated and merged. QCA circuits with better speed and reduced power dissipation aid in meeting internet standards. Cryptography based on QCA design methodologies is a novel concept in digital circuit design. Data security in nano-communication is crucial in data transmission and reception; hence, cryptographic approaches are necessary. The data entering the input line is encrypted by an encoder, and then sent to the designated output line, where it is decoded and transferred. The Nanorouter is offered as a data path selector, and the proposed study analyses the cell count of QCA and the circuit delay. In this manuscript, novel designs of (4:1)) Mux and (1:4) Demux designs are utilized to implement the proposed nanorouter design. The proposed (4:1) Mux design requires 3–5% fewer cell counts and 20–25% fewer area, and the propsoed (1:4) Demux designs require 75–80% fewer cell counts and 90–95% fewer area compared to their latest counterparts. The QCAPro utility is used to analyse the power consumption of several components that make up the router. QCADesigner 2.0.3 is used to validate the simulation results and output validity.
Similar content being viewed by others
Introduction
The advancement in VLSI technology mainly depends on scaling integrated circuits or ICs based on Moore's law. The CMOS technology is reaching its limits on the physical size through ultra-thin gate oxide effect, short channel effects, doping fluctuations and expensive lithography at the nanoscale level as significant drawbacks1. With considerable advances in Nanoelectronics devices, Quantum-dot cell automata (QCA) is the most encouraging option in contrast to traditional CMOS innovation. QCA device has some advantages over other by high speed, high density, and low power consumption that are very helpful for the design of digital circuits2,3,4. This technology, without any transistor, is very helpful in designing circuits at the nanoscale level. The primary unit of QCA is a cell composed of four divisions of quantum dots, with electrons located at the vertices of a square5,6. The QCA cell has a maximum of two electrons at a time, and these mutually stay apart at a maximum distance by repulsion through columbic force. These electrons have very little probability of being detected without an external field, so any particular electric field is required.
A router is an integral part of the internet, so it needs to be designed so that the packets coming to the input port must successfully transfer to the output port. An essential requirement is that the memory access rate should not be less than the line rate7,8. The QCA has the advantages of very low power dissipation, a tiny chip area and an ultra-high speed clock near the range of 1–2 THz. Using QCA technology, the router architecture is built, potentially increasing the internet speed. Cryptography is very helpful in protecting data, and this can be done very efficiently in the digital world.
For high-security communication, QCA is utilized to construct an effective Nanorouter, and by this, one can achieve less power with lesser delay and low circuit complexity. Some significant findings of this study are (1) the implementation of MUX and DEMUX through the newly proposed single-layer structure; (2) the implementation of a data path selector circuit that can work as a Nanorouter utilizing MUX and DEMUX; (3) a novel design of XOR gate having efficient area and lesser clock; (4) encoder and decoder circuit is designed using the XOR gate; (5) the power analysis of all the structure is shown and also with their thermal mapping with the help of QCA pro tool; (6) using all structure a cryptographic nano-communication architecture is obtained.
Background
QCA cell overview
A QCA cell is made up of four quantum dots that are implemented using metal islands on the substrate. The quantum dots adhere to the quantum confinement principle. Any QCA circuit is made up of these cells, and numerous alternative cell locations help to realise multiple logic gates. A single electron may be trapped by a dot in a cell, and it can have two electrons within it at the same time. Electrons are free and mobile, allowing them to tunnel between the dots. However, tunnelling outside the cells is not permitted due to the high potential barrier. Electrons in a cell settle along opposing diagonals due to their columbi1c interaction9. Two possible states are equivalent to each other; these states mainly have polarization P = − 1 and P = + 1. The formula can define the polarization:
The two polarization states define the binary logic states, P = − 1 will represent logic 0, and P = + 1 will represent logic 1 (Fig. 1). A cell near the other QCA cell will polarize the other cell accordingly, and the logic will pass.
The barrier between the cells can be moderated so that the logic will get passed as required, known as clocking. The clock is the only power source for a QCA cell. There are four clock phases: switch, hold, release, and relax, as shown in Fig. 210,11. In the first phase, the QCA cells will get depolarized as tunnelling potential barriers are low. At this phase, the interdot barriers increase and the polarization of cells starts according to the neighbour cells. The accurate computation will happen at this phase, and the barrier remains high for further tunnelling. In phase 2, the obstacles are kept high; as a result, states will be fixed to be valid for input to the next cell. In phase 3, the barriers are lowered, and the cells are depolarized. Finally, in the last phase, the obstacles are low for the cells to remain depolarized.
There are two primary logic gates in QCA designs: inverter and majority gate. The inverter gate inverts the logic by keeping the cells diagonally to each other. As the name suggests, the majority gate gives the output by considering the majority of inputs; its production is mainly provided by M (X, Y, Z) = XY + ZX + YZ. The other gates can also be acquired with the help of M.
Router architecture
It is composed of two fundamental building pieces, which are referred to as the data plane and the control plane. These blocks are based on the capabilities of a router. In this area, the control plane is responsible for mapping the network, and it is via this mapping that it is possible to execute protocols and configure the routing table. In contrast to the fact that the data plane uses a switch to forward data packets, the processing that takes place is determined by the packets themselves. The authors of this study have focused their attention on the design of data plane components12,13,14. The data plane receives information from the N incoming connections, processes it, and then sends it to the N output links. The most important part of a router is shown in Fig. 3, as seen there. At this point, the input is responsible for data linkage, search, and forwarding, and it is also the component that delivers packets to the switching fabric. The function of linking the input port and the output port is performed by the switch fabric. As shown in Fig. 3, the output port is responsible for performing the role of the reverse data link as well as receiving a packet from the switch fabric and sending that packet on to the outgoing link. It is indicated here that the routing processor is responsible for maintaining the forwarding table and carrying out activities related to network administration15.
When a data packet reaches the input port, it is combined with other data packets to form larger entities known as frames with the assistance of data link and physical functions. The packets also include the destination IP address, which is retrieved by the lookup table. Then, with the assistance of the forwarding table and depending on which output port is chosen by the switch fabric to forward the packets, it looks for the address that is the closest match to the maximum number of addresses in the lookup table. By executing the matching algorithm inside the routing processor, switch fabric ensures that all of the buses are linked both horizontally and vertically. There is also a period of time spent waiting for packets in the event that several packets arrive at the same time. If this occurs, one of the packets will be stopped while the other is transmitted.
The proposed work
XOR gate
Any digital circuit can be designed using some basic logic gates such as OR gate, AND gate, NOT gate and there are some universal gates NOR and NAND also available. In general, Exclusive-OR (XOR) and XNOR gates are utilized in designing any complex circuit.
So far, many XOR structures have been proposed in QCA technology. These are mainly based on the fundamental expression of the XOR gate as,
Equation (2) may be used to create majority-based structures. Here, in our encoder structure, an XOR gate is used to generate a cypher text by exchanging the input with the key. As a result, a more compact XOR structure is needed since the one which is utilized in the designs available is not the majority gate based and only requires 14 cells in the format16 (Fig. 4).
DEMUX
A demux receives many data output lines and chooses one to be transmitted to the input lines17. Signalling at the selection lines enables the selection of individual output lines. With one input line and four output lines through two selection lines, the demux is located at the receiver end of the transmission line. Demux is a crucial component of the router circuit in the proposed designs. When a demux is used in a course, the direction in which data will travel may be predetermined.
Work in Demux circuit designing for QCA needs to be better in the literature. Here the demux circuit designing is proposed based on the truth table, and the coplanar structure of demux is made with the majority less logic and using the concept of quantum dots. The proposed demux structure is obtained by a total number of 35 cells, as depicted in Fig. 5a and the thermal layout in Fig. 5b.
MUX
The MUX is used here to send part of the transmission line18. The 4:1 MUX is utilized in the proposed design, which has two select lines based on which the input cypher text is selected among four and one is sent. We are designing MUX with the help of the truth table available to us. Our design contains 32 cells and is also made with a majority less logic, as shown in Fig. 6a and the thermal layout in Fig. 6b.
Proposed cryptographic architecture
The proposed design makes use of the cryptographic architecture's composition, as shown in11,19, and20. The suggested layout takes into account a large number of input ports from which the data must be sent. Next, we'll apply encryption to the incoming data to make it unreadable. The next step is for them to send encrypted data over the chosen channel to their intended recipient. Ultimately, the original message will be decrypted at the output channel. The suggested Nanorouter system's configuration and schematic diagram are shown in Figs. 7 and 8.
The router's block diagram, which is essentially a data path selector circuit, confirms this. The MUX, gearbox line and DEMUX are the three fundamental parts. In this paper, the QCA Nanorouter design is given. The channel's inputs are A, B, C, and D, while its outputs are Aout, Bout, Cout, and Dout. The MUX's select lines are 0 and 1, whereas the DEMUX's has 3 and 4. The transmission line, which consists of only the connection of QCA cells linked by distinct clock zones, carries the input channels A, B, C, and D.
Security-wise, the suggested cryptographic architecture is a good idea. The cryptographic structure in this work is a symmetric key, meaning the same key is used for both the sender and the receiver. Here, data is encrypted using an XOR gate called an encoder. Here, the keys utilized are key1, key2, and key3 on the input side, and key11, key22, key33, and key44 on the output side.
Results
The simulation result of the proposed design is shown in Fig. 9. First, the selection lines are set to Sel0, Sel1, Sel3, and Sel4 with values set as 0, 1, 1, and 1, respectively. The inputs are a = 00001111, b = 11110000, c = 00000000, d = 11111111. All the keys are the same as key = 00001111, and here the key is taken at the receiver side as same, but as there is a delay in the line and the output is received after a delay of 2 clock cycles, it is also taken after two clock cycles.
Complexity of the circuit
Indicators of circuit complexity include the number of cells, the size of the cells, and the time it takes for a single clock cycle to complete. The complexity of the circuit is defined by the presence of an XOR gate, a 4:1 MUX, and a 1:4 DEMUX in the various modules of the proposed design, as indicated in Table 1. The suggested architecture's circuit cost is determined alongside its parts.
Comparison analysis from previous works
Only a few papers on nanocommunication circuits with QCA cell implementation are available. As a consequence, the outcomes of prior work must now be compared to the projected work. Because only the old designs are accessible, the chart only mentions four earlier works. Tables 2 and 3 show that the outcome has significantly improved.
Table 2 compares the cell count, delay, and area of the proposed 4:1 MUX to earlier designs. The suggested 4:1 MUX design has 25% larger area and 1 fewer QCA cell than the most recent design presented in21.
Table 3 comprares the cell count, latency and area for proposed 1:4 DEMUX with previous designs. The proposed (4:1) Mux design requires 3–5% fewer cell counts and 20–25% fewer area, and the propsoed (1:4) Demux designs require 75–80% fewer cell counts and 90–95% fewer area compared to their latest counterparts as shown in Tables 2 and 3. Table 4 shows that the proposed nanorutner has 5–10% improvement in cell counts, almost 100% improvement in latency and 5–10% fewer area compared to its recent counterparts.
Power analysis
An approximation approach like the Hartree–Fock approximation is necessary for the power consumption analysis in the QCA instance. To determine the output power, use the Hamiltonian matrix, as shown in15. Using the energy expenditure for a pair of neighbouring cells with opposing polarisations, as described in15, we can determine the average energy expenditure for a cell over the course of a clock cycle as:
Therefore, power for a single cell will be,
The second term in the above equation represents the instantaneous power dissipation so that the power will be calculated by integration over time. For power dissipation analysis, the QCA Pro tool with tunnelling energy as γ = 0.5 \(E_{k}\) \(1\,E_{k}\) and 1.5 \(E_{k}\) has been utilized, and thermal mapping of 4:1 Mux and 1:4 Demux is depicted as shown in Figs. 5b and 6b.
Here in Table 5, the power dissipation of the proposed circuits is shown, which is shown as an improved result than previous work where \({E}_{k}\) is the kink energy.
Here, the power estimation of the MUX and DEMUX is analyzed, and from the table, one can easily observe that the power dissipation is significantly less in the proposed circuit designs compared to the previous methods. This happened because most gates are not utilized in the proposed plans. In Table 6, an evaluation of projected and prior circuits for various 4:1 MUX structures is performed, and the results are shown as a bar graph representation in Fig. 10, and in Table 7, a comparison of different 1:4 DEMUX structures and their results are depicted with its bar graph representation in Fig. 11.
Conclusion
Even after encryption and many other techniques implemented in communication systems, the channel is vulnerable to a variety of side-channel attacks, including timing, caching, power monitoring, and electromagnetic assaults. Because the QCA-based circuit uses minimal power, it is not vulnerable to power analysis attacks. In this way, the proposed circuits are also resistant to comparable attacks. The recommended encoder, which uses an XOR, encrypts the input 8-bit data with the 8-bit key before delivering it to the output, where it is decrypted by the decoder, which also uses the 8-bit key. This, however, applies to any message size. When compared to the newest existing designs, the suggested Nanorouter circuit needs 8–10% fewer cell counts, 50–60% less latency, and over 3–5% less total space, thus demonstrating that the proposed design exceeds the current best-in-class designs. The Nanorouter circuit proposed here will be widely employed in future cryptographic algorithm implementations in QCA-based secure systems.
Data availability
The datasets generated during and/or analysed during the current study are available from the corresponding author on reasonable request.
References
Taur, Y. et al. CMOS scaling into the nanometer regime. Proc. IEEE 85(4), 486–503. https://doi.org/10.1109/5.573737 (1997).
Seyedi, S., Navimipour, N. J. & Otsuki, A. Design and analysis of fault-tolerant 1:2 demultiplexer using quantum-dot cellular automata nano-technology. Electronics https://doi.org/10.3390/electronics10212565 (2021).
Bhat, S. M. et al. Design of cost-efficient SRAM cell in quantum dot cellular automata technology. Electronics https://doi.org/10.3390/electronics12020367 (2023).
Alharbi, M., Edwards, G. & Stocker, R. Novel ultra-energy-efficient reversible designs of sequential logic quantum-dot cellular automata flip-flop circuits. J. Supercomput. https://doi.org/10.1007/s11227-023-05134-1 (2023).
Kassa, S., Gupta, P., Kumar, M., Stephan, T. & Kannan, R. Rotated majority gate-based 2n-bit full adder design in quantum-dot cellular automata nanotechnology. Circuit World https://doi.org/10.1108/CW-06-2020-0120 (2022).
Kassa, S. R., Misra, N. K. & Nagaria, R. Design, synthesis and assessment of QCA primitives of 5-input majority gate in field-coupled QCA nanotechnology. Optik 271, 170059. https://doi.org/10.1016/j.ijleo.2022.170059 (2022).
Das, J. C. & De, D. Nanocommunication network design using QCA reversible crossbar switch. Nano Commun. Netw. 13, 20–33. https://doi.org/10.1016/j.nancom.2017.06.003 (2017).
Das, S. & De, D. Nanocommunication using QCA: A data path selector cum router for efficient channel utilization. In 2012 International Conference on Radar, Communication and Computing (ICRCC), 21–22 December 43–47. https://doi.org/10.1109/ICRCC.2012.6450545 (2012).
Mohammadi, H., Navi, K. & Hosseinzadeh, M. An efficient quantum-dot cellular automata full adder based on a new convertible 7-input majority-not gate. IETE J. Res. https://doi.org/10.1080/03772063.2020.1838338 (2023).
Venna, R. K. R. & Jayakumar, G. D. Design of novel area-efficient coplanar reversible arithmetic and logic unit with an energy estimation in quantum-dot cellular automata. J. Supercomput. https://doi.org/10.1007/s11227-022-04740-9 (2023).
Aibin, Y. et al. Designs of BCD adder based on excess-3 code in quantum-dot cellular automata. IEEE Trans Circuits Syst. II Express Briefs 1(1), 1–5 (2023).
Sharma, U., Pradeep, K., Samanvita, N. & Raman, S. Implementation and performance evaluation of binary to gray code converter using quantum dot cellular automata. In Lecture Notes in Networks and Systems Vol. 436. https://doi.org/10.1007/978-981-19-1012-8_21 (2022).
Das, S. et al. Transistors based on two-dimensional materials for future integrated circuits. Nat. Electron. https://doi.org/10.1038/s41928-021-00670-1 (2021).
Kassa, S. & Nema, S. Energy efficient novel design of static random access memory memory cell in quantum-dot cellular automata approach. Int. J. Eng. Trans. B Appl. https://doi.org/10.5829/ije.2019.32.05b.14 (2019).
Majeed, A. H., Alkaldy, E., Zainal, M. S., Navi, K. & Nor, D. Optimal design of RAM cell using novel 2:1 multiplexer in QCA technology. Circuit World 46(2), 147–158. https://doi.org/10.1108/CW-06-2019-0062 (2019).
Chabi, A. M. et al. Towards ultra-efficient QCA reversible circuits. Microprocess. Microsyst. 49, 127–138. https://doi.org/10.1016/j.micpro.2016.09.015 (2017).
Shah, N. & Khanday, F. Design of quantum-dot cellular automata (QCA) based modular 1 to 2n demultiplexers. Int. J. Nanotechnol. Appl. 5, 47–58. https://doi.org/10.1109/MSPCT.2013.6782116 (2013).
Mardiris, V. A. & Karafyllidis, I. G. Design and simulation of modular 2n to 1 quantum-dot cellular automata (QCA) multiplexers. Int. J. Circuit Theory Appl. 38, 771–785 (2010).
Kahate, A. Cryptography-Network-Security-Atul-Kahate.Pdf. (2008).
Das, J. C. & De, D. Quantum Dot-Cellular Automata based cipher text design for nano-communication. In 2012 International Conference on Radar, Communication and Computing (ICRCC) Vol. 1 224–229. https://doi.org/10.1109/ICRCC.2012.6450583 (2012).
AlKaldy, E., Majeed, A. H., Zainal, M. S. & Nor, D. M. D. Optimum multiplexer design in quantum-dot cellular automata. Indones. J. Electr. Eng. Comput. Sci. 17(1), 148. https://doi.org/10.11591/ijeecs.v17.i1.pp148-155 (2020).
Sabbaghi-Nadooshan, R. & Kianpour, M. A novel QCA implementation of MUX-based universal shift register. J. Comput. Electron. https://doi.org/10.1007/s10825-013-0500-9 (2014).
Sen, B., Goswami, M., Mazumdar, S. & Sikdar, B. K. Towards modular design of reliable quantum-dot cellular automata logic circuit using multiplexers. Comput. Electr. Eng. https://doi.org/10.1016/j.compeleceng.2015.05.001 (2015).
Rashidi, H., Rezai, A. & Soltany, S. High-performance multiplexer architecture for quantum-dot cellular automata. J. Comput. Electron. 15(3), 968–981. https://doi.org/10.1007/s10825-016-0832-3 (2016).
Asfestani, M. N. & Heikalabad, S. R. A novel multiplexer-based structure for random access memory cell in quantum-dot cellular automata. Phys. B Condens. Matter 521, 162–167. https://doi.org/10.1016/j.physb.2017.06.059 (2017).
Ganesh, M. J. S. R. E. N. Implementation of Quantum cellular automata combinational and sequential circuits using Majority logic reduction method. Int. J. Nanotechnol. Appl. 2, 89–106 (2008).
Iqbal, J., Khanday, F. A. & Shah, N. A. Design of quantum-dot cellular automata (QCA) based modular 2 n-1-2nMUX-DEMUX. In IMPACT 2013—Proc. Int. Conf. Multimed. Signal Process. Commun. Technol. Vol. 5 189–193. https://doi.org/10.1109/MSPCT.2013.6782116 (2013).
Kim, K., Wu, K. & Karri, R. The robust QCA adder designs using composable QCA building blocks. IEEE Trans. Comput. Des. Integr. Circuits Syst. https://doi.org/10.1109/TCAD.2006.883921 (2007).
Teodósio, T. & Sousa, L. QCA-LG: A tool for the automatic layout generation of QCA combinational circuits. In 25th Norchip Conference, NORCHIP Vol. 1 1–5. https://doi.org/10.1109/NORCHP.2007.4481078 (2007).
Amiri, M. A., Mahdavi, M. & Mirzakuchaki, S. QCA implementation of a MUX-Based FPGA CLB. In Proceedings of the 2008 International Conference on Nanoscience and Nanotechnology, ICONN 2008 141–144. https://doi.org/10.1109/ICONN.2008.4639266 (2008).
Mukhopadhyay, D. & Dutta, P. Quantum cellular automata based novel unit reversible multiplexer. Adv. Sci. Lett. 16(1), 163–168. https://doi.org/10.1166/asl.2012.3266 (2012).
Das, J. C. & De, D. Optimized design of flip-flops using quantum-dot cellular automata. Quantum Matter 5(5), 680–688. https://doi.org/10.1166/qm.2016.1363 (2016).
Das, J. C. & De, D. Shannon’s expansion theorem-based multiplexer synthesis using QCA. Nanomater Energy 5(1), 53–60. https://doi.org/10.1680/jnaen.15.00008 (2016).
Acknowledgements
The authors did not receive financial support from any organization for the submitted work.
Author information
Authors and Affiliations
Contributions
All authors contributed equally to the conceptualization, formal analysis, investigation, methodology, and writing and editing of the original draft. All authors have read and agreed to the published version of the manuscript.
Corresponding authors
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher's note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Kassa, S., Das, J.C., Lamba, V. et al. Novel design of cryptographic architecture of nanorouter using quantum-dot cellular automata nanotechnology. Sci Rep 14, 10532 (2024). https://doi.org/10.1038/s41598-024-61260-7
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-024-61260-7
Keywords
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.