Abstract

In this paper, we present the new signature scheme based on elliptic curve (EC) and factoring (FAC) problems using chaotic maps (CMs). The newly developed scheme requires only minimal and low-complexity computations, which makes it very efficient. We compare our scheme with the other schemes with respect to signature generation cost, signature size, and verification cost and show that our scheme is superior to the other schemes. To the best of our knowledge, this is the first time a signature scheme based on EC and FAC problems using CMs has been proposed.

中文翻译：

---

基于椭圆曲线和混沌映射分解问题的新签名方案

摘要

在本文中，我们提出了基于椭圆曲线（EC）和使用混沌映射（CM）的因式分解（FAC）问题的新签名方案。新开发的方案仅需要最少且低复杂度的计算，这使得它非常高效。我们将我们的方案与其他方案在签名生成成本、签名大小和验证成本方面进行比较，并表明我们的方案优于其他方案。据我们所知，这是第一次提出基于使用 CM 的 EC 和 FAC 问题的签名方案。