Skip to main content
Wiley Open Access Collection logoLink to Wiley Open Access Collection
. 2026 Jul 28;10(17):e70889. doi: 10.1002/smtd.70889

Reconfigurable Physical Unclonable Function‐Based Cryptographic Scheme Based on Memory‐Enabled GFET Modulators

Yichong Ren 1, Chia‐Heng Sun 1, Mohan De Silva 2, Zong‐Ru Lee 1, Minye Yang 1, Saad Alshahrani 1, Jimmy Ching‐Ming Chen 3, Mark Ming‐Cheng Cheng 4, C Suzanne Miller 5, Ralu Divan 5, Zhixian Zhou 2, Pai‐Yen Chen 1,✉
PMCID: PMC13555643  PMID: 42517284

ABSTRACT

Modern society, increasingly connected by the Internet of Things (IoT), is generating and exchanging data at an unprecedented pace, including sensitive and classified information that is vulnerable to cyberattacks. To address this challenge, we propose a new hardware security primitive, the strong radio‐frequency (RF) physically unclonable function (PUF), which leverages a graphene field‐effect transistor (GFET)‐based harmonic transponder. Thanks to graphene's exceptional electrical and mechanical properties, this PUF exhibits excellent randomness, uniqueness, and reliability for encryption applications. Additionally, the remarkable reconfigurability has been demonstrated by tuning the gate voltage, operating frequency, and different memory effect doping states, thereby strengthening reliability and robustness against various environmental factors. We further employ an artificial intelligence (AI)‐assisted classification framework for device authentication from measured PUF responses, where a one‐dimensional convolutional neural network (1D‐CNN) encoder learns device‐specific embeddings via contrastive (metric) learning with waveform augmentation, and query responses are identified using cosine‐similarity nearest‐neighbor matching, enabling robust recognition across multiple operating conditions. This proposed GFET PUF represents a new direction for hardware security and analog PUFs, with potential implications for various cryptographic and encryption applications in the era of IoT.

Keywords: artificial intelligence (AI)‐assisted classification, graphene field‐effect transistors (GFETs), hardware security, low‐dimensional nanomaterials, memory effect, physical unclonable functions (PUFs)


Wireless challenge waveforms probe graphene field‐effect transistor (GFET) devices, producing device‐unique analog responses that are digitized into cryptographic bit strings and bitmap keys. The scheme transforms intrinsic GFET variability into unclonable, contactless hardware security, enabling compact physical unclonable functions for encrypted identification and authentication.

graphic file with name SMTD-10-e70889-g001.webp

1. Introduction

The advancement of 5G and beyond technologies has given a rebirth to the internet‐of‐things (IoTs), leading to a massive interaction of classified data and privacy among numerous sensors, mobile devices, and edge terminals [1, 2]. This has made protecting these devices and the information they hold a top priority, as cyberattacks have become more frequent and sophisticated in modern society. One of the traditional methods of protecting these devices is using key‐and‐lock systems, which have been around for thousands of years, with one ancient legacy discovered in the ruins of Nineveh [3, 4]. The rapid development of science and technology, particularly in computer science, has led to the essential evolution of key‐and‐lock systems from mechanical to electronic and digital. Notably, in software‐based encryption systems, “keys” are formed by specific digital passwords stored in memory, and “locks” determine user access [5, 6]. This class of encryption systems, however, has been proven to be vulnerable against artificial intelligence‐related machine/deep learning algorithms [7, 8].

To tackle this issue, tremendous research effort has been devoted to hardware‐enabled cryptographic solutions over the past decades. One of the most popular hardware‐based security solutions to emerge in recent years is the physically unclonable function (PUF) [9, 10]. PUFs are hardware instances that unpredictably map input challenges (e.g., optical, electrical, thermal, and mechanical signals) to unique output responses based on device‐specific characteristics. These challenge‐response pairs (CRPs), therefore, serve as the “keys” to this hardware security primitive that are unclonable and unpredictable [11, 12, 13]. An excellent PUF is desired to feature high randomness, uniqueness, and reliability, the three primary metrics of a PUF, to ensure high‐level encryption quality. The randomness of PUF primarily manifests in the entropy of CRPs, and uniqueness is evaluated by the large differences between two CRPs generated by distinct PUF instances, reflecting unclonability and unpredictability [10, 11, 14]. Additionally, CRPs generated by a single PUF instance under different operating conditions (e.g., temperature, humidity) should be consistent to ensure the desired reliability [15, 16, 17]. PUFs can also be categorized as weak and strong, depending on their ability to generate CRPs. Weak PUFs that can generate only a limited number of CRPs are often used for key generation and exchange. On the contrary, strong PUFs having a large number of CRPs are suitable for secure communication and authentication applications [11]. In particular, the era of IoT has raised many scenarios of wireless secure identification and authentication [18]. Nonetheless, most state‐of‐the‐art PUFs are based on digital integrated circuits (ICs), which are not inherently suitable for wireless applications. Examples include static random‐access memory (SRAM) PUFs [19, 20], arbiter PUFs [21, 22], and memristor PUFs [23, 24]. Additionally, whereas silicon‐based PUFs benefit greatly from the reliability of mature complementary metal‐oxide‐semiconductor (CMOS) fabrication foundries, which provide precisely controlled fabrication processes, they simultaneously suffer from low device‐to‐device variance, resulting in low randomness and uniqueness [11, 25]. To make matters worse, recent work has shown that conventional silicon‐based PUFs may still be susceptible to machine‐learning‐assisted cyberattacks due to their poor performance, rendering this hardware cryptographic alternative less secure than expected [26, 27, 28].

Graphene has attracted immersive research efforts in the past decades for its extraordinary electrical and mechanical properties. The two‐dimensional and exotic monatomic structure and the low density of states make graphene highly sensitive to external charged particles and to chemical or electrical gating effects [29, 30, 31]. Therefore, in industry, precisely controlling GFET performance in mass production remains a longstanding challenge, as unavoidable fabrication flaws can introduce significant device‐to‐device fluctuations. While such variation may be regarded as a problem for sensing applications, on the flip side, it can indeed be utilized in PUF applications, since drastic device‐to‐device variations may endow the PUF with high unpredictability and unclonability, and thus a high level of encryption [16, 32, 33]. Some previous research has shown that graphene and other two‐dimensional material‐based PUF security schemes feature excellent performance in terms of uniqueness, randomness, and stability, as exemplified by GFET‐enabled electronic PUFs (including memristive/random access memory (RRAM) PUFs) [31, 34] and straintronic PUFs [35]. To this end, we present herein a robust radio‐frequency (RF) PUF system based on a back‐gated graphene field‐effect transistor (GFET) that can wirelessly communicate between “keys” and “locks,” as diagrammed in Figure 1a. The proposed GFET PUF system can be integrated into a compact tag of similar size to a credit card, consisting of a GFET‐enabled harmonic transponder as the PUF core, a power management unit, and transmitting (T x) and receiving (R x) antennas. Under specific excitations (input challenges), this fully integrated, compact ID tag may backscatter unique output responses as radio signals. Once the reader recognizes the backscattered signals, the wireless secure identification process will be completed. Additionally, we demonstrate the robustness of the proposed GFET PUF by applying embedding‐based artificial intelligence (AI) classification with cosine nearest neighbor (Cosine‐NN) matching to its measured signals, enabling reliable device‐to‐device recognition and supporting practical hardware security and wireless secure communication systems. We envision that our work may open a new direction for investigating RF PUFs and true random number generators (TRNGs), which may benefit a variety of IoT applications, such as anti‐counterfeiting of food and drugs, device authentication, and the encryption of sensitive information and privacy.

