cse101_9_26_11

cse101_9_26_11 - Numeric algorithms 1. Cryptography A....

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Numeric algorithms 1. Cryptography A. Public-key cryptography has enabled e-commerce. It relies upon the algorithmic status of two classical problems. a. Factoring: given a number return its prime factorization (cannot be solved in polynomial time) There is no efficient (polynomial0 algorithm for this. b. Primality: given a number, say whether it is prime or composite. Can be solved efficiently. 2. The decimal system B. The unary system eg. 11111111 = 8. 10 100 – In unary the space required would exceed the # of particles in the universe. In decimal, need only 101 digits. C. Quantifying size – writing the number N in many require N characters. In decimal, you need log n n digits. N -> log N, exponentially smaller representation. Roman system: only a constant beter than unary, still O(N) space). D. In decimal, using d digits, you can write numbers in the range 0 to 10 d – 1. Therefore in order to write N in decimal, # of digit needed is the smallest integer d such that N <= 10 d – 1. D >= log
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/09/2012 for the course CSE 101 taught by Professor Staff during the Spring '08 term at UCSD.

Page1 / 2

cse101_9_26_11 - Numeric algorithms 1. Cryptography A....

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online