query: Number theory used in cryptography
positive_passages.docid: 24135
positive_passages.text: What are the answers for these basic quetions?
negative_passages.docid: 8620
negative_passages.text: Summarize the mathematical problem at the heart of breaking a Curve25519 public key
negative_passages.docid: 132118
negative_passages.text: Computing the $n^{\textrm{th}}$ permutation of bits.
negative_passages.docid: 141704
negative_passages.text: Fractional exponentiation in modular arithmetic
negative_passages.docid: 151093
negative_passages.text: RSA with composite numbers
negative_passages.docid: 53312
negative_passages.text: Multiplication principle and permutation
negative_passages.docid: 92024
negative_passages.text: Elementary number theory - prerequisites
negative_passages.docid: 35650
negative_passages.text: Number theory in Physics
negative_passages.docid: 100730
negative_passages.text: Is there a length-preserving encryption scheme?
negative_passages.docid: 94430
negative_passages.text: Examples of number theory showing up in physics
negative_passages.docid: 115305
negative_passages.text: Why is RSA encryption key based on modulo $\varphi(n)$ rather than modulo $n$?
negative_passages.docid: 39969
negative_passages.text: Algorithms for computing multiplicative order modulo $n$
negative_passages.docid: 107866
negative_passages.text: How is information disclosed by modular multiplication?
negative_passages.docid: 21274
negative_passages.text: Security strength of RSA in relation with the modulus size
negative_passages.docid: 43003
negative_passages.text: lcm versus phi in RSA
negative_passages.docid: 64779
negative_passages.text: A simple block cipher based on the SHA-256 hash function
negative_passages.docid: 80154
negative_passages.text: Selection of cryptographic functions for OAEP