improvement of a javascript cryptographic
play

Improvement of a JavaScript cryptographic library performance with - PowerPoint PPT Presentation

Improvement of a JavaScript cryptographic library performance with big numbers Master Semester Project Julien von Felten Supervisor: Gaylor Bosson Responsible: Prof. Bryan Ford DEDIS, EPFL January 2020 1/11 Table of Contents Introduction


  1. Improvement of a JavaScript cryptographic library performance with big numbers Master Semester Project Julien von Felten Supervisor: Gaylor Bosson Responsible: Prof. Bryan Ford DEDIS, EPFL January 2020 1/11

  2. Table of Contents Introduction Design of the optimizations Results Future work Conclusion 2/11

  3. Introduction Kyber Developed in Go • Adapted in JS for status.dedis.ch • JavaScript numbers < 𝟑 𝟔𝟒 • Uses bn.js library for big integers • No verification of links for the • SkipChain Project Benchmark • Optimizations • BigInt o Modulus o Pool o Each optimization implemented on top of each other 3/11

  4. Benchmark Library used: Performance MDN API for browser performance Measure of the time of: N signatures and each • signature N verifications and each • verification N = [2, 10, 100, 500, 1000] Min, Max, Avg computed • 4/11

  5. First optimization: BigInt BN.js: BNType, represented by array Replacing BNType by BigInt Implementation of more complex function than operators 5/11

  6. Second optimization: Modulus 55% of time spent for modulus computation ( 𝑩 𝐧𝐩𝐞 𝒐 ∗ B mod n) mod n = (𝑩 ∗ B ) mod n Modulus functions used in higher abstraction level functions 6/11

  7. Third optimization: Memory Pool Memory pool: Group of objects in memory ready to be used 318,000,000 gfp and 90,000,000 gfp2 objects created for N = 1000 Package deePool and mutable classes 7/11

  8. Results of the optimizations Master BigInt Modulus Pool Minimum 166.3 [ms] 54.91 [ms] 33.36 [ms] 36.46 [ms] Values obtained Average 180.26 [ms] 58.21 [ms] 36.92 [ms] 41.08 [ms] for 1000 Maximum 222.79 [ms] 73.12 [ms] 55.9 [ms] 59.26 [ms] verification keys Ratio 5.5 5.08 3.21 3.6 Ratio: time verification / time signature 8/11

  9. Results of the comparison of the browsers and NodeJS Chrome, Opera, Edge, NodeJs: v8 engine Firefox: SpiderMonkey engine NodeJS: more layers with event loop, low-level I/O API, file system I/O Best value obtained: 28.6ms on Chrome Windows 9/11

  10. Future work Instead of BigInt: concatenation of two numbers Use even fewer modulus Different package of memory pool or own implementation Optimization for NodeJS 10/11

  11. Conclusion BigInt type is working well but depends on browsers Fewer Modulus can be used Memory in JS is optimized, memory pool not needed Kyber can be improved more than 4.76 Key verification under 30ms 11/11

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend