Добірка наукової літератури з теми "Multiple point multiplication on elliptic curve"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Multiple point multiplication on elliptic curve".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Multiple point multiplication on elliptic curve"
Judge, Lyndon, Suvarna Mane, and Patrick Schaumont. "A Hardware-Accelerated ECDLP with High-Performance Modular Multiplication." International Journal of Reconfigurable Computing 2012 (2012): 1–14. http://dx.doi.org/10.1155/2012/439021.
Повний текст джерелаSajid, Asher, Muhammad Rashid, Malik Imran, and Atif Raza Jafri. "A Low-Complexity Edward-Curve Point Multiplication Architecture." Electronics 10, no. 9 (May 3, 2021): 1080. http://dx.doi.org/10.3390/electronics10091080.
Повний текст джерелаSHLAPENTOKH, ALEXANDRA. "ELLIPTIC CURVE POINTS AND DIOPHANTINE MODELS OF ℤ IN LARGE SUBRINGS OF NUMBER FIELDS". International Journal of Number Theory 08, № 06 (3 серпня 2012): 1335–65. http://dx.doi.org/10.1142/s1793042112500789.
Повний текст джерелаDimopoulos, Charis, Apostolos P. Fournaris, and Odysseas Koufopavlou. "Machine Learning Attacks and Countermeasures on Hardware Binary Edwards Curve Scalar Multipliers." Journal of Sensor and Actuator Networks 10, no. 3 (August 16, 2021): 56. http://dx.doi.org/10.3390/jsan10030056.
Повний текст джерелаBernstein, Daniel J., and Tanja Lange. "Hyper-and-elliptic-curve cryptography." LMS Journal of Computation and Mathematics 17, A (2014): 181–202. http://dx.doi.org/10.1112/s1461157014000394.
Повний текст джерелаZhang, Hai Bin, Xiao Ping Ji, Bo Ying Wu, and Guang Yu Li. "Fast Elliptic Curve Point Multiplication Algorithm Optimization." Applied Mechanics and Materials 441 (December 2013): 1044–48. http://dx.doi.org/10.4028/www.scientific.net/amm.441.1044.
Повний текст джерелаGulen, Utku, and Selcuk Baktir. "Elliptic Curve Cryptography for Wireless Sensor Networks Using the Number Theoretic Transform." Sensors 20, no. 5 (March 9, 2020): 1507. http://dx.doi.org/10.3390/s20051507.
Повний текст джерелаRožić, Vladimir, Oscar Reparaz та Ingrid Verbauwhede. "A 5.1μJper point-multiplication elliptic curve cryptographic processor". International Journal of Circuit Theory and Applications 45, № 2 (1 грудня 2016): 170–87. http://dx.doi.org/10.1002/cta.2291.
Повний текст джерелаChen, Yan-Haw, and Chien-Hsing Huang. "EFFICIENT OPERATIONS IN LARGE FINITE FIELDS FOR ELLIPTIC CURVE CRYPTOGRAPHIC." International Journal of Engineering Technologies and Management Research 7, no. 6 (July 3, 2020): 141–51. http://dx.doi.org/10.29121/ijetmr.v7.i6.2020.712.
Повний текст джерелаKamthawee, Krissanee, and Bhichate Chiewthanakul. "The Construction of ElGamal over Koblitz Curve." Advanced Materials Research 931-932 (May 2014): 1441–46. http://dx.doi.org/10.4028/www.scientific.net/amr.931-932.1441.
Повний текст джерелаДисертації з теми "Multiple point multiplication on elliptic curve"
Hitchcock, Yvonne Roslyn. "Elliptic Curve Cryptography for Lightweight Applications." Queensland University of Technology, 2003. http://eprints.qut.edu.au/15838/.
Повний текст джерелаДичка, Андрій Іванович. "Модифікований метод багатократного скалярного множенння точок еліптичної кривої у скінченних полях". Master's thesis, Київ, 2018. https://ela.kpi.ua/handle/123456789/23653.
Повний текст джерелаThis diploma project is devoted to the development of the modification of the method of multiple scalar multiplication of the points of an elliptic curve in finite fields. This development is a software package for performing operations on points of an elliptic curve, in particular electronic digital signature operations, including the program implementation of the existing and developed method of multiple scalar multiplication of points of an elliptic curve to a number. The functionality of the software complex provides execution of arithmetic operations over the points of the elliptic curve, such as adding, subtracting, multiplying a point by number, finding the inverse of a point, and calculating the digital signature and checking it. This project consists of: software architecture, operations module in finite fields, module of operations with points of an elliptic curve, module of electronic-digital signature.
Ozcan, Ayca Bahar. "Performance Analysis Of Elliptic Curve Multiplication Algorithms For Elliptic Curve Cryptography." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607698/index.pdf.
Повний текст джерелаone of them is the elliptic curve point multiplication operation, which has a great influence on the performance of ECC protocols. In this thesis work, we have studied on elliptic curve point multiplication methods which are proposed by many researchers. The software implementations of these methods are developed in C programming language on Pentium 4 at 3 GHz. We have used NIST-recommended elliptic curves over prime and binary fields, by using efficient finite field arithmetic. We have then applied our elliptic curve point multiplication implementations to Elliptic Curve Digital Signature Algorithm (ECDSA), and compared different methods. The timing results are presented and comparisons with recent studies have been done.
Morozov, Sergey Victorovich. "Elliptic Curve Cryptography on Heterogeneous Multicore Platform." Thesis, Virginia Tech, 2010. http://hdl.handle.net/10919/34872.
Повний текст джерелаMaster of Science
Winson, Ninh. "Performance Comparison of Projective Elliptic-curve Point Multiplication in 64-bit x86 Runtime Environment." NSUWorks, 2014. http://nsuworks.nova.edu/gscis_etd/11.
Повний текст джерелаJosyula, Sai Prashanth. "On the Applicability of a Cache Side-Channel Attack on ECDSA Signatures : The Flush+Reload attack on the point multiplication in ECDSA signature generation process." Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10820.
Повний текст джерелаGwalani, Kapil A. "Design and evaluation of an "FPGA based" hardware accelerator for elliptic curve cryptography point multiplication a thesis presented to the faculty of the Graduate School, Tennessee Technological University /." Click to access online, 2009. http://proquest.umi.com/pqdweb?index=0&did=2000377711&SrchMode=1&sid=6&Fmt=6&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1277483243&clientId=28564.
Повний текст джерелаRobert, Jean-Marc. "Contrer l'attaque Simple Power Analysis efficacement dans les applications de la cryptographie asymétrique, algorithmes et implantations." Thesis, Perpignan, 2015. http://www.theses.fr/2015PERP0039/document.
Повний текст джерелаThe development of online communications and the Internet have made encrypted data exchange fast growing. This has been possible with the development of asymmetric cryptographic protocols, which make use of arithmetic computations such as modular exponentiation of large integer or elliptic curve scalar multiplication. These computations are performed by various platforms, including smart-cards as well as large and powerful servers. The platforms are subject to attacks taking advantage of information leaked through side channels, such as instantaneous power consumption or electromagnetic radiations.In this thesis, we improve the performance of cryptographic computations resistant to Simple Power Analysis. On modular exponentiation, we propose to use multiple multiplications sharing a common operand to achieve this goal. On elliptic curve scalar multiplication, we suggest three different improvements : over binary fields, we make use of improved combined operation AB,AC and AB+CD applied to Double-and-add, Halve-and-add and Double/halve-and-add approaches, and to the Montgomery ladder ; over binary field, we propose a parallel Montgomery ladder ; we make an implementation of a parallel approach based on the Right-to-left Double-and-add algorithm over binary and prime fields, and extend this implementation to the Halve-and-add and Double/halve-and-add over binary fields
Huang, Yu-chen, and 黃昱軫. "Scalar Representation for Simultaneous Elliptic Curve Point Multiplication." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/29006696410880204389.
Повний текст джерела東吳大學
資訊科學系
94
One of the most frequent operations in modern cryptosystems is a multi-scalar multiplication with two scalars. Their speed mainly depends on the (joint) Hamming weight of the scalar. Therefore, to improve the performance, we must to look for a representation provides the low joint Hamming weight. In this paper we will use the concept of “mutual opposite form” to simultaneously recode two scalars stating at most significant bit (MSB) to least significant bit (LSB), i.e. left-to-right recoding. We propose a new representation with low joint Hamming weight to reduce the number of elliptic curve point additions to achieve decreasing the operation cost.
Liu, Wen-Shung, and 劉文雄. "Server-aided elliptic curve point multiplication for resource-limited devices." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/80581038764054249296.
Повний текст джерела國立中興大學
資訊科學系所
95
Elliptic Curve Cryptosystem (ECC) has widely received increased commercial acceptance as evidenced by its inclusion in standards by accredited standards organizations such as ANSI, IEEE, ISO and NIST in recent years. It is believed that the key length of elliptic curve cryptosystems can be shorter than that of RSA with the same security strength. Therefore, ECC is suitable for the resource-limited devices such as smart card, cell phone, PDA or other wireless movie mobiles. The problem are that the processing power of the resource-limited device is low and that memory is small. Point multiplication (KP), is an elliptic curve operation which dominates the execution time of elliptic curve cryptosystems. How to make the point multiplication of the resource-limited device more efficient by using the powerful server is considered in this paper. We propose a new method, with the powerful server to calculate the K''P when client transfers the K'' to server. After the client has verified the K''P, it can efficiently calculate the KP.
Частини книг з теми "Multiple point multiplication on elliptic curve"
Rostovtsev, Alexander, and Elena Makhovenko. "Elliptic Curve Point Multiplication." In Lecture Notes in Computer Science, 328–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45215-7_28.
Повний текст джерелаHankerson, Darrel, and Alfred Menezes. "Elliptic Curve Point Multiplication Using Halving." In Encyclopedia of Cryptography and Security, 403–6. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_249.
Повний текст джерелаHankerson, Darrel, and Alfred Menezes. "Elliptic Curve Point Multiplication Using Halving." In Encyclopedia of Cryptography, Security and Privacy, 1–5. Berlin, Heidelberg: Springer Berlin Heidelberg, 2021. http://dx.doi.org/10.1007/978-3-642-27739-9_249-2.
Повний текст джерелаKodali, Ravi Kishore. "A Mathematical Analysis of Elliptic Curve Point Multiplication." In Communications in Computer and Information Science, 192–200. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44966-0_18.
Повний текст джерелаMöller, Bodo. "Securing Elliptic Curve Point Multiplication against Side-Channel Attacks." In Lecture Notes in Computer Science, 324–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45439-x_22.
Повний текст джерелаFeng, Min, Bin B. Zhu, Cunlai Zhao, and Shipeng Li. "Signed MSB-Set Comb Method for Elliptic Curve Point Multiplication." In Information Security Practice and Experience, 13–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11689522_2.
Повний текст джерелаShohdy, Sameh m., Ashraf b. El-sisi, and Nabil Ismail. "FPGA Implementation of Elliptic Curve Point Multiplication over GF(2191)." In Advances in Information Security and Assurance, 619–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02617-1_63.
Повний текст джерелаHemambujavalli, S., P. Nirmal Kumar, Deepa Jose, and S. Anthoniraj. "FPGA Implementation of Elliptic Curve Point Multiplication Over Galois Field." In Mobile Radio Communications and 5G Networks, 619–33. Singapore: Springer Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-7018-3_46.
Повний текст джерелаDimitrov, Vassil, Laurent Imbert, and Pradeep Kumar Mishra. "Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains." In Lecture Notes in Computer Science, 59–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11593447_4.
Повний текст джерелаMöller, Bodo. "Parallelizable Elliptic Curve Point Multiplication Method with Resistance against Side-Channel Attacks." In Lecture Notes in Computer Science, 402–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45811-5_31.
Повний текст джерелаТези доповідей конференцій з теми "Multiple point multiplication on elliptic curve"
Shylashree, N., and V. Sridhar. "Hardware realization of high speed elliptic curve point multiplication using multiple Point Doublers and point adders." In 2013 Annual IEEE India Conference (INDICON). IEEE, 2013. http://dx.doi.org/10.1109/indcon.2013.6726157.
Повний текст джерелаAntao, Samuel, Jean-Claude Bajard, and Leonel Sousa. "Elliptic Curve point multiplication on GPUs." In 2010 21st IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP). IEEE, 2010. http://dx.doi.org/10.1109/asap.2010.5541000.
Повний текст джерелаKodali, Ravi Kishore, Srikrishna Karanam, Kashyapkumar Patel, and Harpreet Singh Budwal. "Fast elliptic curve point multiplication for WSNs." In 2013 IEEE TENCON Spring Conference. IEEE, 2013. http://dx.doi.org/10.1109/tenconspring.2013.6584439.
Повний текст джерелаMorales, Einstein. "On fast implementations of elliptic curve point multiplication." In ACM SE '22: 2022 ACM Southeast Conference. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3476883.3520223.
Повний текст джерелаImran, Malik, Samuel Pagliarini, and Muhammad Rashid. "An Area Aware Accelerator for Elliptic Curve Point Multiplication." In 2020 27th IEEE International Conference on Electronics, Circuits and Systems (ICECS). IEEE, 2020. http://dx.doi.org/10.1109/icecs49266.2020.9294908.
Повний текст джерелаKodali, Ravi Kishore, Kashyapkumar H. Patel, and Narasimha Sarma. "Energy efficient elliptic curve point multiplication for WSN applications." In 2013 National Conference on Communications (NCC). IEEE, 2013. http://dx.doi.org/10.1109/ncc.2013.6488031.
Повний текст джерелаLeca, Cristian-Liviu, and Cristian-Iulian Rincu. "Combining point operations for efficient elliptic curve cryptography scalar multiplication." In 2014 10th International Conference on Communications (COMM). IEEE, 2014. http://dx.doi.org/10.1109/iccomm.2014.6866676.
Повний текст джерелаDeschamps, Jean-Pierre, and Gustavo Sutter. "Elliptic-Curve Point-Multiplication over GF(2163)." In 2008 4th Southern Conference on Programmable Logic (SPL). IEEE, 2008. http://dx.doi.org/10.1109/spl.2008.4547727.
Повний текст джерелаMohammadi, Maryam, and Amir Sabbagh Molahosseini. "Efficient design of Elliptic Curve Point Multiplication based on fast Montgomery modular multiplication." In 2013 3th International eConference on Computer and Knowledge Engineering (ICCKE). IEEE, 2013. http://dx.doi.org/10.1109/iccke.2013.6682865.
Повний текст джерелаWei, Wei, Li Zhang, and Chip-Hong Chang. "A modular design of elliptic-curve point multiplication for resource constrained devices." In 2014 International Symposium on Integrated Circuits (ISIC). IEEE, 2014. http://dx.doi.org/10.1109/isicir.2014.7029487.
Повний текст джерела