FIGURE 1.

FIGURE 1

Diagram of the GFET PUF system, statistical characteristics of GFETs, and formation of CRPs. (a) Schematic of the near‐field secure communication/identification system embedded with the proposed GFET PUF. (b) Photograph of a fabricated monolayer GFET obtained from an optical microscope. (c) Measured original I−V characteristics of 20 fabricated GFETs. (d) Formation of challenge‐response pairs (CRPs) by our proposed GFET PUF. Here, the radio signals with different DC offsets, amplitudes, and frequencies serve as the challenges, and the modulated signals function as the responses. After proper discretization and digitization, the temporal responses will be converted to binary CRP maps.

2. Results

2.1. Electrical Characteristics and Memory Effect of the GFET Modulator

Figure 1b shows the image of the employed GFET, of which the monolayer graphene is grown by chemical vapor deposition (CVD) (see Methods for details). The GFET used in this work adopts a back‐gated configuration, in which the degenerately doped Si substrate serves as the global gate electrode, and the thermally grown SiO2 is contacted by metal source/drain electrodes. We measured their transfer characteristics to study the intrinsic device‐to‐device variations among different GFETs induced during the fabrication process. The results of the original transfer characteristics of 20 GFETs are plotted in Figure 1c, where the I−V curves of the GFETs have a distinct “V‐shape” feature, and the voltage leading to the minimum of drain‐to‐source current corresponds to the Dirac point or charge neutrality point (V cnp) of the GFET [36]. Unlike a traditional metal‐oxide‐semiconductor field effect transistor (MOSFET), such a “V‐shape” transfer characteristic may bring the device unique frequency responses, which will be explicitly discussed later in this section. From Figure 1c, the average value of V cnp points is 30.3 V with a standard deviation of 4.21 V following a Gaussian distribution displayed in Section 1 of Supporting Information, despite all 20 devices being fabricated following the same process, proving the intrinsic device‐to‐device fluctuations existing in the transfer characteristics of GFET devices due to the fabrication flaws. Such deviations may be attributed to structural defects, non‐uniform strain, randomly distributed poly (methyl methacrylate) (PMMA) residues, or copper etchant residues on the graphene surface during fabrication. Therefore, the comprehensive product of intrinsic device‐to‐device variations on both V cnp points and carrier mobilities may serve as the ideal physical entropy source for the GFET PUF, providing the desired randomness and uniqueness.

To directly examine the material origin of this device‐to‐device variation, we performed Kelvin probe force microscopy (KPFM; Park Systems XE‐70) on the CVD‐grown graphene channels (Figure 2). KPFM probes the local contact potential difference (CPD), which is closely related to the work‐function difference between the graphene surface and the conductive AFM tip. Therefore, spatial and device‐to‐device CPD variations provide a direct indication of local work‐function and electrostatic‐potential variations in the graphene channel. A representative channel with uniform thickness and no visible residue shows a relatively uniform CPD distribution within the scanned region (Figure 2a–c), suggesting that the local potential landscape can be reasonably homogeneous within an individual clean channel. Across 20 nominally identical GFET channels, however, the mean CPD values vary from approximately −105 to 186 mV, which is illustrated in Figure 2d. This indicates appreciable channel‐to‐channel work‐function dispersion. The CPD dispersion is consistent with the fact that the charge‐neutrality point of graphene is highly sensitive to local electrostatic doping, charge traps in the SiO2 substrate, adsorbates, fabrication residues, and graphene thickness or surface‐potential nonuniformity [37, 38, 39, 40]. As the graphene work function and CPD are linked to the local charge‐neutrality condition, the measured CPD variation provides material‐level evidence that nominally identical GFETs can exhibit distinct V CNP values and nonlinear transfer characteristics. These differences are not merely parasitic device variations; in the proposed GFET PUF, they act as intrinsic physical entropy sources that modulate the RF response and contribute to the observed randomness, uniqueness, and device‐specific fingerprints. Additional KPFM measurements, including device‐array statistics and representative CPD variations associated with graphene thickness nonuniformity, exposed SiO2 regions, and surface residues, are summarized in Section 1 of the Supporting Information.

FIGURE 2.

FIGURE 2

KPFM characterization of CVD‐grown graphene channels. (a) Topography and (b) KPFM CPD images of a representative graphene channel with a relatively uniform surface. (c) CPD histogram over the scanned area for the representative channel. (d) Distribution of the mean CPD values measured from 20 GFET channels.

In addition to the special “V‐shape” feature, the proposed back‐gated GFETs are also well known for the memory effect, demonstrating the reconfigurability of V cnp points, which can further enhance the non‐reproducibility and stability of the proposed back‐gated GFET‐based PUF architecture. To clarify, consider a GFET whose initial Dirac point is located at V cnp = V 1. After the graphene channel is exposed to air for a period of time, adsorbed ambient molecules introduce p‐type doping, shifting the Dirac point to V cnp = V 2, where V 2 > V 1 [41, 42, 43]. Then, when we chemically or electrically remove such adsorbed air molecules, the Dirac point will be reconfigured back to V cnp = V 1, complying with the memory effect. To conduct a thorough investigation, we have employed various methods to introduce n‐type doping into the GFETs we fabricated, shifting the points toward 0 and investigating their memory effect under air exposure. Figure 3a–c display the schematics of the back‐gated GFET structures and their surface‐adsorption‐induced doping mechanisms under the acetone, water adsorption, and air exposure, respectively. When the GFETs are treated with acetone for 40 min of chemical gating, a significant n‐type shift of V cnp points is observed. Further, the GFETs will possess more randomized transfer characteristics after chemical gating treatment, which can be obtained from Figure S5 in the Supporting Information. After the treatment by acetone, the mean of V cnp points of 20 GFET instances will downshift to 6.3 V with a standard deviation of 2.41 V. Besides the acetone treatment, we also employed water and acetone‐water treatments to investigate the GFET memory effect (see Section 1 of the Supporting Information for details of the GFET memory effect under different treatments). Figure 3e,f report the shift in V cnp points on time dependency when the GFETs are treated by the other two methods; here, for all the memory effect studies, the GFETs are biased at V DS = 0.5 V. Concluding from Figure 3e,f, all three treatment methods will result in a similar strong n‐type shift of V cnp point within a short period, and then the air exposure will lead to a slow p‐type shift which takes a long time for the device to get its V cnp point back to original. This type of temporal shift can be attributed to the adsorption of H2O and O2 molecules as hole donors on the graphene surface. The chemical treatment methods for removing adsorbed molecules, leading to a strong n‐type shift of the V cnp point may involve the desorption of H2O and O2 molecules due to high temperatures, and the attraction between H2O molecules and deionized water drops via hydrogen bonding. This observation has shown that one can chemically tune the position of the point of a certain GFET at will, thereby altering its frequency response and, consequently, creating more CRPs to make it a stronger PUF without increasing device size.

