cracknuts-squirrel 0.0.1b0__tar.gz

cracknuts_squirrel-0.0.1b0/LICENSE

@@ -0,0 +1,175 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.

cracknuts_squirrel-0.0.1b0/PKG-INFO

@@ -0,0 +1,63 @@
+Metadata-Version: 2.4
+Name: cracknuts-squirrel
+Version: 0.0.1b0
+Summary: A Python library for side-channel analysis
+Author-email: Dingzb <dingzibiao@gmail.com>
+Maintainer-email: Dingzb <dingzibiao@gmail.com>
+License-Expression: Apache-2.0
+Project-URL: homepage, https://cracknuts.io
+Requires-Python: >=3.12
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: numpy~=1.26.4
+Requires-Dist: pycryptodome~=3.23.0
+Requires-Dist: zarr~=2.18.2
+Requires-Dist: packaging~=24.1
+Requires-Dist: numba~=0.61.2
+Requires-Dist: dask~=2025.5.1
+Requires-Dist: matplotlib~=3.10.3
+Requires-Dist: h5py==3.14.0
+Provides-Extra: jupyter
+Requires-Dist: jupyter~=1.1.1; extra == "jupyter"
+Dynamic: license-file
+
+# CrackNuts Squirrel
+
+## Installation
+
+```shell
+pip install cracknuts-squirrel
+```
+
+## For Developers
+
+In the virtual environment, run the following command to install the dependencies:
+
+```bash
+pip install -e .
+pip install -r requirements-dev.txt
+```
+
+## 文件功能说明
+
+### lstm_aes_hd.py
+
+该文件实现了基于LSTM的AES汉明距离（Hamming Distance）模型，用于侧信道分析攻击。主要功能包括：
+
+- 定义了AESHDModel神经网络模型，结合了卷积层、双向LSTM层和注意力机制
+- 实现了自定义数据集类（TraceDataset和InMemoryTraceDataset），用于加载和处理侧信道轨迹数据
+- 包含模型训练逻辑，使用PyTorch框架进行训练
+- 实现了Guessing Entropy（猜测熵）计算函数，用于评估攻击效果
+- 提供了保存模型回调函数，在训练过程中定期保存模型并进行评估
+
+### test_lstm_model.py
+
+该文件用于测试训练好的LSTM模型，执行AES密钥恢复攻击。主要功能包括：
+
+- 加载训练好的模型文件（.pt格式）
+- 从zarr文件中加载测试数据（轨迹和明文）
+- 执行攻击过程，使用模型预测结果进行密钥猜测
+- 计算并显示猜测熵，评估攻击效果
+- 显示最可能的密钥候选值，并与实际密钥进行比较
+
+这两个文件共同构成了一个完整的AES侧信道分析工具链，从模型训练到攻击测试。

cracknuts_squirrel-0.0.1b0/README.md

@@ -0,0 +1,40 @@
+# CrackNuts Squirrel
+
+## Installation
+
+```shell
+pip install cracknuts-squirrel
+```
+
+## For Developers
+
+In the virtual environment, run the following command to install the dependencies:
+
+```bash
+pip install -e .
+pip install -r requirements-dev.txt
+```
+
+## 文件功能说明
+
+### lstm_aes_hd.py
+
+该文件实现了基于LSTM的AES汉明距离（Hamming Distance）模型，用于侧信道分析攻击。主要功能包括：
+
+- 定义了AESHDModel神经网络模型，结合了卷积层、双向LSTM层和注意力机制
+- 实现了自定义数据集类（TraceDataset和InMemoryTraceDataset），用于加载和处理侧信道轨迹数据
+- 包含模型训练逻辑，使用PyTorch框架进行训练
+- 实现了Guessing Entropy（猜测熵）计算函数，用于评估攻击效果
+- 提供了保存模型回调函数，在训练过程中定期保存模型并进行评估
+
+### test_lstm_model.py
+
+该文件用于测试训练好的LSTM模型，执行AES密钥恢复攻击。主要功能包括：
+
+- 加载训练好的模型文件（.pt格式）
+- 从zarr文件中加载测试数据（轨迹和明文）
+- 执行攻击过程，使用模型预测结果进行密钥猜测
+- 计算并显示猜测熵，评估攻击效果
+- 显示最可能的密钥候选值，并与实际密钥进行比较
+
+这两个文件共同构成了一个完整的AES侧信道分析工具链，从模型训练到攻击测试。

cracknuts_squirrel-0.0.1b0/pyproject.toml

