FLUSH+RELOAD attack is recently proposed as a new type of Cache timing attacks.There are three essential factors in this attack,which are monitored instructions.threshold and waiting interval.However,existing literatu...FLUSH+RELOAD attack is recently proposed as a new type of Cache timing attacks.There are three essential factors in this attack,which are monitored instructions.threshold and waiting interval.However,existing literature seldom exploit how and why they could affect the system.This paper aims to study the impacts of these three parameters,and the method of how to choose optimal values.The complete rules for choosing the monitored instructions based on necessary and sufficient condition are proposed.How to select the optimal threshold based on Bayesian binary signal detection principal is also proposed.Meanwhile,the time sequence model of monitoring is constructed and the calculation of the optimal waiting interval is specified.Extensive experiments are conducted on RSA implemented with binary square-and-multiply algorithm.The results show that the average success rate of full RSA key recovery is89.67%.展开更多
In this paper,we consider two-queue polling model with a Timer and a Randomly-Timed Gated(RTG) mechanism.At queue Q1,we employ a Timer T(1):whenever the server polls queue Q1 and finds it empty,it activates a Timer.If...In this paper,we consider two-queue polling model with a Timer and a Randomly-Timed Gated(RTG) mechanism.At queue Q1,we employ a Timer T(1):whenever the server polls queue Q1 and finds it empty,it activates a Timer.If a customer arrives before the Timer expires,a busy period starts in accordance with exhaustive service discipline.However,if the Timer is shorter than the interarrival time to queue Q1,the server does not wait any more and switches back to queue Q2.At queue Q2,we operate a RTG mechanism T(2),that is,whenever the server reenters queue Q2,an exponential time T(2) is activated.If the server empties the queue before T(2),it immediately leaves for queue Q1.Otherwise,the server completes all the work accumulated up to time T(2) and leaves.Under the assumption of Poisson arrivals,general service and switchover time distributions,we obtain probability generating function(PGF) of the queue lengths at polling instant and mean cycle length and Laplace Stieltjes transform(LST) of the workload.展开更多
基金supported by National Natural Science Foundation of China (No.61472357,No.61309021,No.61272491, No.61173191)the Major State Basic Research Development Program(973 Plan) of China under the grant 2013CB338004
文摘FLUSH+RELOAD attack is recently proposed as a new type of Cache timing attacks.There are three essential factors in this attack,which are monitored instructions.threshold and waiting interval.However,existing literature seldom exploit how and why they could affect the system.This paper aims to study the impacts of these three parameters,and the method of how to choose optimal values.The complete rules for choosing the monitored instructions based on necessary and sufficient condition are proposed.How to select the optimal threshold based on Bayesian binary signal detection principal is also proposed.Meanwhile,the time sequence model of monitoring is constructed and the calculation of the optimal waiting interval is specified.Extensive experiments are conducted on RSA implemented with binary square-and-multiply algorithm.The results show that the average success rate of full RSA key recovery is89.67%.
基金the National Natural Science Foundation of China(No.10726063)Leading Academic Discipline Program,211 Project for Minzu University of China(the 3rd phaze,No.021211030312)
文摘In this paper,we consider two-queue polling model with a Timer and a Randomly-Timed Gated(RTG) mechanism.At queue Q1,we employ a Timer T(1):whenever the server polls queue Q1 and finds it empty,it activates a Timer.If a customer arrives before the Timer expires,a busy period starts in accordance with exhaustive service discipline.However,if the Timer is shorter than the interarrival time to queue Q1,the server does not wait any more and switches back to queue Q2.At queue Q2,we operate a RTG mechanism T(2),that is,whenever the server reenters queue Q2,an exponential time T(2) is activated.If the server empties the queue before T(2),it immediately leaves for queue Q1.Otherwise,the server completes all the work accumulated up to time T(2) and leaves.Under the assumption of Poisson arrivals,general service and switchover time distributions,we obtain probability generating function(PGF) of the queue lengths at polling instant and mean cycle length and Laplace Stieltjes transform(LST) of the workload.