FIGURE 3.

FIGURE 3

Memory effect of GFET and its AC characteristics. (a−c) Schematic illustrations of the GFET under different doping conditions (acetone (a), water (b), and air exposure (c)) induced by surface treatments. (d−f) Memory effect of Dirac point (V cnp) of GFETs. GFET is firstly treated by (d) acetone, (e) water, and (f) acetone and water to introduce an n‐type shift. Then, the GFET is air‐exposed for p‐type shift until its V cnp gets back to ∼30 V. Three representative operating states are defined from the Vcnp evolution: state 1 (V cnp ≈ 7 V), state 2 (V cnp ≈ 15 V), and state 3 (V cnp ≈ 30 V). (g) Representative transfer characteristic (IDS−VGS) and the corresponding gate‐bias points used for the three states. (h–j) Time‐domain output responses measured at the three states when the GFET is driven by a sinusoidal gate excitation (fin = 10 kHz, DC offset is 19 V, amplitude is 5 V). The AC responses exhibit predominantly amplitude modulation when VGS < Vcnp, combined frequency/amplitude/phase modulation VGS = Vcnp, and simultaneous phase and amplitude modulation when VGS > Vcnp.

We next analyze the AC characteristics of GFETs. Since the I−V characteristic of GFETs presents a “V‐shape” feature, a second harmonic will always be generated once an AC input signal oscillates around the V cnp point. To make a concise demonstration of the AC characteristics of GFET regarding the memory effect, we define 3 operating states of GFETs by 3 approximate values of V cnp points where state 1 for V cnp ≈ 6 V, state 2 for V cnp ≈ 15 V, and state 3 for V cnp ≈ 30 V, as marked out in Figure 3d. We depict in Figure 3h–j that the GFET may exhibit entirely different frequency responses when operating in states under various input signal conditions. We firstly apply f in = 10kHz, and gate voltage V GS1 = 12 V < V cnp to a GFET operating at the state where V cnp ≈ 19 V, (the blue line in Figure 3g). The corresponding frequency response is plotted in Figure 3h, where the output response is in phase with the input signal and only amplitude modulation is observed. Next, when V GS2 ≈ V cnp = 19 V (the pink line in Figure 3g) it presents not only the amplitude modulation but also acts as frequency and phase modulator, and the frequency of the output signal is twice that of the input signal, functioning as a harmonic transponder (or frequency doubler), as can be seen in Figure 3i. Finally, the phase and amplitude modulations can be obtained as shown in Figure 3j when V GS3 = 23 V > V cnp (the purple line in Figure 3g). Such unique AC characteristics can make GFET‐based harmonic transponders free of unnecessary RF components compared with traditional ones, resulting in a more compact, lightweight system with lower fabrication cost. Since the Dirac point of a GFET is tailorable, as we discussed previously, its AC characteristics can also be readily altered to have amplitude, phase, and frequency modulations. By exploiting the electrical characteristics of GFETs, we can construct a wireless RF PUF with an ideal randomness source, yielding outstanding PUF metrics. It should be noted that the present GFET PUF operates as a low‐frequency nonlinear modulation and authentication platform. The experimentally demonstrated challenge frequencies are 10, 30, and 60 kHz, well below the regime where cutoff‐frequency‐limited RF gain would dominate the response. In this work, the doping/treatment‐dependent memory states are used to create reconfigurable PUF states. Their V cnp shifts reposition the GFET along its nonlinear transfer characteristic, thereby modifying the AC/time‐domain waveform used for PUF key generation.

Experimental validations of GFET‐based PUF. The proposed back‐gated GFET PUF architecture is based on integrating GFET with other RF components to construct a GFET‐based harmonic modulator system serving as an identifier (ID) tag. The detailed schematic of the GFET‐based RF modulator can be found in Section 2 of the Supporting Information. Therefore, the challenges and responses are wirelessly communicated between the reader and the ID tag. First, the GFET PUF system receives input challenges via its receiving coil antenna, which are then amplified and fed into the PUF core. Next, the GFET PUF core converts these input challenges into unique output responses, as depicted in Figure 1d, generating modulated responses. Finally, the converted output responses will be transmitted by the transmitting coil antenna to an external reader used for access control or authentication. The reader will then discretize and digitize the analog responses in the time domain to binary bitstrings, creating binary PUF keys, and compare them with the authorized keys stored in local memories or the cloud (details of the formation of CRPs can be found in Section 3 of Supporting Information). As a reconfigurable PUF, our proposed PUF system can produce different output responses to the same input challenge across different states, thereby significantly enhancing the encryption quality it provides. We can also tune the frequency, phase, and amplitude of the input RF signals to address different challenges in our PUF, generate more CRPs to strengthen it, and increase its difficulty to decrypt. An order‐of‐magnitude estimation of the wireless RF power required to drive the GFET tag is provided in Section 10 of the Supporting Information, showing that the intrinsic GFET gate‐drive power is at the microwatt level, while the total reader‐launched power depends on the near‐field coupling efficiency and the power‐supply configuration.

Different types of challenges with various V GSs, frequencies, and states exploited are applied to the PUF system to evaluate our PUF performance. Here, the amplitude of challenge signals is fixed at 5 V, and all GFETs are biased under 0.5 V. It is worth noting that to precisely investigate the PUF performance of the GFETs themselves, the challenges and responses are directly applied to and measured from the GFETs by a probe station. By applying all nine challenges to 20 GFET PUF instances operating in three states, we obtained 540 output responses in the time domain (all responses can be found in Section 4 of the Supporting Information), which we used for the PUF performance evaluations. Our evaluations include randomness, uniqueness, reliability, and embedded AI classification using cosine‐NN matching of the PUF signal. Figure 4a–c present the complete generated binary bitmaps of the proposed back‐gated GFET PUF when the GFET operates at state 1, 2 and 3, respectively. It can be observed that the “0” and “1”s are highly randomly distributed, and the randomness of a PUF can be manifested from the entropy of bitmaps of CRPs, which calculates the distributions of “0” s and “1” s of the bitmap and takes the form of [44−46]:

Ex,y=−[px,ylog2px,y+(1−px,y)log2(1−px,y)] (1)

where the uniformity px (py ) is defined as the distribution of “0” s and “1” s for the bit‐strings (key‐strings), as can be seen in the inset of Figure 1d. Ideally, the number of “0” s and “1” s of the bit map should occur with equal probability, leading to p x,y = 0.5 and E x,y = 1. Figure 5 reports the results of reconfigurable entropy evaluations of the proposed GFET PUF under variant V GSs (V GS = 4, 5, 6 V), frequencies (f = 10, 30, 60 kHz), and states (state 1, 2, and 3). In Figure 5a–c, E x remains consistently high while the applied configuration parameters change including V GS = 4, 5, 6 V (Figure 5a), f = 10, 30, 60 kHz (Figure 5b), and three different operating states (state 1−3). Figure 5d–f are similar to Figure 5a–c, which illustrate the evaluated near‐unity distribution of E ys. These results demonstrate the excellent randomness and reconfigurability of the proposed GFET PUF system. To further demonstrate the randomness of a PUF system, the National Institute of Standards and Technology (NIST) randomness test suite will be utilized, which more rigorously determines whether a binary sequence (e.g., binary PUF keys) is truly random or pseudo‐random. We have implemented all PUF keys generated by 20 PUF instances in the NIST test suite, and the detailed results are shown in Section 5 of the Supporting Information. All PUF keys generated by our GFET PUF successfully pass the tests with desired scores, indicating that our practically realized PUF system might be truly random, such as a true random number generator.

