Corpus ID: 232240209

One-Time Pads from the Digits of Pi

@article{Gualtieri2021OneTimePF,
  title={One-Time Pads from the Digits of Pi},
  author={D. Gualtieri},
  journal={ArXiv},
  year={2021},
  volume={abs/2103.08783}
}
The one-time pad is a secure encryption method when the pads are generated from a true source of random numbers and are kept private between the senders are receivers. There are presently available numerous physical sources capable of generating high quality random numbers at high rates. While generating one-time pads is easy, the bottleneck in their usage is their secure transmittal between sender and receiver. It is far easier for a sender and receiver to decide on a method to retrieve… Expand

Figures from this paper

References

SHOWING 1-10 OF 12 REFERENCES
On the rapid computation of various polylogarithmic constants
TLDR
These algorithms can be easily implemented, require virtually no memory, and feature run times that scale nearly linearly with the order of the digit desired make it feasible to compute the billionth binary digit of log(2) or π on a modest work station in a few hours run time. Expand
%s\t%ld\n
    //build pi digit addresses from hash for (i = 0; i < 10; i++) { memcpy(address_buffer, hash + (5 * i)
      Computation time = %.3f seconds\n", (double) (end -begin) / CLOCKS_PER_SEC)
        Dieharder: A Random Number Test Suite at Robert G. Brown's General Tools Page
          UDB speed comparison
            \nOutput file selected = %s\n
              combine hash with previous round OTP //in first round
              • OTP is all zeros
              for (i = 0; i < pad_size; i++) { printf("%x
                num = (int) strtol(char_buffer, &end_ptr
                  ...
                  1
                  2
                  ...