云南高校图书馆联盟文献共享服务平台- EXPONENTIATION

检索规则说明：AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：范例一： (K=图书馆学 OR K=情报学) AND A=范并思　　　　范例二：J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual

全部期刊核心期刊 EI来源期刊 SCI来源期刊 CA来源期刊 CSCD来源期刊 CSSCI来源期刊

CompactChain:an efficient stateless chain for UTXO-model blockchain: 《Frontiers of Computer Science》2024年第2期167-179,共13页B Swaroopa REDDY T Uday Kiran REDDY; In this work,we propose a stateless blockchain called CompactChain,which compacts the entire state of the UTXO(Unspent Transaction Output)based blockchain systems into two RSA accumulators.The first accumulator is cal...; 关键词：stateless blockchain RSA Accumulator STXO commitment TXO commitment UTXO Non-interactive Proof of Exponentiation(NI-PoE) Transactions per second(TPS)

Clustering Collision Power Attack on RSA-CRT被引量：1: 《Computer Systems Science & Engineering》2021年第2期417-434,共18页Wunan Wan Jun Chen Jinyue Xia Jinquan Zhang Shibin Zhang Hao Chen; supported by the National Key R&D Program of China(No.2017YFB0802300);the Key Research and Development Project of Sichuan Province(No.2020YFG0307,No.2018TJPT0012);the Key Research and Development Project of Chengdu(No.2019-YF05-02028-GX).; In this paper,we propose two new attack algorithms on RSA implementations with CRT(Chinese remainder theorem).To improve the attack efficiency considerably,a clustering collision power attack on RSA with CRT is introd...; 关键词：Collision attack power analysis attack chosen-message attack module exponentiation RSA-CRT

Correlated Extra Reductions Defeat Fixed Window Exponentiation: 《Journal of Computer and Communications》2019年第10期169-178,共10页Xiaohan Meng; The security of modular power algorithm is a very important research topic, which is the core operation of public key cryptography algorithm. Since the first timing attack was public in 1996, the attacker can exploit ...; 关键词：Side-Channel Attack MONTGOMERY Modular Multiplication EXTRA Reduction Leakage

Practical pulse engineering： Gradient ascent without matrix exponentiation被引量：2: 《Frontiers of physics》2018年第3期3-8,共6页Gaurav Bhole Jonathan A. Jones; Since 2005, there has been a huge growth in the use of engineered control pulses to perform desired quantum operations in systems such as nuclear magnetic resonance quantum information processors. These approaches, wh...; 关键词：quantum information coherent control pulse sequences in nuclear magnetic resonance

Measure distorted arrival rate risks and their rewards: 《Probability, Uncertainty and Quantitative Risk》2017年第1期171-191,共21页Dilip B.Madan; Risks embedded in asset price dynamics are taken to be accumulations of surprise jumps.A Markov pure jump model is formulated on making variance gamma parameters deterministic functions of the price level.Estimation i...; 关键词：Variance Gamma Hunt process Markov chain approximation Matrix exponentiation Momentum function Measure distortion

Scholz’s First Conjecture: A Brief Demonstration: 《Applied Mathematics》2016年第1期70-76,共7页José M. Sautto Agustín Santiago Carlos N. Bouza Veró nica Campos; This paper presents a brief demonstration of Schulz’s first conjecture, which sets the upper and lower limits on the length of the shortest chain of addition. Two methods of the upper limit are demonstrated;the secon...; 关键词：Addition Chain EXPONENTIATION Short Chain Scholz’s Conjecture Binary Method

An Optimized Cross Correlation Power Attack of Message Blinding Exponentiation Algorithms被引量：1: 《China Communications》2015年第6期22-32,共11页WAN Wunan YANG Wei CHEN Jun; supported in part by National Natural Science Foundation of China Project(Grant No.60873216); Scientific and Technological Research Priority Projects of Sichuan Province(Grant No. 2012GZ0017); The message blinding method is the most efficient and secure countermeasure against first-order differential power analysis(DPA).Although cross correlation attacks(CCAs) were given for defeating message blinding metho...; 关键词：side channel attack correlationpower analysis cross correlation attacks module exponentiation.

Scholz’s Third Conjecture: A Demonstration for Star Addition Chains: 《Applied Mathematics》2013年第10期1-2,共2页José Maclovio Sautto Vallejo Agustín Santiago Moreno Carlos N. Bouza Herrera Verónica Campos Guzmán; This paper presents a brief demonstration of Scholz’s third conjecture [1] for n numbers such that their minimum chain addition is star type [2]. The demonstration is based on the proposal of an algorithm that takes ...; 关键词：ADDITION CHAIN EXPONENTIATION Short CHAIN Scholz’s CONJECTURE

Public-Key Cryptosystems with Secret Encryptor and Digital Signature: 《International Journal of Communications, Network and System Sciences》2013年第1期1-6,共6页Boris Verkhovsky; This paper describes and compares a variety of algorithms for secure transmission of information via open communication channels based on the discrete logarithm problem that do not require search for a generator (prim...; 关键词：Digital Signature Discrete LOGARITHM El Gamal Algorithm Generator Modular EXPONENTIATION Public Key CRYPTOSYSTEM Secure Communication SENDER Identification

Polynomial Time Algorithm for the Two-Side Exponentiation Problem about Ergodic Matrices over Finite Field: 《Wuhan University Journal of Natural Sciences》2012年第3期233-237,共5页GU Chunsheng JING Zhengjun YU Zhiming; Supported by the National Natural Science Foundation of China (70671096);Jiangsu Teachers University of Technology (KYY08004,KYQ09002); By using the minimal polynomial of ergodic matrix and the property of polynomial over finite field,we present a polynomial time algorithm for the two-side exponentiation problem about ergodic matrices over finite fie...; 关键词：ergodic matrix characteristic polynomial finite field public key cryptography

EXPONENTIATION