FIGURE 4.

FIGURE 4

Reconfigurable bitmap of PUF response under three operation states. (a–c) Bitmaps of the extracted binary responses for 180 GFET PUF instances under (a) state 1, (b) state 2, and (c) state 3. In each bitmap, rows correspond to devices (Device 1–180), and columns correspond to bit indices (Bit 1–256). Black and white pixels denote logic ‘1’ and ‘0’, respectively. The absence of obvious spatial patterns across rows and columns indicates a near‐random distribution of bits for all three states, supporting high‐quality response randomness and device‐to‐device variability.

FIGURE 5.

FIGURE 5

Reconfigurable entropy evaluation of GFET PUF responses. (a–c) Bit‐level Shannon entropy E x evaluated across the generated 256‐bit responses as a function of (a) gate bias amplitude (V GS), (b) frequency, and (c) various operation states (State 1–3). (d–f) Device‐level entropy E y computed for individual devices under the same sets of conditions: (d) V GS, (e) frequency, and (f) state. In each 3D plot, the entropy values remain close to the ideal value of 1, indicating excellent entropy and robust randomness across bits and devices over varying excitation and doping states.

Furthermore, uniqueness is widely utilized as another critical parameter in assessing the quality of PUFs. Generally, the uniqueness of PUFs can be studied via inter‐device Hamming Distances (inter‐HDs), which count the number of different bits between two binary sequences. Ideally, two bitstrings of PUF keys unique to each other should have their normalized inter‐HD be 0.5, implying that half of their bitstrings are identical. The mean inter‐HD can be expressed as [11]:

HDinter¯=2Npuf(Npuf−1)∑i=1Npuf−1∑j=i+1NpufHD(Keyi,Keyj)L (2)

where N puf represents the number of PUF keys, L refers to the bitstring length, and Key i (Key j ) is the i th(j th) PUF key in the cryptographic map, which is generated from the i th(j th) PUF instance for the same challenge. In Figures 6a–c, the PUF uniqueness utilizing inter‐HDs under three different reconfiguration states (V GS, excitation frequency, and discrete operating states) is evaluated. Starting with V GS in Figure 6a, the inter‐HD histograms for V GS = 4, 5, and 6 V are all centered close to the ideal value of 0.5, with µ around 0.49−0.5. This indicates that responses from two different devices differ in roughly half of the bits, which is the expected behavior of strong uniqueness. Building on this result, Figure 6b shows that the same property is preserved when the excitation frequency varies. For f = 10, 30, and 60 kHz, the inter‐HD distributions remain near 0.5 and keep a similarly narrow spread, indicating the device‐to‐device separability will not be weakened by tuning the frequency. Figure 6c reports the inter‐HD distributions when V GS = V cnp under States 1−3. The histograms of the inter‐HD are distributed around 0.5, confirming that switching the operating state also maintains near‐ideal uniqueness while generating a new response condition. Figure 6d–f provide a complementary view through pairwise inter‐HD maps, where each pixel represents the Hamming distance between a pair of keys. Consistent with the histogram results for inter‐HD, Figure 6d shows that across different V GSs, the diagonal remains low (self‐comparison) while the off‐diagonal entries are largely around the mid‐range, reflecting strong separation among different devices. In the same way, Figure 6e demonstrates similar off‐diagonal behavior across the three frequencies (f 1, f 2, f 3), indicating that each frequency setting forms a stable key space with robust inter‐device differences. Similarly, Figure 6f shows distinct regions corresponding to States 1–3, implying that each state defines its own response ensemble while still keeping the pairwise distances close to the desired level. We observe that reconfiguration enables the PUF to operate under different settings and produce distinct response sets, while the inter‐device Hamming distance remains close to the ideal value of 0.5, confirming robust uniqueness across configurations. On the other hand, we assess the encoding capacity as a measure of the PUF's encryption capability, defined as the number of unique encryption codes the PUF can produce. In addition, we investigate the evolution of key size and encoding capacity as the sampling rate varies. For a binary coding system, the encoding capacity can be expressed as cn , where c = 2, and n = μ(1 − μ)/σ2. Here n represents the key size, μ and σ signify the mean and standard deviation of the distribution of inter‐HDs, respectively. For the verification, we calculate the key sizes and the encoding capacities when the proposed GFET PUF operates at States 1−3. The results for key sizes are n ≈ 64, 60, and 67 for states 1, 2, and 3, respectively. And the corresponding encoding capacities are 264,260,267, which are sufficiently large for most secure applications, showing the excellent encryption capabilities that our GFET PUF provides, and the detailed results for the evolution of key size and the encoding capacity as a function of sampling rate are plotted in Section 6 of the Supporting Information.

FIGURE 6.

FIGURE 6

Uniqueness evaluation of GFET PUF responses under different operating conditions. (a–c) PMFs of the inter‐HD for the proposed PUF measured under varying (a) VGS, (b) frequency, and (c) different states. The extracted mean and standard deviation are close to the ideal value of 0.5 and 0, respectively, indicating strong uniqueness across devices. (d–f) Pairwise HD maps of the generatesd keys under the same sets of conditions: (d) VGS, (e) frequency, and (f) states. The predominantly uniform off‐diagonal distributions further confirm consistent device‐to‐device separability and robustness of uniqueness against excitation and state variations.

To make a PUF system feasible for realistic implementations, high reliability in consistent, repeatable measurements is also highly demanded. Reliability can be quantified by intra‐HD, which are similar to inter‐HDs but calculate the bit differences between two bitstrings generated by the same PUF instance operating in different conditions. The mean intra‐HDs can be written as [18]:

HDintra¯=1Ncon∑m=1NconHD(Keyi,Keyi,m)l (3)

where N con signifies the total number of measurements under different conditions, Key i is the PUF key taken as a reference, Key i,m is the m th measured PUF key at another operating condition, and l is the length of the PUF keys. A PUF with perfect reliability should have its intra‐HD close to zero, as observed in Equation (3), implying that the device can operate stably under varied conditions. In our experiments, one measurement is chosen as the reference trace, and each of the nine additional repeated measurements obtained under the same applied challenge is compared against it to generate one intra‐HD value per repetition. The corresponding stacked transient responses for state 1 at 30 and 60 kHz are provided in Section 7 of the Supporting Information, together with the intra‐HD distributions. As shown by the intra‐HD statistics (µ = 0.135, σ = 0.052 at 30 kHz and µ = 0.071, σ = 0.039 at 60 kHz) in Figure S13, the PUF responses exhibit strong repeatability, with the intra‐HD mean and spread approaching the ideal value of zero, particularly at higher excitation frequency. Moreover, the stability criterion for the proposed memory‐enabled and reconfigurable GFET PUF is state‐wise repeatability rather than absolute retention of a fixed V cnp. As discussed above, the temporal evolution of V cnp under chemical treatment and air exposure is used to assess different operating states instead of being treated solely as a device‐failure mechanism. Therefore, once an operating state is enrolled, stable operation is evaluated by whether the transient response can be reproducibly extracted and authenticated within that state. The low intra‐HD values under repeated reads support such state‐wise repeatability.

