This paper examines the application of the Verkle tree—an efficient data structure that leverages commitments and a novel proof technique in cryptographic solutions.Unlike traditional Merkle trees,the Verkle tree sig...This paper examines the application of the Verkle tree—an efficient data structure that leverages commitments and a novel proof technique in cryptographic solutions.Unlike traditional Merkle trees,the Verkle tree significantly reduces signature size by utilizing polynomial and vector commitments.Compact proofs also accelerate the verification process,reducing computational overhead,which makes Verkle trees particularly useful.The study proposes a new approach based on a non-positional polynomial notation(NPN)employing the Chinese Remainder Theorem(CRT).CRT enables efficient data representation and verification by decomposing data into smaller,indepen-dent components,simplifying computations,reducing overhead,and enhancing scalability.This technique facilitates parallel data processing,which is especially advantageous in cryptographic applications such as commitment and proof construction in Verkle trees,as well as in systems with constrained computational resources.Theoretical foundations of the approach,its advantages,and practical implementation aspects are explored,including resistance to potential attacks,application domains,and a comparative analysis with existing methods based on well-known parameters and characteristics.An analysis of potential attacks and vulnerabilities,including greatest common divisor(GCD)attacks,approximate multiple attacks(LLL lattice-based),brute-force search for irreducible polynomials,and the estimation of their total number,indicates that no vulnerabilities have been identified in the proposed method thus far.Furthermore,the study demonstrates that integrating CRT with Verkle trees ensures high scalability,making this approach promising for blockchain systems and other distributed systems requiring compact and efficient proofs.展开更多
针对数控机床能量源多、能量消耗动态变化复杂的特点,提出了一种基于业务流程模型和符号(Business process model and notation,BPMN)的数控机床多源动态能耗建模方法。依据数控机床不同子系统的功率特性,将其划分为时变能耗单元和非时...针对数控机床能量源多、能量消耗动态变化复杂的特点,提出了一种基于业务流程模型和符号(Business process model and notation,BPMN)的数控机床多源动态能耗建模方法。依据数控机床不同子系统的功率特性,将其划分为时变能耗单元和非时变能耗单元,分析了其工作状态及耦合关系对数控机床能耗的影响;基于BPMN2.0规范,构建了能耗单元工作状态BPMN流程模型和BPMN耦合模型,提出了能耗单元工作状态能耗数据及耦合关系时序数据与BPMN模型的数据集成方法,构建了数控机床能耗多源动态特性模型。以某数控铣床加工过程为例验证了所述模型及方法的有效性。展开更多
BPMN(Business Process Modeling Notation)作为一个在系统开发早期阶段获取业务过程模型的标准,指导系统的设计和开发,其模型的正确性是影响软件开发质量的关键。鉴于BPMN模型的形式化可以验证模型的正确性,提出了一种利用扩展Petri网...BPMN(Business Process Modeling Notation)作为一个在系统开发早期阶段获取业务过程模型的标准,指导系统的设计和开发,其模型的正确性是影响软件开发质量的关键。鉴于BPMN模型的形式化可以验证模型的正确性,提出了一种利用扩展Petri网模型,应用模型驱动技术实现BPMN模型形式化自动执行的方法。该方法通过细化Petri网模型中的Transition和Place元素以及增加Organization Identifier和Group Identifier容器,使其不但能够描述BPMN模型中的动态行为,而且还能描述BPMN模型中的动态行为协作和静态组织结构。从元模型结构、语法和图标记方面详细分析了扩展的Petri网模型元素,利用模型驱动开发技术设计BPMN模型元素至扩展的Petri网模型元素的转换规则,并在Eclipse平台上使用ATL模型转换语言执行映射,实现形式化的自动执行。最后在此基础上应用Travel Agency系统演示了模型形式化插件BPMN2ExtendPetrinets的执行结果。展开更多
基金funded by the Ministry of Science and Higher Education of Kazakhstan and carried out within the framework of the project AP23488112“Development and study of a quantum-resistant digital signature scheme based on a Verkle tree”at the Institute of Information and Computational Technologies.
文摘This paper examines the application of the Verkle tree—an efficient data structure that leverages commitments and a novel proof technique in cryptographic solutions.Unlike traditional Merkle trees,the Verkle tree significantly reduces signature size by utilizing polynomial and vector commitments.Compact proofs also accelerate the verification process,reducing computational overhead,which makes Verkle trees particularly useful.The study proposes a new approach based on a non-positional polynomial notation(NPN)employing the Chinese Remainder Theorem(CRT).CRT enables efficient data representation and verification by decomposing data into smaller,indepen-dent components,simplifying computations,reducing overhead,and enhancing scalability.This technique facilitates parallel data processing,which is especially advantageous in cryptographic applications such as commitment and proof construction in Verkle trees,as well as in systems with constrained computational resources.Theoretical foundations of the approach,its advantages,and practical implementation aspects are explored,including resistance to potential attacks,application domains,and a comparative analysis with existing methods based on well-known parameters and characteristics.An analysis of potential attacks and vulnerabilities,including greatest common divisor(GCD)attacks,approximate multiple attacks(LLL lattice-based),brute-force search for irreducible polynomials,and the estimation of their total number,indicates that no vulnerabilities have been identified in the proposed method thus far.Furthermore,the study demonstrates that integrating CRT with Verkle trees ensures high scalability,making this approach promising for blockchain systems and other distributed systems requiring compact and efficient proofs.
文摘针对数控机床能量源多、能量消耗动态变化复杂的特点,提出了一种基于业务流程模型和符号(Business process model and notation,BPMN)的数控机床多源动态能耗建模方法。依据数控机床不同子系统的功率特性,将其划分为时变能耗单元和非时变能耗单元,分析了其工作状态及耦合关系对数控机床能耗的影响;基于BPMN2.0规范,构建了能耗单元工作状态BPMN流程模型和BPMN耦合模型,提出了能耗单元工作状态能耗数据及耦合关系时序数据与BPMN模型的数据集成方法,构建了数控机床能耗多源动态特性模型。以某数控铣床加工过程为例验证了所述模型及方法的有效性。
