Benchmarking post-quantum cryptography: News regarding the SUPERCOP benchmarking system, and more recommendations to NIST. #benchmarking #supercop #nist #pqcrypto

First off, the tools themselves. QS stands for “QuickSort,” which is an algorithm used to sort lists of numbers quickly (hence the name). NFS, on the other hand, stands for “Network File System,” which is a protocol used to access files over a network. So what in tarnation are we doing comparing these two things? Well, it turns out that some people have found a way to use QS and NFS tools to generate large prime numbers which is kind of important when it comes to post-quantum cryptography benchmarking!

Now, before you start rolling your eyes and muttering about how this has nothing to do with the topic at hand (which would be a valid point), let me explain. In order to test the performance of various post-quantum encryption algorithms, we need large prime numbers as part of our key generation process. And while there are many ways to generate these primes, some people have found that using QS and NFS tools can actually be faster than traditional methods for certain ranges of digits (specifically 85-100).

So how does this work? Well, it turns out that if you use a modified version of the QuickSort algorithm to sort lists of numbers in reverse order, you can generate large prime numbers by looking at the middle element of each sorted list. And if you do this for multiple lists simultaneously (using NFS tools to access them over a network), you can speed up the process even further!

Now, I know what some of you are thinking “But Ben, isn’t this just a waste of time? Why bother comparing QS and NFS tools when there are already established methods for generating large prime numbers?” And to that, my response is: because it’s fun! Plus, who knows maybe someone will find an even faster way to generate primes using these tools in the future.

So if you’re feeling adventurous (and have a lot of time on your hands), why not give Ben Buhrow’s Comparison of QS and NFS Tools for 85-100 Digits a try? Who knows maybe you’ll discover something new and exciting!

In terms of script or commands examples, here are some basic steps to generate large prime numbers using the modified QuickSort algorithm:

1. Create a list of random integers (using any method you prefer) with 85-100 digits.
2. Sort this list in reverse order using the modified QuickSort algorithm.
3. Look at the middle element of each sorted list to see if it’s prime or not. If it is, keep track of it as a potential candidate for your key generation process.
4. Repeat steps 1-3 multiple times (using NFS tools to access different lists simultaneously) in order to speed up the process and increase your chances of finding large primes.
5. Once you’ve generated enough prime numbers, use them to test various post-quantum encryption algorithms using a benchmarking system like SUPERCOP!