2.2. Embedding Learning and Cosine Similarity for PUF Authentication

To enable practical GFET PUF authentication, it is not sufficient to demonstrate only uniqueness or reliability metrics; the system must also provide a scalable decision rule that reliably maps an incoming, noisy time‐domain waveform to the correct enrolled key [12, 47]. In our measurements, GFET PUF responses can exhibit state‐dependent waveform transformations (e.g., bias/frequency settings) as well as unavoidable run‐to‐run perturbations introduced by the measurement chain, including timing jitter, amplitude drift, and background noise [48, 49]. Here, we incorporate a deep metric‐ and embedding‐based classification framework to identify and authenticate measured GFET PUF signals (Figure 7a). In this method, we employ a one‐dimensional convolutional neural network (1D CNN) encoder f(·) to map each time‐domain waveform into a compact embedding space, where responses from the same device cluster are close while different devices are separated. To improve robustness against measurement noise and small waveform distortions, we apply data augmentation to generate multiple views of each signal during representation learning. After pretraining, the encoder weights θ are fixed; during inference, a query waveform is converted into a query embedding and matched to the enrolled references using a Cosine‐NN rule to output the predicted key ID [50, 51]. For the evaluation, each operating state is treated as an independent authentication setting, and we enroll 100 keys per state for classification and matching. The detailed workflow of the presented deep metric learning‐based AI‐classification method is depicted in Figure S14 in Section 8 of the Supporting Information. The resulting probability maps for States 1–3 are shown in Figure 7c–e. In all three states, the probability mass is strongly concentrated along the main diagonal, indicating high confidence in correctly matching with limited off‐diagonal leakage. Importantly, this diagonal dominance is maintained across the different states, suggesting that the learned embeddings remain robust to state‐induced response variations while preserving the separability required for reliable authentication. We also evaluate robustness in terms of classification accuracy (ACC) against temporal misalignment by introducing a controlled sample shift to the query waveform (Figure 7b). The proposed state‐wise classification maintains consistently high accuracy across the tested shifts, whereas the direct Cosine‐NN baseline degrades rapidly as shifts increase. This contrast highlights that the learned embedding captures more shift‐tolerant, global features of the GFET PUF response, improving practical usability when small timing offsets are unavoidable during repeated measurements. We additionally performed a post‐measurement additive‐noise stress test using the CNN‐assisted authentication pipeline (Figure 7f) to further assess robustness against measurement noise. The 1D CNN encoder was retrained with SNR‐aware contrastive augmentation using noisy positive views with SNR randomly sampled from 20–40 dB. During the evaluation, Gaussian noise was injected only into the query waveforms from 0 to 30 dB, while clean enrolled references were matched to the noisy query embeddings using the same Cosine‐NN rule. As shown in Figure 7f, the mean ACC remains 98.2% at 10 dB and exceeds 99% from 15–30 dB across the three states, confirming robust authentication under substantial additive noise. The reduced ACC at 0–5 dB marks the practical low‐SNR operating boundary of the compact embedding‐based pipeline. Together with the temporal‐shift results, this analysis shows that the learned representation improves tolerance to both timing misalignment and additive noise. Beyond timing‐shift and additive‐noise robustness, the framework also benefits from the challenge‐dependent nature of the GFET RF PUF response. As the authenticated signal is generated by the physical device under a specific memory/doping state, gate bias, excitation frequency, and nonlinear RF transduction condition, simple replay or spoofing attempts would need to reproduce the correct analog waveform for the requested challenge in the learned embedding space. This challenge‐dependent response provides a practical anti‐replay basis for the proposed framework and motivates comparison with broader hardware‐security and IoT‐authentication approaches.

FIGURE 7.

FIGURE 7

AI‐assisted authentication of GFET PUF signals using a pretrained encoder and cosine‐NN matching. (a) Overview of the proposed identification pipeline. Here, raw PUF time‐domain signals are augmented to form multiple views for self‐supervised pretraining of a 1D CNN encoder f(·) with a projection head. After pretraining, the encoder weights (θ) are fixed and used to extract embeddings from query waveforms, which are then classified by Cosine‐NN matching to return the matched device ID. (b) ACC versus temporal shift applied to the query waveform. The encoder‐based embeddings maintain high ACC across all three states, while direct Cosine‐NN matching on non‐embedded signals degrades rapidly with increasing shift, highlighting the improved shift‐robustness enabled by the learned representation. (c–e) Pairwise similarity (probability) maps of the generated keys/embeddings for state 1–3, where a strong diagonal indicates correct one‐to‐one matching between enrolled references and query samples. (f) Additive‐noise robustness of the CNN‐assisted authentication scheme after SNR‐aware contrastive training. Gaussian noise was injected into query waveforms from 0 to 30 dB, while clean enrolled templates were used for Cosine‐NN matching in the learned embedding space. The mean ACC remains 98.2% at 10 dB and exceeds 99% from 15–30 dB.

To place the proposed memory‐enabled GFET RF PUF in the broader landscape of hardware security and IoT authentication, we provide two complementary comparisons in Section 9 of Supporting Information. First, Table SIII compares the proposed device with some representative state‐of‐the‐art PUF systems. Recent GFET memory [16], ferroelectric field‐effect transistor (FeFET) [52], spectral optical [53], vertical NAND (V‐NAND) [17], and carbon nanotube (CNT) PUFs [54] can individually provide memory‐state reconfigurability, large response spaces, NIST‐passed randomness, or learning‐assisted verification. However, these capabilities are typically realized through electrical memory states, charge trapping, flash program/erase operation, or optical spectral fingerprints. In contrast, the proposed GFET RF PUF directly couples the GFET memory/doping state to nonlinear RF harmonic transduction, so that memory state, gate bias, and excitation frequency jointly reconfigure the measured RF waveform for AI‐assisted authentication. Second, to address IoT application scenarios, Table SIV compares the proposed RF PUF with representative conventional cryptographic and emerging low‐power hardware approaches, including Advanced Encryption Standard (AES)/ChaCha20‐based encryption, NIST lightweight cryptography, ECC‐based authentication, and recent 2D neuromorphic devices [55, 56, 57, 58, 59]. Conventional cryptographic schemes are mature for data encryption and mutual authentication, but they typically rely on stored or shared digital secrets and protocol‐level key management. By contrast, the GFET RF PUF serves as a complementary hardware root of trust, directly transducing intrinsic GFET variations into reconfigurable RF waveform fingerprints that enable wireless authentication and PUF‐derived key generation before standard cryptographic algorithms are used for protected data transmission.

3. Conclusion

In summary, we have proposed a strong RF PUF enabled by a GFET‐based harmonic transponder. Leveraging the exceptional electrical and mechanical properties of GFETs, the proposed PUF exhibits outstanding randomness, uniqueness, and reliability. In addition, the GFET memory enables high reconfigurability, further enhancing the PUF's strength by enabling flexible key updates and an expanded challenge–response space. Since both the challenges and responses are radio‐frequency signals, the proposed PUF is naturally compatible with IoT scenarios and can be readily integrated into wireless authentication systems. To support practical identification and authentication, we incorporate an AI‐assisted signal classification pipeline that learns device‐specific embeddings from measured waveforms and enables robust key matching across different operating states. Overall, this work opens a new direction for investigating analog PUFs in a fully wireless manner, with potential impact on RFID platforms, secure near‐field communications, and IoT authentication.