@@ -0,0 +1,53 @@
+[build-system]
+requires = ["setuptools >= 61.0"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "cracknuts-squirrel"
+description = "A Python library for side-channel analysis"
+dynamic = ["version"]
+requires-python = ">=3.12"
+readme = "README.md"
+license = "Apache-2.0"
+authors = [{ name = "Dingzb", email = "dingzibiao@gmail.com" }]
+maintainers = [{ name = "Dingzb", email = "dingzibiao@gmail.com" }]
+dependencies = [
+    "numpy~=1.26.4",
+    "pycryptodome~=3.23.0",
+    "zarr~=2.18.2",
+    "packaging~=24.1",
+    "numba~=0.61.2",
+    "dask~=2025.5.1",
+    "matplotlib~=3.10.3",
+    "h5py==3.14.0",
+]
+
+[project.optional-dependencies]
+jupyter = [
+    "jupyter~=1.1.1",
+]
+
+[project.urls]
+homepage = "https://cracknuts.io"
+
+[tool.setuptools.dynamic]
+version = { attr = "cracknuts_squirrel.__version__" }
+
+[tool.ruff]
+line-length = 120
+target-version = "py312"
+exclude = ["demo", "tests", "docs"]
+
+[tool.ruff.lint]
+extend-select = [
+    "F",
+    "E",
+    "W",
+    "UP",
+]
+
+[tool.typos.files]
+extend-exclude = [
+    "demo",
+    "tests"
+]

cracknuts_squirrel-0.0.1b0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

cracknuts_squirrel-0.0.1b0/src/cracknuts_squirrel/__init__.py

@@ -0,0 +1 @@
+__version__ = "0.0.1-beta.0"

cracknuts_squirrel-0.0.1b0/src/cracknuts_squirrel/correlation_analysis.py

@@ -0,0 +1,126 @@
+# Copyright 2024 CrackNuts. All rights reserved.
+
+import numpy as np
+import zarr
+from cracknuts_squirrel.preprocessing_basic import PPBasic
+import matplotlib.pyplot as plt
+
+# Hamming weights of the values 0-255 used for model values
+WEIGHTS = np.array([0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4,
+                    1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,
+                    1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,
+                    2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
+                    1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,
+                    2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
+                    2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
+                    3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
+                    1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,
+                    2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
+                    2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
+                    3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
+                    2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
+                    3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
+                    3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
+                    4,5,5,6,5,6,6,7,5,6,6,7,6,7,7,8],
+                    np.float32)
+
+class CorrelationAnalysis(PPBasic):
+    """
+    通用相关系数分析类，继承自预处理基类PPBasic
+    """
+    def __init__(self, input_path=None, output_path=None, sample_range=(0, None), **kwargs):
+        super().__init__(input_path=input_path, output_path=output_path, **kwargs)
+        self.sample_range = sample_range
+
+    def calculate_correlation(self, traces, plaintext_bytes):
+        """
+        计算轨迹(traces)与明文字节(plaintext_bytes)之间的相关系数
+        
+        参数:
+        traces: numpy数组，形状为(n_traces, n_samples)，包含功率轨迹数据
+        plaintext_bytes: numpy数组，形状为(n_traces, n_bytes)，包含明文字节数据
+        
+        返回:
+        correlations: numpy数组，形状为(n_bytes, n_samples)，包含每个字节位置与每个样本点的相关系数
+        """
+        # 确保输入是numpy数组
+        traces = np.asarray(traces)
+        plaintext_bytes = np.asarray(plaintext_bytes)
+        
+        # 检查输入维度是否匹配
+        if traces.shape[0] != plaintext_bytes.shape[0]:
+            raise ValueError("轨迹数量与明文数量不匹配")
+        
+        n_traces, n_samples = traces.shape
+        n_bytes = plaintext_bytes.shape[1]
+        
+        # 初始化相关系数结果数组
+        correlations = np.zeros((n_bytes, n_samples))
+        
+        # 对每个字节位置计算相关系数
+        for byte_idx in range(n_bytes):
+            # 提取当前字节数据
+            byte_data = plaintext_bytes[:, byte_idx]
+            
+            # 对每个样本点计算相关系数
+            for sample_idx in range(n_samples):
+                # 提取当前样本点的轨迹数据
+                trace_data = traces[:, sample_idx]
+                
+                # 计算皮尔逊相关系数
+                correlations[byte_idx, sample_idx] = np.corrcoef(byte_data, trace_data)[0, 1]
+        
+        return correlations
+
+    def perform_analysis(self):
+        """
+        执行相关系数分析（使用明文字节的汉明重量作为模型值）
+        """
+        store = zarr.DirectoryStore(self.output_path)
+        root = zarr.group(store=store, overwrite=True)
+    
+        # 获取处理后的轨迹数据
+        processed_traces = self.t[:, self.sample_range[0]:self.sample_range[1]]
+        
+        # 获取明文字节并计算汉明重量
+        plaintext = self.plaintext[:self.sel_num_traces, :16]
+        hw_matrix = WEIGHTS[plaintext]
+        
+        # 计算相关系数矩阵
+        correlation_matrix = self.calculate_correlation(
+            traces=processed_traces,
+            plaintext_bytes=hw_matrix
+        )
+    
+        # 存储结果
+        root.create_dataset(
+            '/0/0/correlation',
+            data=correlation_matrix,
+            chunks=(16, 1000)
+        )
+    
+        # 添加元数据
+        root.attrs.update({
+            "analysis_metadata": {
+                "sample_range": self.sample_range,
+                "trace_count": self.sel_num_traces,
+                "model_type": "hamming_weight"
+            }
+        })
+        return correlation_matrix
+
+if __name__ == "__main__":
+    # 示例用法
+    analyzer = CorrelationAnalysis(input_path='E:\\codes\\Acquisition\\dataset\\20250722204543.zarr')
+    analyzer.auto_out_filename()
+    # analyzer.set_range(sample_range=(500, 10000))
+    
+    result = analyzer.perform_analysis()
+
+    print(result.shape)
+    for i in range(16):
+        plt.plot(result[i,:])
+    
+    plt.show()
+    
+    print(f"分析完成，最大相关系数：{np.nanmax(np.abs(result)):.4f}")

cracknuts_squirrel-0.0.1b0/src/cracknuts_squirrel/correlation_analysis2.py

@@ -0,0 +1,201 @@
+# Copyright 2024 CrackNuts. All rights reserved.
+
+from dataclasses import dataclass
+from typing import Optional
+
+import numpy as np
+import zarr
+
+from cracknuts_squirrel.preprocessing_basic import PPBasic
+
+@dataclass
+class AnalysisParams:
+    data_type: str = "plaintext"
+    data_width: int = 1
+    start: int = 0
+    count: Optional[int] = None
+
+class CorrelationAnalysis(PPBasic):
+    # Hamming weights of the values 0-255 used for model values
+    _HW_TABLE = np.array([
+        0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4,
+        1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
+        1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
+        2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
+        1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
+        2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
+        2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
+        3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
+        1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
+        2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
+        2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
+        3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
+        2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
+        3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
+        3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
+        4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8
+    ], np.uint8)
+
+    """
+    通用相关系数分析类，继承自预处理基类PPBasic
+    """
+    def __init__(self, input_path=None, output_path=None, sample_range=(0, None), **kwargs):
+        super().__init__(input_path=input_path, output_path=output_path, **kwargs)
+        self.sample_range = sample_range
+
+    @classmethod
+    def hamming_weight(cls, data: np.ndarray, bit_width: int) -> np.ndarray:
+
+        if data.ndim != 2:
+            raise ValueError(f"输入必须是二维数组，当前形状为 {data.shape}")
+
+        if data.dtype != np.uint8:
+            raise ValueError("输入数组必须是 uint8 类型")
+
+        if bit_width == 8:
+            return cls._HW_TABLE[data]
+
+        n, m = data.shape
+
+        if bit_width > 8:
+            if bit_width not in (16, 32, 64):
+                raise ValueError("合并仅支持 16, 32, 64 位")
+            num_bytes = bit_width // 8
+            if m % num_bytes != 0:
+                raise ValueError(f"列数 {m} 不能被 {num_bytes} 整除")
+
+            reshaped = data.reshape(n, m // num_bytes, num_bytes)
+            tmp_hw = cls._HW_TABLE[reshaped]
+            
+            return tmp_hw.astype(f"uint{bit_width}").sum(axis=2)
+
+        else:  # bit_length < 8
+            if bit_width not in (1, 2, 4):
+                raise ValueError("拆分仅支持 1, 2, 4 位")
+            if 8 % bit_width != 0:
+                raise ValueError(f"8 不能被 {bit_width} 整除")
+            splits_per_byte = 8 // bit_width
+            new_m = m * splits_per_byte
+            result = np.zeros((n, new_m), dtype=np.uint8)
+
+            for i in range(splits_per_byte):
+                shift = 8 - bit_width * (i + 1)
+                mask = (1 << bit_width) - 1
+                result[:, i::splits_per_byte] = (data >> shift) & mask
+
+            return cls._HW_TABLE[result]
+
+    @staticmethod
+    def calculate_correlation(traces, data_bytes):
+        """
+        计算轨迹(traces)与明文字节(plaintext_bytes)之间的相关系数
+        
+        参数:
+        traces: numpy数组，形状为(n_traces, n_samples)，包含功率轨迹数据
+        data_bytes: numpy数组，形状为(n_traces, n_bytes)，包含明文字节数据
+        
+        返回:
+        correlations: numpy数组，形状为(n_bytes, n_samples)，包含每个字节位置与每个样本点的相关系数
+        """
+        # 确保输入是numpy数组
+        traces = np.asarray(traces)
+        data_bytes = np.asarray(data_bytes)
+        
+        # 检查输入维度是否匹配
+        if traces.shape[0] != data_bytes.shape[0]:
+            raise ValueError("轨迹数量与明文数量不匹配")
+        
+        n_traces, n_samples = traces.shape
+        n_bytes = data_bytes.shape[1]
+        
+        # 初始化相关系数结果数组
+        correlations = np.zeros((n_bytes, n_samples))
+        
+        # 对每个字节位置计算相关系数
+        for byte_idx in range(n_bytes):
+            # 提取当前字节数据
+            byte_data = data_bytes[:, byte_idx]
+            
+            # 对每个样本点计算相关系数
+            for sample_idx in range(n_samples):
+                # 提取当前样本点的轨迹数据
+                trace_data = traces[:, sample_idx]
+
+                if np.std(byte_data) == 0:
+                    correlations[byte_idx, sample_idx] = 0  # 或者 np.nan
+                else:
+                    correlations[byte_idx, sample_idx] = np.corrcoef(byte_data, trace_data)[0, 1]
+
+        return correlations
+
+    def perform_analysis(self, *analyzer_params: AnalysisParams, persist: bool=False) -> np.ndarray:
+        correlation_matrix_array = []
+        for analyzer_param in analyzer_params:
+            correlation_matrix_array.append(self.single_perform_analysis(**vars(analyzer_param)))
+
+        correlation_matrix = np.vstack(correlation_matrix_array)
+
+        if persist:
+            store = zarr.DirectoryStore(self.output_path)
+            root = zarr.group(store=store, overwrite=True)
+            # 存储结果
+            root.create_dataset(
+                '/0/0/correlation',
+                data=correlation_matrix,
+                chunks=(16, 1000)
+            )
+
+            # 添加元数据
+            root.attrs.update({
+                "analysis_metadata": {
+                    "sample_range": self.sample_range,
+                    "trace_count": self.sel_num_traces,
+                    "model_type": "hamming_weight"
+                }
+            })
+
+        return correlation_matrix
+
+    def single_perform_analysis(self, data_type="plaintext", data_width=1, start: int = 0, count: int = None):
+        """
+        执行相关系数分析（使用明文字节的汉明重量作为模型值）
+        """
+        # 获取处理后的轨迹数据
+        processed_traces = self.t[:, self.sample_range[0]:self.sample_range[1]]
+
+        if data_type == "plaintext":
+            # 获取明文字节并计算汉明重量
+            if count is None:
+                plaintext = self.plaintext[:self.sel_num_traces, start:]
+            else:
+                plaintext = self.plaintext[:self.sel_num_traces, start:start+count]
+            hw_matrix = self.hamming_weight(plaintext, data_width * 8)
+        elif data_type == "ciphertext":
+            if count is None:
+                ciphertext = self.ciphertext[:self.sel_num_traces, start:]
+            else:
+                ciphertext = self.ciphertext[:self.sel_num_traces, start:start+count]
+            hw_matrix = self.hamming_weight(ciphertext, data_width * 8)
+        elif data_type == "key":
+            if count is None:
+                key = self.key[:self.sel_num_traces, start:]
+            else:
+                key = self.key[:self.sel_num_traces, start:start+count]
+            hw_matrix = self.hamming_weight(key, data_width * 8)
+        elif data_type == "extended":
+            if count is None:
+                extended = self.extended[:self.sel_num_traces, start:]
+            else:
+                extended = self.extended[:self.sel_num_traces, start:start+count]
+            hw_matrix = self.hamming_weight(extended, data_width * 8)
+        else:
+            print(f"data_type error: [{data_type}].")
+            return
+        
+        # 计算相关系数矩阵
+        correlation_matrix = self.calculate_correlation(
+            traces=processed_traces,
+            data_bytes=hw_matrix
+        )
+
+        return correlation_matrix