Performance Analysis of the Postcomputation- Based Generic-Point Parallel Scalar Multiplication Method
|
|
- Andra Strickland
- 5 years ago
- Views:
Transcription
1 P a g e 3 Vol. 1 Issue 11 (Ver. 1.) October 1 Global Journal of Computer Scence and Technology Performance Analyss of the Postcomputaton- Based Generc-Pont Parallel Scalar Multplcaton Method Tur F. Al-Soman GJCST Classfcaton (FOR) F.3.1, F.1. Abstract- A Postcomputaton-based generc-pont parallel scalar multplcaton method has recently been proposed for hgh-performance end servers that employ parallel ellptc curve cryptoprocessors. The sequental precomputaton overheads, n the postcomputaton-based method, are replaced wth parallelzable postcomputatons. Ths paper analyzes the performance of the postcomputaton-based method wth 18 m 56 usng a number of parallel ellptc curve cryptoprocessors. The results show that the best performance s acheved when eght cryptoprocessors are used. Keywords- Ellptc Curve Cryptosystems, Parallel Scalar Multplcaton, Precomputatons, Postcomputatons, Generc-Pont Scalar Multplcaton. E I. INTRODUCTION llptc curve cryptosystems (ECCs), whch were ntally proposed by Nel Kobltz and Vctor Mller n 1985 [1], are seen as serous alternates to the RSA system but wth a much shorter word length. An ECC wth a ey sze of bts has been shown to offer equal securty to an RSA system wth a ey sze of 1 Kbts []. To date, no sgnfcant breathroughs have been made n determnng the weanesses of ECCs, whch are based on a dscrete logarthm problem over ponts on an ellptc curve. The fact that the problem appears so dffcult to crac means that ey szes can be consderably, and possbly even exponentally, reduced [3]. Ths advantage of ECCs has ganed recognton recently, and has resulted n ther ncorporaton n many standards such as IEEE, ANSI, NIST, SEC and WTLS.Scalar multplcaton s the basc operaton for ECCs. Scalar multplcaton of a group of ponts on an ellptc curve s analogous to the exponentaton of a multplcate group of ntegers modulo a fxed nteger m. The scalar multplcaton operaton, denoted as, where s an nteger and s a pont on the ellptc curve, represents the addton of copes of pont. Scalar multplcaton s then computed by a seres of pont doublng and pont addton operatons of the pont P that depends on the bt sequence that represents the scalar multpler. Several scalar multplcaton methods have been proposed [4]. However, for hgh-performance end servers, the current sequental scalar multplcaton methods are too slow to meet the demands of ncreasng number of customers. About-Tur F. Al-Soman s wth the Department of Computer Engneerng, Faculty of Engneerng, Al-Baha Unersty, Al-Baha, Saud Araba.Emal: tfsoman@bu.edu.sa Identfyng effcent scalar multplcaton methods for such servers has thus become crucal. Scalar multplcaton methods that can be parallelzed are often used for hghspeed mplementatons. Precomputatons [4-6] have also been appled to speed up scalar multplcaton, but requre sequental steps that cannot be parallelzed, and are prmarly advantageous bascally when the ellptc curve pont s fxed. However, durng secure communcaton sessons that use publc eys the ellptc curve pont changes, as t depends on the publc ey of the communcatng entty, that s, t s sesson dependant. Ths s also the case when dgtal sgnatures are used. Hence, the computaton of scalar multplcatons s generally performed wth a generc ellptc curve pont. Because the ellptc curve pont s lely to dffer n each sesson, the overheads resultng from the necessary precomputatons must be consdered when estmatng the total computatonal tme requred. Postcomputatons have recently been proposed [7] as an alternate method to speedup scalar multplcatons. In [7], the precomputaton overheads are replaced by postcomputatons that can be parallelzed. Ths paper shows that the concurrent precomputaton of several ponts outperforms the method proposed n [7] wth the same number of ponts and parallel processors. The remander of the paper s organzed as follows. Secton ntroduces the basc ECC. Secton 3 descrbes the postcomputaton-based generc-pont parallel scalar multplcaton method [7]. Secton 4 presents a performance analyss of the postcomputaton-based method. Secton 5 concludes. II. ELLIPTIC CURVE CRYPTO PRELIMINARIES Ellptc curve cryptosystems (ECCs) [4] have attracted much research attenton and have been ncluded n many standards. ECCs are evolvng as an attracte alternate to other publc-ey schemes such as RSA by offerng a smaller ey sze and a hgher strength per bt. Extense research has been conducted on the underlyng math, securty strength and effcent mplementatons of ECCs. Of the varous felds that can underle ellptc curves, prme felds GF(p) and bnary felds GF( m ) have proved to be best suted to cryptographc applcatons. An ellptc curve E over the fnte feld GF(p) defned by the parameters a, b GF(p) wth p > 3 conssts of the set of ponts P = (x, y), where x, y GF(p), that satsfes the equaton y x 3 ax where a, b GF(p) and 4a 3 + 7b mod p, together wth the addte dentty of the group pont O nown as the b (1)
2 Global Journal of Computer Scence and Technology Vol. 1 Issue 11 (Ver. 1.) October 1 P a g e 33 pont at nfnty [4]. The number of ponts #E on an ellptc curve over a fnte feld GF(q) s defned by Hasse s theorem [4]. The dscrete ponts on an ellptc curve form an abelan group, the group operaton of whch s nown as pont addton. Ellptc curve pont addton s defned accordng to the chord-tangent process. Pont addton over GF(p) can be descrbed as follows.let P and Q be two dstnct ponts on E defned over GF(p) wth Q P (Q s not the addte nverse of P). The addton of the ponts P and Q ges the pont R (R = P + Q), where R s the addte nverse of S and S s a thrd pont on E ntercepted by the straght lne through ponts P and Q. The addte nverse of (6) pont P = (x, y) E over GF(p) s the pont P = (x, y), whch s the mrror of pont P wth respect to the x-axs on E. When P = Q and P P, the addton of P and Q s the pont R (R = P), where R s the addte nverse of S and S s the thrd pont on E ntercepted by the straght lne tangental to the curve at pont P. Ths operaton s referred to as pont doublng. The fnte feld GF( m ) has partcular mportance n cryptography, as t leads to very effcent hardware mplementatons. Elements of the feld are represented n terms of a bass. Most mplementatons use ether a polynomal bass or a normal bass [8]. Lettng GF( m ) be a fnte feld of characterstc two, a nonsupersngular ellptc curve E over GF( m ) can be defned as the set of solutons (x, y) GF( m ) GF( m ) to the equaton y xy x 3 ax where a and b GF( m ), b, together wth the pont at nfnty. It s well nown that E forms a commutate fnte group, wth O as the group dentty, under the addton operaton nown as the tangent and chord method. Explct ratonal formulas for the addton rule nvolve several feld arthmetc operatons (addton, squarng, multplcaton and nverson) n the underlyng fnte feld. The group operatons n affne coordnate systems nvolve fnte feld nverson, whch s a very costly operaton, partcularly for prme felds. Projecte coordnate systems can be used to elmnate the need to perform nversons. Several projecte coordnate systems have been proposed n the lterature, ncludng the homogeneous, Jacoban, Chudnovsy- Jacoban, modfed Jacoban, Lopez-Dahab, Edwards and mxed coordnate systems [9][1].Several scalar multplcaton methods have been proposed n the lterature [4]. Computng P can be acheved wth a straghtforward bnary method the so-called double-and-add method based on the bnary expresson of the multpler. P can be computed usng a bnary method as follows. Let = ( m-1,, ), where m-1 s the most sgnfcant bt of, be the bnary representaton of. The multpler can be wrtten as m 1 m 1 1 (3) m Usng the Horner expanson, can be rewrtten as (( ) ) ) (4) Accordngly, ( m 1 m 1 b () P ( ( P P) P P (5) m 1 m 1 ) The algorthm for the bnary method s as follows. Algorthm 1: Bnary Method (1) Input P,. () Q O. (3) For from m 1 down to, perform a. Q Q, b. If = 1, then Q Q + P. (4) End for. (5) Output Q. The bnary scalar multplcaton method s the most straghtforward scalar multplcaton method. It nspects the bts of the scalar multpler. If the nspected bt =, then only pont doublng s performed. If, however, the nspected bt = 1, then both pont doublng and addton are performed. The bnary method requres m pont doublngs and an average of m/ pont addtons. Non-adjacent form (NAF) reduces the average number of pont addtons to m/3 [11]. Wth NAF, sgned-dgt representatons are used such that the scalar multpler s coeffcent {, ±1}. NAF has the property that no two consecute coeffcents are nonzero. It also has the property that every poste nteger has a unque NAF encodng, whch s denoted as NAF(). III. THE POSTCOMPUTATION-BASED METHOD The essental concept underlyng the method proposed n [7] s the replacement of sequental precomputatons wth parallelzable postcomputatons. Multpler n [7] s parttoned nto parttons that can be processed n parallel by processors usng the bnary method. Some of the postcomputatons are then dstrbuted on processors to be performed n parallel. The ponts that result from processng these ey parttons wth the postcomputatons are then assmlated to produce. Let, where s the most sgnfcant bt of, be the bnary representaton of multpler. Then, after parttonng nto parttons, multpler can be wrtten as Scalar multplcaton product where t P s defned as ( ( 1 ( t u v 1 P )) ( can then be computed as P ) ( v P ) ( A ey observaton s that Eq. (8) can be rewrtten as P )) (6) (7) (8)
3 P a g e 34 Vol. 1 Issue 11 (Ver. 1.) October 1 Global Journal of Computer Scence and Technology t ( )[ ( ( P P ) 1 P ) P ] v 1 v Eq. (9) mples that the requred precomputatons of Eq. (8) can be replaced by postcomputatons, whch are pont doublngs. Each partton requres pont doublngs to produce the correct partal product. To balance the number of pont operatons, we need to balance the total number of feld multplcatons, as feld multplcaton s the domnant type of operaton n ellptc curve pont operatons n projecte coordnates. Ths mples that multpler should be parttoned nto parttons of dfferent szes, as shown n Eq. (1). m u 1) u ) 1) ) (1) Accordngly, the number of bts n partton must be greater than the number of those n and fewer than the number of those n, as can be seen from Eq. (11). m ( 1) u ) 1) ) u (11) Assume that the double and add pont operatons requre and feld multplcatons, respectely. Then, let the total number of feld multplcatons n partton equal. Because partton s the only one to requre no postcomputatons, a balanced number of pont operatons can be reached by solvng Eqs. (1) and (11) together wth the followng equatons (1-14). j (9) ) M ( ) ) ( r ) ( s ) (1) ) M ( ) ) ( r) ( s) ( r) m j (13) M M M (14) ( ) ( 1) ( u 1) The computaton of n parallel wthout precomputatons can be performed effcently usng the followng algorthm. Algorthm : Postcomputaton-based Method 1. Inputs:. By paddng wth zeros f necessary, solve Eqs. (1)-(14) together, and wrte, where s a partton of length bts. 3. Intalsaton:. 4. Parallel Scalar Multplcaton: 4.1. For to do n parallel Bnary method ( (), P ) If ( ), then Output R for to (( m j j ) ) do Example: Let,, and. The szes of the ey parttons are,, and. The ey parttons are,,, and. The scalar multplcaton of these parttons s then computed n parallel accordng to the followng =451, Fnally, s computed as IV. PERFORMANCE ANALYSIS The tme complexty of the proposed method n [7] equal to ( ) pont doublngs + pont addtons and ( ) pont doublngs + pont addtons usng bnary and NAF encodng, respectely. However, the proposed method n [7] has not been analyzed when dfferent values of and are used. Table 1 shows the lengths, n number of bts, of each ey partton. Table 1 also shows that no more than 8 processors should be used wth the proposed method n [7]. Ths s clearly shown when 1 processors are used and only 8 of the processors are utlzed. Table shows the results for the method proposed n [7]. In Table, the frst two columns show the ey sze and the number of parallel processors. The thrd column shows the length of the frst ey partton. The number of pont doublngs, addtons and accumulaton addtons are shown n the followng columns. It s assumed here that the requred computaton tme for pont addton s twce that requred for pont doublng. Accordngly, columns 8 and 9 show the total number of pont doublngs and addtons for the pont doublngs for bnary and NAF encodng, respectely. The results of Table are depcted n Fgure 1 and for bnary and NAF encodng, respectely. Clearly, the results show that the best performance s acheved when eght processors are used. Increasng the number of processors, however, does not mean better performance. V. CONCLUSION Sequental scalar multplcaton methods are too slow for hgh-performance end servers because of the demand resultng from ncreasng numbers of customers. Exstng parallel methods, however, requre sequental precomputatons for each new sesson. Recently, the frst generc-pont parallel scalar multplcaton method has been proposed. In the proposed method, the precomputaton overhead s replaced by postcomputatons that can be
4 Global Journal of Computer Scence and Technology Vol. 1 Issue 11 (Ver. 1.) October 1 P a g e 35 parallelzed. In ths paper we have analyzed the performance of the postcomputaton-based method wth 18 m 56 usng a number of parallel ellptc curve cryptoprocessors. The results show that the best performance s acheved when eght cryptoprocessors are used. VI. REFERENCES 1) Kobltz, N. (1987) Ellptc curve cryptosystems, Mathematcs of Computaton, 48, 3-9. ) Rest, R., Shamr, A. and Adleman, L. (1978) A method for obtanng dgtal sgnatures and publc ey cryptosystems, Communcatons of the ACM, 1,, ) Blae, I., Serouss, G. and Smart, N. (1999) Ellptc Curves n Cryptography, Cambrdge Unersty Press, New Yor. 4) Hanerson, D., Menezes, A. J. and Vanstone, S. (4), Gude to Ellptc Curve Cryptography, Sprnger-Verlag. 5) Brcell, E. F., Gordon, D. M., McCurley, K. S. and Wlson, D. B. (1993) Fast exponentaton wth precomputaton, Advances n Cryptology Eurocrypt 9, LNCS 658, pp. -7. Sprnger- Verlag. 6) Lm, C. H. and Lee, P. J. (1994) More flexble exponentaton wth precomputatons. Proc. CRYPTO 94, pp ) Al-Soman, T. F. and Ibrahm, M. K. (9) Genercpont parallel scalar multplcaton wthout precomputatons, IEICE Electroncs Express, 6, 4, ) Ldl, R. and Nederreter, H. (1994) Introducton to Fnte Felds and ther Applcatons. Cambrdge Unersty Press, Cambrdge, UK. 9) Cohen, H., Ono, T. and Myaj, A. (1998) Effcent ellptc curve exponentaton usng mxed coordnates. Advances n Cryptology SIACRYPT '98, LNCS 1514, pp Sprnger-Verlag. 1) Washngton, L. C. (8), Ellptc Curves: Number Theory and Cryptography, nd ed., CRC Press. 11) Joye, M. and Tymen, C. (1) Compact encodng of non-adjacent forms wth applcatons to ellptc curve cryptography, Publc Key Cryptography, LNCS 199, pp Sprnger-Verlag. Table 1: Results of the method proposed n [7] wth and
5 P a g e 36 Vol. 1 Issue 11 (Ver. 1.) October 1 Global Journal of Computer Scence and Technology Table : Results of the method proposed n [7] wth and. DBLs Bnary ADDs NAF ADDs Acc ADDs Bnary Total (DBLs) NAF Total (DBLs) Scalar Multplcaton (DBLs) No. of Processors m=18 m=16 m= m=56 Scalar Multplcaton (DBLs) No. of Processors m=18 m=16 m= m=56 Fgure 1: Bnary encodng results of the method proposed n [7] wth and. Fgure : NAF encodng results of the method proposed n [7] wth and.
6 Global Journal of Computer Scence and Technology Vol. 1 Issue 11 (Ver. 1.) October 1 P a g e 37 ) S.Ganapathy and S.Velusam, Desgn of MOEA based Decentralzed Load-Frequency Controllers for Interconnected Power Systems wth AC-DC Parallel Te-lnes, Internatonal Journal of Recent Trends n Engneerng, Vol., No. 5,.p: , November 9. 3) Goldberg, Genetc Algorthms n search, optmzaton and machne learnng Addson- Wesly, ) Ahmed A. A. Radwan, Bahgat A. Abdel Latef, Abdel Mged A. Al and Osman A. Sade, "Usng Genetc Algorthm to Improve Informaton Retreval Systems", World Academy of Scence and Engneerng Technology, Vol.17, No.,pp.6-13, May 6 5) Zheng and Kyooa, Genetc Algorthms Applcatons: Assgnment # for Dr. Z. Dong, November ) Tomoyu Hroyasu, "Desel Engne Desgn usng Mult-Objecte Genetc Algorthm", Techncal Report, 4 7) Hazra, J. Phulpn, Y. Ernst, D., HVDC control strateges to mprove transent stablty n nterconnected power systems, Power Tech, 9, IEEE Bucharest p.p. 1-6 DOI: 1.119/PTC
Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationCryptanalysis of pairing-free certificateless authenticated key agreement protocol
Cryptanalyss of parng-free certfcateless authentcated key agreement protocol Zhan Zhu Chna Shp Development Desgn Center CSDDC Wuhan Chna Emal: zhuzhan0@gmal.com bstract: Recently He et al. [D. He J. Chen
More informationLETTER Skew-Frobenius Maps on Hyperelliptic Curves
189 Skew-Frobenus Maps on Hyperellptc Curves Shunj KOZAKI a, Nonmember, Kazuto MATSUO, Member, and Yasutomo SHIMBARA, Nonmember SUMMARY Scalar multplcaton methods usng the Frobenus maps are known for effcent
More informationBit-Parallel Word-Serial Multiplier in GF(2 233 ) and Its VLSI Implementation. Dr. M. Ahmadi
Bt-Parallel Word-Seral Multpler n GF(2 233 ) and Its VLSI Implementaton Supervsors: Student: Dr. Huapeng Wu Dr. M. Ahmad Wenka Tang Contents Introducton to Fnte Feld Research Motvatons Proposed Multplers
More informationUse of Sparse and/or Complex Exponents in Batch Verification of Exponentiations
Use of Sparse and/or Complex Exponents n Batch Verfcaton of Exponentatons Jung Hee Cheon 1 and Dong Hoon Lee 2 1 Department of Mathematcs, Seoul Natonal Unversty jhcheon@math.snu.ac.kr, 2 Natonal Securty
More informationRSA /2002/13(08) , ); , ) RSA RSA : RSA RSA [2] , [1,4]
1000-9825/2002/13(081729-06 2002 Journal of Software Vol13, No8 RSA 1,2 1, 1 (, 200433; 2 (, 200070 E-mal: yfhu@fudaneducn http://wwwfudaneducn : RSA RSA :, ; RSA,,, RSA,, : ; RSA ; ;RSA; : TP309 : A RSA
More informationA Novel Feistel Cipher Involving a Bunch of Keys supplemented with Modular Arithmetic Addition
(IJACSA) Internatonal Journal of Advanced Computer Scence Applcatons, A Novel Festel Cpher Involvng a Bunch of Keys supplemented wth Modular Arthmetc Addton Dr. V.U.K Sastry Dean R&D, Department of Computer
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationAn efficient algorithm for multivariate Maclaurin Newton transformation
Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,
More informationThe Synchronous 8th-Order Differential Attack on 12 Rounds of the Block Cipher HyRAL
The Synchronous 8th-Order Dfferental Attack on 12 Rounds of the Block Cpher HyRAL Yasutaka Igarash, Sej Fukushma, and Tomohro Hachno Kagoshma Unversty, Kagoshma, Japan Emal: {garash, fukushma, hachno}@eee.kagoshma-u.ac.jp
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationA New Design of Multiplier using Modified Booth Algorithm and Reversible Gate Logic
Internatonal Journal of Computer Applcatons Technology and Research A New Desgn of Multpler usng Modfed Booth Algorthm and Reversble Gate Logc K.Nagarjun Department of ECE Vardhaman College of Engneerng,
More informationOn cyclic of Steiner system (v); V=2,3,5,7,11,13
On cyclc of Stener system (v); V=,3,5,7,,3 Prof. Dr. Adl M. Ahmed Rana A. Ibraham Abstract: A stener system can be defned by the trple S(t,k,v), where every block B, (=,,,b) contans exactly K-elementes
More informationEfficient Fixed Base Exponentiation and Scalar Multiplication based on a Multiplicative Splitting Exponent Recoding
Effcent Fxed Base Exponentaton and Scalar Multplcaton based on a Multplcatve Splttng Exponent Recodng Jean-Marc Robert, Chrstophe Negre, Thomas Plantard To cte ths verson: Jean-Marc Robert, Chrstophe Negre,
More informationTOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION
1 2 MULTIPLIERLESS FILTER DESIGN Realzaton of flters wthout full-fledged multplers Some sldes based on support materal by W. Wolf for hs book Modern VLSI Desgn, 3 rd edton. Partly based on followng papers:
More informationCryptanalysis of a Public-key Cryptosystem Using Lattice Basis Reduction Algorithm
www.ijcsi.org 110 Cryptanalyss of a Publc-key Cryptosystem Usng Lattce Bass Reducton Algorthm Roohallah Rastagh 1, Hamd R. Dall Oskoue 2 1,2 Department of Electrcal Engneerng, Aeronautcal Unversty of Snce
More informationCOMPOSITE BEAM WITH WEAK SHEAR CONNECTION SUBJECTED TO THERMAL LOAD
COMPOSITE BEAM WITH WEAK SHEAR CONNECTION SUBJECTED TO THERMAL LOAD Ákos Jósef Lengyel, István Ecsed Assstant Lecturer, Professor of Mechancs, Insttute of Appled Mechancs, Unversty of Mskolc, Mskolc-Egyetemváros,
More informationNON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS
IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationThe Improved Montgomery Scalar Multiplication Algorithm with DPA Resistance Yanqi Xu, Lin Chen, Moran Li
nd Internatonal Conference on Electrcal, Computer Engneerng and Electroncs (ICECEE 015) The Improved Montgomery Scalar Multplcaton Algorthm wth DPA Resstance Yanq Xu, Ln Chen, Moran L Informaton Scence
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationNew modular multiplication and division algorithms based on continued fraction expansion
New modular multplcaton and dvson algorthms based on contnued fracton expanson Mourad Goucem a a UPMC Unv Pars 06 and CNRS UMR 7606, LIP6 4 place Jusseu, F-75252, Pars cedex 05, France Abstract In ths
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationSuppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl
RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationA MODIFIED METHOD FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS
Journal of Mathematcs and Statstcs 9 (1): 4-8, 1 ISSN 1549-644 1 Scence Publcatons do:1.844/jmssp.1.4.8 Publshed Onlne 9 (1) 1 (http://www.thescpub.com/jmss.toc) A MODIFIED METHOD FOR SOLVING SYSTEM OF
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationIRREDUCIBLE POLYNOMIALS OF MAXIMUM WEIGHT OMRAN AHMADI AND ALFRED MENEZES
IRREDUCIBLE POLYNOMIALS OF MAXIMUM WEIGHT OMRAN AHMADI AND ALFRED MENEZES Abstract. We establsh some necessary condtons for the exstence of rreducble polynomals of degree n and weght n over F 2. Such polynomals
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationA Novel, Low-Power Array Multiplier Architecture
A Noel, Low-Power Array Multpler Archtecture by Ronak Bajaj, Saransh Chhabra, Sreehar Veeramachanen, MB Srnas n 9th Internatonal Symposum on Communcaton and Informaton Technology 29 (ISCIT 29) Songdo -
More informationAn Improved multiple fractal algorithm
Advanced Scence and Technology Letters Vol.31 (MulGraB 213), pp.184-188 http://dx.do.org/1.1427/astl.213.31.41 An Improved multple fractal algorthm Yun Ln, Xaochu Xu, Jnfeng Pang College of Informaton
More informationApplication of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems
Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013
ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationCHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION
CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationOn the size of quotient of two subsets of positive integers.
arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationHyper-Sums of Powers of Integers and the Akiyama-Tanigawa Matrix
6 Journal of Integer Sequences, Vol 8 (00), Artcle 0 Hyper-Sums of Powers of Integers and the Ayama-Tangawa Matrx Yoshnar Inaba Toba Senor Hgh School Nshujo, Mnam-u Kyoto 60-89 Japan nava@yoto-benejp Abstract
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationHigh-Speed Decoding of the Binary Golay Code
Hgh-Speed Decodng of the Bnary Golay Code H. P. Lee *1, C. H. Chang 1, S. I. Chu 2 1 Department of Computer Scence and Informaton Engneerng, Fortune Insttute of Technology, Kaohsung 83160, Tawan *hpl@fotech.edu.tw
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationREDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].
REDUCTION MODULO p. IAN KIMING We wll prove the reducton modulo p theorem n the general form as gven by exercse 4.12, p. 143, of [1]. We consder an ellptc curve E defned over Q and gven by a Weerstraß
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationApplication of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations
Applcaton of Nonbnary LDPC Codes for Communcaton over Fadng Channels Usng Hgher Order Modulatons Rong-Hu Peng and Rong-Rong Chen Department of Electrcal and Computer Engneerng Unversty of Utah Ths work
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationThe Feynman path integral
The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space
More informationOperating conditions of a mine fan under conditions of variable resistance
Paper No. 11 ISMS 216 Operatng condtons of a mne fan under condtons of varable resstance Zhang Ynghua a, Chen L a, b, Huang Zhan a, *, Gao Yukun a a State Key Laboratory of Hgh-Effcent Mnng and Safety
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationRestricted divisor sums
ACTA ARITHMETICA 02 2002) Restrcted dvsor sums by Kevn A Broughan Hamlton) Introducton There s a body of work n the lterature on varous restrcted sums of the number of dvsors of an nteger functon ncludng
More informationHardening the ElGamal Cryptosystem in the Setting of the Second Group of Units
54 The Internatonal Arab Journal of Informaton Technology, Vol., o. 5, September 204 Hardenng the ElGamal Cryptosystem n the Settng of the Second Group of Unts Ramz Haraty, Abdulasser ElKassar, and Suzan
More informationLecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES
COMPUTATIONAL FLUID DYNAMICS: FDM: Appromaton of Second Order Dervatves Lecture APPROXIMATION OF SECOMD ORDER DERIVATIVES. APPROXIMATION OF SECOND ORDER DERIVATIVES Second order dervatves appear n dffusve
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationThe average time complexity of probabilistic algorithms for finding generators in finite cyclic groups
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES, Vol 63, No 4, 2015 DOI: 101515/bpasts-2015-0112 The average tme complexty of probablstc algorthms for fndng generators n fnte cyclc groups
More informationBit Juggling. Representing Information. representations. - Some other bits. - Representing information using bits - Number. Chapter
Representng Informaton 1 1 1 1 Bt Jugglng - Representng nformaton usng bts - Number representatons - Some other bts Chapter 3.1-3.3 REMINDER: Problem Set #1 s now posted and s due next Wednesday L3 Encodng
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationGroup Theory Worksheet
Jonathan Loss Group Theory Worsheet Goals: To ntroduce the student to the bascs of group theory. To provde a hstorcal framewor n whch to learn. To understand the usefulness of Cayley tables. To specfcally
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationPop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing
Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,
More informationCSE4210 Architecture and Hardware for DSP
4210 Archtecture and Hardware for DSP Lecture 1 Introducton & Number systems Admnstratve Stuff 4210 Archtecture and Hardware for DSP Text: VLSI Dgtal Sgnal Processng Systems: Desgn and Implementaton. K.
More informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationProcedia Computer Science
Avalable onlne at www.scencedrect.com Proceda Proceda Computer Computer Scence Scence 1 (01) 00 (009) 589 597 000 000 Proceda Computer Scence www.elsever.com/locate/proceda Internatonal Conference on Computatonal
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationDETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM
Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI
More informationThe equation of motion of a dynamical system is given by a set of differential equations. That is (1)
Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence
More informationMAE140 - Linear Circuits - Fall 10 Midterm, October 28
M140 - Lnear rcuts - Fall 10 Mdterm, October 28 nstructons () Ths exam s open book. You may use whatever wrtten materals you choose, ncludng your class notes and textbook. You may use a hand calculator
More informationIntroduction to Algorithms
Introducton to Algorthms 6.046J/8.40J Lecture 7 Prof. Potr Indyk Data Structures Role of data structures: Encapsulate data Support certan operatons (e.g., INSERT, DELETE, SEARCH) Our focus: effcency of
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationA linear imaging system with white additive Gaussian noise on the observed data is modeled as follows:
Supplementary Note Mathematcal bacground A lnear magng system wth whte addtve Gaussan nose on the observed data s modeled as follows: X = R ϕ V + G, () where X R are the expermental, two-dmensonal proecton
More informationFast Variants of RSA
Fast Varants of RSA Dan Boneh dabo@cs.stanford.edu Hovav Shacham hovav@cs.stanford.edu Abstract We survey four varants of RSA desgned to speed up RSA decrypton and sgnng. We only consder varants that are
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationCryptanalysis of Some Double-Block-Length Hash Modes of Block Ciphers with n-bit Block and n-bit Key
Cryptanalyss of Some Double-Block-Length Hash Modes of Block Cphers wth n-bt Block and n-bt Key Deukjo Hong and Daesung Kwon Abstract In ths paper, we make attacks on DBL (Double-Block-Length) hash modes
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationProvable Security Signatures
Provable Securty Sgnatures UCL - Louvan-la-Neuve Wednesday, July 10th, 2002 LIENS-CNRS Ecole normale supéreure Summary Introducton Sgnature FD PSS Forkng Lemma Generc Model Concluson Provable Securty -
More information