4. Methods

4.1. Fabrication of GFETs

The graphene layer is grown initially on copper foil by chemical vapor deposition. First, a layer of poly (methyl methacrylate) (PMMA) is coated on graphene/Cu foil and then baked on a hot plate for 10 mins at 60°C. This PMMA layer works as a support layer, preventing graphene from curling up and breaking up during Cu etching. FeCl3 is used as an etchant to etch Cu foil underneath graphene. After the Cu foil is completely etched, the PMMA/graphene film is rinsed in deionized water to remove the residue of FeCl3. The PMMA/graphene film is then scooped up by our target substrates and baked on a hot plate for 30 mins at 50°C. Lastly, to remove PMMA, the graphene/substrate is soaked in MICROPOSIT Remover 1165 for over 6 h, and the graphene transfer is completed. The p‐doped Si substrates have a 90‐nm thermal oxide layer as the dielectric between doped Si and graphene. Maskless photolithography is conducted by the MLA150 Maskless Aligner to pattern graphene and electrodes. First, a layer of resist S1813 is coated on a graphene/Si substrate. After the exposure of the designed pattern and development of resist, an unwanted area of graphene is exposed to the environment and is later etched by oxygen plasma. By soaking the graphene/Si substrates in MICROPOSIT Remover 1165, the resist is removed, and only patterned graphene remains on the Si substrate. Both source and drain electrodes are made of Ti/Au (5/50 nm). Maskless photolithography is implemented to define the shape of electrodes. After the exposure of the designed pattern and development of resist, the designated electrode area is exposed to the environment. Therefore, the metal film can be selectively deposited at the defined electrode area. The metal film deposited not in the electrode area is removed along with the resist during the lift‐off process. Both Ti and Au film are deposited by e‐beam evaporation at 1A/s deposition rate.

Author Contributions

Yichong Ren and Minye Yang designed the circuit structure. Yichong Ren, Minye Yang, Mohan De Silva, C. Suzanne Miller, Ralu Divan, and Chia‐Heng Sun performed the experiments. Yichong Ren, Zong‐Ru Lee, Mohan De Silva, and Saad Alshahrani drafted the manuscript. Yichong Ren and Zong‐Ru Lee performed the AI‐classification experiments. Pai‐Yen Chen conceived the idea. Jimmy Ching‐Ming Chen, Mark Ming‐Cheng Cheng, Zhixian Zhou, and Pai‐Yen Chen supervised the experiments and revised the manuscript.

Conflicts of Interest

The authors declare no competing interests.

Supporting Information Statement

The online version containing supporting information is available.

Supporting information

Supporting File: smtd70889‐sup‐0001‐SuppMat.docx.

SMTD-10-e70889-s001.docx (9.1MB, docx)

Acknowledgements

Pai‐Yen Chen would like to thank NSF ECCS‐2229659 Grant for supporting this work. M.D.S. and Z.Z. acknowledge the support of NSF under Grant ECCS‐2210861. The use of the Center for Nanoscale Materials, a U.S. Department of Energy Office of Science User Facility, was supported by the U.S. DOE, Office of Basic Energy Sciences, under Contract No. DE‐AC02‐06CH11357.

Data Availability Statement

The data that support the findings of this study are available from the corresponding author upon reasonable request.

