In this work, we present an efficient method for computing in the generalized Jacobian of special singular curves, nodal curves. The efficiency of the operation is due to the representation of an element in the Jacobian group by a single polynomial. In addition, we propose a probabilistic public key algorithm as an application of nodal curves.

翻译：在这项工作中,我们提出了一种高效的计算方法,在通用的雅各格特单曲线、节点曲线中进行计算,操作的效率是由于在雅各克组中用单一的多义表示一个元素。此外,我们建议采用概率公用钥匙算法作为节点曲线的应用。