Loading...
Please wait, while we are loading the content...
Similar Documents
A Primer on Algebra and Number Theory for Computer Scientists (version 0.1)
| Content Provider | Semantic Scholar |
|---|---|
| Author | Shoup, Victor |
| Copyright Year | 2002 |
| Abstract | Preface This is a very preliminary version of some notes that are intended to introduce computer science students to elementary notions of algebra and number theory, especially those notions that are relevant to the study of cryptography. These notes are meant to be quite self contained — the only prerequisites are some programming experience, a little knowledge of probabilities, and, most importantly, the ability to read and write mathematical proofs (or at least the willingness and ability to learn to do so). Many proofs of theorems that are relatively straightforward applications of definitions and other theorems are left as exercises for the reader. There are also many examples that the reader can verify as well. Other than these, there are no " formal " exercises in these notes. As stated above, these notes are in a very preliminary form. They certainly need more proof reading and polishing, and I may eventually want to add some new material as well. Also, there are currently no bibliographic references, which is a serious problem that I will have to correct very soon. If you find any typos or more serious problems, please let me know, so that I can correct the problem in a future revision. • log(x) denotes the natural logarithm of x. • For any function f from a set A into a set B, if A ⊂ A, then f (A) := {f (a) ∈ B : a ∈ A }. For b ∈ B, f −1 (b) := {a ∈ A : f (a) = b}, and more generally, for B ⊂ B, f −1 (B) := {a ∈ A : f (a) ∈ B }. f is called one to one or injective if f (a) = f (b) implies a = b. f is called onto or surjective if f (A) = B. f is called bijective if it is both injective and surjective; in this case, f is called a bijection. • Suppose f and g are functions from either the non-negative integers or non-negative reals into the non-negative reals. More generally, we may allow the domain of definition of f and g to consist all off integers or reals above some fixed bound. Then we write f = O(g) if there exist constants c > 0 and x 0 ≥ 0 such that f (x) ≤ cg(x) for all x ≥ x 0. We write … |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://cs.nyu.edu/courses/fall02/V22.0480-001/out/shoup.pdf |
| Alternate Webpage(s) | http://www.cs.nyu.edu/courses/spring05/V22.0480-005/out/shoup.pdf |
| Alternate Webpage(s) | http://www.cs.nyu.edu/courses/spring12/CSCI-GA.3210-001/out/shoup.pdf |
| Alternate Webpage(s) | https://cs.nyu.edu/courses/fall02/V22.0480-001/out/shoup.pdf |
| Alternate Webpage(s) | https://cs.nyu.edu/courses/fall02/G22.3033-010/notes.pdf |
| Alternate Webpage(s) | http://www.cs.nyu.edu/courses/fall06/G22.3210-001/out/shoup.pdf |
| Alternate Webpage(s) | http://www.cs.nyu.edu/courses/fall08/G22.3210-001/out/shoup.pdf |
| Alternate Webpage(s) | http://cs.nyu.edu/courses/fall06/G22.3210-001/out/shoup.pdf |
| Alternate Webpage(s) | http://www.cs.nyu.edu/courses/spring06/V22.0480-003/out/shoup.pdf |
| Alternate Webpage(s) | http://old.corelab.ntua.gr/courses/crypto/documents/shoup-primer.pdf |
| Alternate Webpage(s) | http://cs.nyu.edu/courses/fall08/G22.3210-001/out/shoup.pdf |
| Alternate Webpage(s) | http://cs.nyu.edu/courses/spring12/CSCI-GA.3210-001/out/shoup.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