References

  • 1. Babaei A. and Schiele G., “Physical Unclonable Functions in the Internet of Things: State of the Art and Open Challenges,” Sensors 19 (2019): 3208, 10.3390/s19143208. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 2. Vaezi M., Azari A., Khosravirad S. R., et al., “Cellular, Wide‐Area, and Non‐Terrestrial IoT: A Survey on 5G Advances and the Road Toward 6G,” IEEE Communications Surveys & Tutorials 24 (2022): 1117–1174, 10.1109/COMST.2022.3151028. [DOI] [Google Scholar]
  • 3. Bosworth B. T., Atakhodjaev I. A., Kossey M. R., et al., “Unclonable Photonic Keys Hardened Against Machine Learning Attacks,” APL Photonics 5 (2020): 010803, 10.1063/1.5100178. [DOI] [Google Scholar]
  • 4. Guembe B., Azeta A., Misra S., Osamor V. C., Fernandez‐Sanz L., and Pospelova V., “The Emerging Threat of Ai‐Driven Cyber Attacks: A Review,” Applied Artificial Intelligence 36 (2022): 2037254, 10.1080/08839514.2022.2037254. [DOI] [Google Scholar]
  • 5. Ren K., Lou W., Kim K., and Deng R., “A Novel Privacy Preserving Authentication and Access Control Scheme for Pervasive Computing Environments,” IEEE Transactions on Vehicular Technology 55 (2006): 1373–1384, 10.1109/TVT.2006.877704. [DOI] [Google Scholar]
  • 6. Li Y., Wang H., and Sun K., “Personal Information in Passwords and Its Security Implications,” IEEE Transactions on Information Forensics and Security 12 (2017): 2320–2333, 10.1109/TIFS.2017.2705627. [DOI] [Google Scholar]
  • 7. Hitaj B., Gasti P., Ateniese G., and Perez‐Cruz F., “PassGAN: A Deep Learning Approach for Password Guessing,” in Applied Cryptography and Network Security, ed. R. H. Deng, V. Gauthier‐Umaña, M. Ochoa and M. Yung (Springer International Publishing, 2019), 217–237, 10.1007/978-3-030-21568-2_11. [DOI] [Google Scholar]
  • 8. Ye J., Jin M., Gong G., Shen R., and Lu H., “PassTCN‐PassTCN‐PPLL: A Password Guessing Model Based on Probability Label Learning and Temporal Convolutional Neural Network,” Sensors 22 (2022): 6484, 10.3390/s22176484. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 9. Pappu R., Recht B., Taylor J., and Gershenfeld N., “Physical One‐Way Functions,” Science 297 (2002): 2026–2030, 10.1126/science.1074376. [DOI] [PubMed] [Google Scholar]
  • 10. Gao Y., Al‐Sarawi S. F., and Abbott D., “Physical Unclonable Functions,” Nature Electronics 3 (2020): 81–91, 10.1038/s41928-020-0372-5. [DOI] [Google Scholar]
  • 11. Herder C., Yu M.‐D., Koushanfar F., and Devadas S., “Physical Unclonable Functions and Applications: A Tutorial,” Proceedings of the IEEE 102 (2014): 1126–1141, 10.1109/JPROC.2014.2320516. [DOI] [Google Scholar]
  • 12. Chatterjee B., Das D., Maity S., and Sen S., “RF‐PUF: Enhancing IoT Security Through Authentication of Wireless Nodes Using In‐Situ Machine Learning,” IEEE Internet of Things Journal 6 (2019): 388–398, 10.1109/JIOT.2018.2849324. [DOI] [Google Scholar]
  • 13. Lyu B., Ouyang Y., Gao D., Wan X., and Bao X., “Multilevel and Flexible Physical Unclonable Functions for High‐End Leather Products or Packaging,” Small 21 (2025): 2408574, 10.1002/smll.202408574. [DOI] [PubMed] [Google Scholar]
  • 14. Gao Y., Ma H., Abbott D., and Al‐Sarawi S. F., “Exploiting PUF Unreliability for Secure Wireless Sensing,” IEEE Transactions on Circuits and Systems I: Regular Papers 64 (2017): 2532–2543, 10.1109/TCSI.2017.2695228. [DOI] [Google Scholar]
  • 15. Cao Y., Zhang L., Chang C. H., and Chen S., “A Low‐Power Hybrid RO PUF With Improved Thermal Stability for Lightweight Applications,” IEEE Transactions on Computer‐Aided Design of Integrated Circuits and Systems 34 (2015): 1143–1147, 10.1109/TCAD.2015.2424955. [DOI] [Google Scholar]
  • 16. Dodda A., Subbulakshmi Radhakrishnan S., Schranghamer T. F., Buzzell D., Sengupta P., and Das S., “Graphene‐Based Physically Unclonable Functions That Are Reconfigurable and Resilient to Machine Learning Attacks,” Nature Electronics 4 (2021): 364–374, 10.1038/s41928-021-00569-x. [DOI] [Google Scholar]
  • 17. Park S. H., Koo R. H., Yang Y., Im J., Ko J., and Lee J. H., “Concealable Physical Unclonable Functions Using Vertical NAND Flash Memory,” Nature Communications 16 (2025): 5155, 10.1038/s41467-025-60415-y. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 18. Yang M., Zhu L., Zhong Q., El‐Ganainy R., and Chen P. Y., “Spectral Sensitivity Near Exceptional Points as a Resource for Hardware Encryption,” Nature Communications 14 (2023): 1145, 10.1038/s41467-023-36508-x. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 19. Holcomb D. E., Burleson W. P., and Fu K., “Power‐Up SRAM State as an Identifying Fingerprint and Source of True Random Numbers,” IEEE Transactions on Computers 58 (2009): 1198–1210, 10.1109/TC.2008.212. [DOI] [Google Scholar]
  • 20. Baek S., Yu G. H., Kim J., Ngo C. T., Eshraghian J. K., and Hong J. P., “A Reconfigurable SRAM Based CMOS PUF With Challenge to Response Pairs,” IEEE Access 9 (2021): 79947–79960, 10.1109/ACCESS.2021.3084621. [DOI] [Google Scholar]
  • 21. Sahoo D. P., Mukhopadhyay D., Chakraborty R. S., and Nguyen P. H., “A Multiplexer‐Based Arbiter PUF Composition With Enhanced Reliability and Security,” IEEE Transactions on Computers 67 (2018): 403–417, 10.1109/TC.2017.2749226. [DOI] [Google Scholar]
  • 22. S. Hemavathy, and Bhaaskaran V. S. K., “Arbiter PUF—A Review of Design, Composition, and Security Aspects,” IEEE Access 11 (2023): 33979–34004, 10.1109/ACCESS.2023.3264016. [DOI] [Google Scholar]
  • 23. Jiang H., Belkin D., Savel'ev S. E., et al., “A Novel True Random Number Generator Based on a Stochastic Diffusive Memristor,” Nature Communications 8 (2017): 882, 10.1038/s41467-017-00869-x. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 24. Kim H., Lee K., Zan G., et al., “Chiroptical Synaptic Perovskite Memristor as Reconfigurable Physical Unclonable Functions,” ACS Nano 19 (2025): 691–703, 10.1021/acsnano.4c11753. [DOI] [PubMed] [Google Scholar]
  • 25. Yin C. E. and Qu G., “Improving PUF Security With Regression‐Based Distiller,” in Proceedings of the 50th Annual Design Automation Conference, (ACM: 2013), 1–6, 10.1145/2463209.2488960. [DOI] [Google Scholar]
  • 26. Rührmair U., Sehnke F., Sölter J., Dror G., Devadas S., and Schmidhuber J., “Modeling Attacks on Physical Unclonable Functions,” in Proceedings of the 17th ACM Conference on Computer and Communications Security, (ACM: 2010), 237–249, 10.1145/1866307.1866335. [DOI] [Google Scholar]
  • 27. Ruhrmair U., Solter J., Sehnke F., et al., “PUF Modeling Attacks on Simulated and Silicon Data,” IEEE Transactions on Information Forensics and Security 8 (2013): 1876–1891, 10.1109/TIFS.2013.2279798. [DOI] [Google Scholar]
  • 28. Wisiol N., Thapaliya B., Mursi K. T., Seifert J. P., and Zhuang Y., “Neural Network Modeling Attacks on Arbiter‐PUF‐Based Designs,” IEEE Transactions on Information Forensics and Security 17 (2022): 2719–2731, 10.1109/TIFS.2022.3189533. [DOI] [Google Scholar]
  • 29. Novoselov K. S., Geim A. K., Morozov S. V., et al., “Electric Field Effect in Atomically Thin Carbon Films,” Science 306 (2004): 666–669, 10.1126/science.1102896. [DOI] [PubMed] [Google Scholar]
  • 30. Guinea F., Peres N. M. R., Novoselov K. S., and Geim A. K., “The Electronic Properties of Graphene,” Review of Modern Physics 81 (2009): 109–162, 10.1103/RevModPhys.81.109. [DOI] [Google Scholar]
  • 31. Xiang H., Chien Y. C., Shi Y., and Ang K. W., “Application of 2D Materials in Hardware Security for Internet‐of‐Things: Progress and Perspective,” Small Structures 3 (2022): 2200060, 10.1002/sstr.202200060. [DOI] [Google Scholar]
  • 32. Zhong D., Liu J., Xiao M., et al., “Twin Physically Unclonable Functions Based on Aligned Carbon Nanotube Arrays,” Nature Electronics 5 (2022): 424–432, 10.1038/s41928-022-00787-x. [DOI] [Google Scholar]
  • 33. Ren Y., Sun C. H., De Silva M., et al., “Reconfigurable Electromagnetically Unclonable Functions Based on Graphene Radio‐Frequency Modulators,” ACS Nano 20 (2026): 421–431, 10.1021/acsnano.5c13119. [DOI] [PubMed] [Google Scholar]
  • 34. Na H., Kim J. S., Kim G., Choi J., Park K. R., and Kim S., “Stochastic Yet Precise: Memristor Crossbar Arrays Enabling Robust in‐Memory Computing, Hardware Security, and Generative Adversarial Network,” Advanced Functional Materials 36 (2025): 23780, 10.1002/adfm.202523780. [DOI] [Google Scholar]
  • 35. Lim S., Seo H., Park T., et al., “Complex Cryptographic and User‐Centric Physically Unclonable Functions Enabled by Strain‐Sensitive Nanocrystals via Selective Ligand Exchange,” Advanced Functional Materials 36 (2025): 14488, 10.1002/adfm.202514488. [DOI] [Google Scholar]
  • 36. Van Geest E. P., Shakouri K., Fu W., et al., “Contactless Spin Switch Sensing by Chemo‐Electric Gating of Graphene,” Advanced Materials 32 (2020): 1903575, 10.1002/adma.201903575. [DOI] [PubMed] [Google Scholar]
  • 37. Xia J., Chen F., Li J., and Tao N., “Measurement of the Quantum Capacitance of Graphene,” Nature Nanotechnology 4 (2009): 505–509, 10.1038/nnano.2009.177. [DOI] [PubMed] [Google Scholar]
  • 38. Romero H. E., Shen N., Joshi P., et al., “n‐Type Behavior of Graphene Supported on Si/SiO2 Substrates,” ACS Nano 2 (2008): 2037–2044, 10.1021/nn800354m. [DOI] [PubMed] [Google Scholar]
  • 39. Norhakim N., Gunasilan T., Kesuma Z. R., Hawari H. F., and Burhanudin Z. A., “Elucidating the Time‐Dependent Charge Neutrality Point Modulation of Polymer‐Coated Graphene Field‐Effect Transistors in an Ambient Environment,” Nanotechnology 35 (2024): 505201, 10.1088/1361-6528/ad7b42. [DOI] [PubMed] [Google Scholar]
  • 40. Markeev P. A., Najafidehaghani E., Gan Z., et al., “Energy‐Level Alignment at Interfaces Between Transition‐Metal Dichalcogenide Monolayers and Metal Electrodes Studied With Kelvin Probe Force Microscopy,” The Journal of Physical Chemistry C 125 (2021): 13551–13559, 10.1021/acs.jpcc.1c01612. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 41. Schedin F., Geim A. K., Morozov S. V., et al., “Detection of Individual Gas Molecules Adsorbed on Graphene,” Nature Materials 6 (2007): 652–655, 10.1038/nmat1967. [DOI] [PubMed] [Google Scholar]
  • 42. Wang H., Wu Y., Cong C., Shang J., and Yu T., “Hysteresis of Electronic Transport in Graphene Transistors,” ACS Nano 4 (2010): 7221–7228, 10.1021/nn101950n. [DOI] [PubMed] [Google Scholar]
  • 43. Chan J., Venugopal A., Pirkle A., et al., “Reducing Extrinsic Performance‐Limiting Factors in Graphene Grown by Chemical Vapor Deposition,” ACS Nano 6 (2012): 3224–3229, 10.1021/nn300107f. [DOI] [PubMed] [Google Scholar]
  • 44. Yang M., Ye Z., Pan H., Farhat M., Cetin A. E., and Chen P. Y., “Electromagnetically Unclonable Functions Generated by Non‐Hermitian Absorber‐Emitter,” Science Advances 9 (2023): adg7481, 10.1126/sciadv.adg7481. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 45. Ren Y., Yang M., Pan H., Farhat M., and Chen P. Y., “PT Symmetry‐Enabled Physically Unclonable Functions for Anti‐Counterfeiting RF Tags,” IEEE Transactions on Antennas and Propagation 72 (2024): 5129–5140, 10.1109/TAP.2024.3396693. [DOI] [Google Scholar]
  • 46. Ren Y., Sun C. H., Liu C. H., Wu C. T. M., and Chen P. Y., “Wireless Anti‐Counterfeiting Labels Using RF Oscillators With Graphene Quantum Capacitors,” IEEE Journal of Radio Frequency Identification 9 (2025): 38–45, 10.1109/JRFID.2025.3529343. [DOI] [Google Scholar]
  • 47. Suh G. E. and Devadas S., “Physical Unclonable Functions for Device Authentication and Secret Key Generation,” in Proceedings of the 44th Annual Conference on Design Automation—DAC ′07, (ACM Press: 2007), 9, 10.1145/1278480.1278484. [DOI] [Google Scholar]
  • 48. Waibel A., Hanazawa T., Hinton G., Shikano K., and Lang K. J., “Phoneme Recognition Using Time‐Delay Neural Networks,” IEEE Transactions on Acoustics, Speech, and Signal Processing 37 (1989): 328–339, 10.1109/29.21701. [DOI] [Google Scholar]
  • 49. Wang Z., Yan W., and Oates T., “Time Series Classification From Scratch With Deep Neural Networks: A Strong Baseline,” in International Joint Conference on Neural Networks (IJCNN), (IEEE: 2017), 1578–1585, 10.1109/IJCNN.2017.7966039. [DOI] [Google Scholar]
  • 50. Wang H., Wang Y., and Zhou Z., “CosFace: Large Margin Cosine Loss for Deep Face Recognition,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition, (IEEE: 2018), 5265–5274, 10.1109/CVPR.2018.00552. [DOI] [Google Scholar]
  • 51. Deng J., Guo J., Xue N., and ArcFace Z. S., “Additive Angular Margin Loss for Deep Face Recognition,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (IEEE: 2019), 4685–4694, 10.1109/CVPR.2019.00482. [DOI] [PubMed] [Google Scholar]
  • 52. Li T., Guo X., Müller F., et al., “Demonstration of High‐Reconfigurability and Low‐Power Strong Physical Unclonable Function Empowered by FeFET Cycle‐to‐Cycle Variation and Charge‐Domain Computing,” Nature Communications 16 (2025): 189, 10.1038/s41467-024-55380-x. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 53. Sandomirskii M., Petrova E., Kustov P., et al., “Spectral Physical Unclonable Functions: Downscaling Randomness With Multi‐Resonant Hybrid Particles,” Nature Communications 16 (2025): 5097, 10.1038/s41467-025-60121-9. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 54. Liu Y., Pei J., Wen Y., et al., “Chip‐Scale Reconfigurable Carbon Nanotube Physical Unclonable Functions,” Nature Communications 16 (2025): 8705, 10.1038/s41467-025-63739-x. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 55. Silva C., Cunha V. A., Barraca J. P., and Aguiar R. L., “Analysis of the Cryptographic Algorithms in IoT Communications,” Information Systems Frontiers 26 (2024): 1243–1260, 10.1007/s10796-023-10383-9. [DOI] [Google Scholar]
  • 56. Turan M. S., McKay K. A., Kang J., Kelsey J., and Chang D., “Ascon‐Based Lightweight Cryptography Standards for Constrained Devices: Authenticated Encryption, Hash, and Extendable Output Functions,” (NIST Special Publication, 2025), 10.6028/NIST.SP.800-232. [DOI] [Google Scholar]
  • 57. Khalique A., Siddiqui F., Ahad M. A., and Hussain I., “Lightweight Authentication for IoT Devices (LAID) in Sustainable Smart Cities,” Scientific Reports 15 (2025): 25410, 10.1038/s41598-025-10181-0. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 58. Tan C., Lin Z., Wu H., and Wang Z., “Analog Implementation of Sigmoidal Neuron by 2‐D Semiconductive Resistor,” IEEE Transactions on Electron Devices 72 (2025): 919–923, 10.1109/TED.2024.3513935. [DOI] [Google Scholar]
  • 59. Lin Z., Wu H., Tan C., Hu G., and Wang Z., “Dual‐Wavelength Synaptic Simulator ReS2/Ta2NiSe5 for Multi‐Timescale Learning in Neuromorphic Computing,” Small 05586, 10.1002/smll.202505586. [DOI] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Supporting File: smtd70889‐sup‐0001‐SuppMat.docx.

SMTD-10-e70889-s001.docx (9.1MB, docx)

Data Availability Statement

The data that support the findings of this study are available from the corresponding author upon reasonable request.


Articles from Small Methods are provided here courtesy of Wiley

RESOURCES