# Gary Miller

> American computer scientist

**Wikidata**: [Q93074](https://www.wikidata.org/wiki/Q93074)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Gary_Miller_(computer_scientist))  
**Source**: https://4ort.xyz/entity/gary-miller

## Summary
Gary Miller is an American computer scientist known for his contributions to algorithms in number theory and computational geometry. He is a professor at Carnegie Mellon University and a recipient of the 2013 Knuth Prize for his work on randomized algorithms and primality testing.

## Biography
- Born: 1950 (circa)
- Nationality: United States
- Education: Ph.D. from University of California, Berkeley (1975)
- Known for: Development of efficient randomized tests of primality and contributions to computational geometry
- Employer(s): Carnegie Mellon University, Massachusetts Institute of Technology, University of Rochester, University of Waterloo, University of South Carolina
- Field(s): Computer science, algorithms, number theory, computational geometry

## Contributions
Gary Miller is best known for developing the Miller-Rabin primality test, a randomized algorithm that efficiently determines whether a number is prime. This work, published in 1976, became foundational for practical implementations of public-key cryptography by enabling fast primality testing. His research has significantly influenced both theoretical computer science and practical cryptographic systems. Miller has also made substantial contributions to computational geometry, particularly in mesh generation and geometric algorithms. As a professor at Carnegie Mellon University, he has mentored numerous doctoral students who have gone on to influential careers in computer science, including F. Thomson Leighton (co-founder of Akamai Technologies) and Susan Landau (prominent cybersecurity expert).

## FAQs
### Q: What is Gary Miller most famous for?
A: Gary Miller is most famous for developing the Miller-Rabin primality test, a randomized algorithm that efficiently determines whether a number is prime, which became crucial for practical public-key cryptography.

### Q: Where does Gary Miller work?
A: Gary Miller is a professor at Carnegie Mellon University, where he has been a faculty member since the 1970s, and has also held positions at MIT, University of Rochester, University of Waterloo, and University of South Carolina.

### Q: What awards has Gary Miller received?
A: Gary Miller received the 2013 Knuth Prize for his contributions to the design and analysis of algorithms, the 2003 Paris Kanellakis Award for his work on primality testing, and was named an ACM Fellow in 2002.

## Why They Matter
Gary Miller's work fundamentally changed how we approach primality testing and cryptographic security. His Miller-Rabin algorithm made it computationally feasible to generate large prime numbers quickly, which is essential for RSA encryption and other public-key cryptosystems that secure internet communications today. Without his contributions, many modern cryptographic protocols would be impractical or insecure. Beyond his technical contributions, Miller has shaped the field through his mentorship of prominent computer scientists and his sustained research in computational geometry, influencing both theoretical foundations and practical applications in computer science.

## Notable For
- Developed the Miller-Rabin primality test (1976), enabling practical public-key cryptography
- Recipient of the 2013 Knuth Prize, considered the highest honor in theoretical computer science
- Mentored F. Thomson Leighton, co-founder of Akamai Technologies
- Made significant contributions to computational geometry and mesh generation algorithms
- Named ACM Fellow in 2002 for contributions to algorithms in number theory and computational geometry

## Body
### Early Career and Education
Gary Miller earned his Ph.D. from the University of California, Berkeley in 1975, where he studied under Manuel Blum, a Turing Award winner. His doctoral work laid the foundation for his later contributions to randomized algorithms.

### The Miller-Rabin Primality Test
In 1976, Miller published his seminal paper on a deterministic primality test that was later adapted by Michael Rabin into the Miller-Rabin test, a probabilistic algorithm. This algorithm can determine whether a number is prime with high probability in polynomial time, making it vastly more efficient than previous methods. The test became a cornerstone of modern cryptography, particularly in generating keys for RSA encryption.

### Academic Career
Miller has been a professor at Carnegie Mellon University since the 1970s, where he has conducted influential research in algorithms and computational geometry. His work includes contributions to mesh generation, geometric algorithms, and the analysis of randomized algorithms. He has also held visiting positions at MIT, University of Rochester, University of Waterloo, and University of South Carolina.

### Mentorship and Influence
Miller has supervised numerous Ph.D. students who have become leaders in computer science. Notable students include F. Thomson Leighton (co-founder of Akamai Technologies), Susan Landau (cybersecurity expert), and several others who have made significant contributions to algorithms and theoretical computer science.

### Recognition
Miller's work has been recognized with some of computer science's highest honors. The 2013 Knuth Prize acknowledged his fundamental contributions to the design and analysis of algorithms. The 2003 Paris Kanellakis Award specifically recognized his work on primality testing and its practical impact on cryptography. His 2002 ACM Fellowship citation highlighted his contributions to both number theory and computational geometry.

## Schema Markup
```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Gary Miller",
  "jobTitle": "Computer Scientist",
  "worksFor": {
    "@type": "Organization",
    "name": "Carnegie Mellon University"
  },
  "nationality": {
    "@type": "Country",
    "name": "United States"
  },
  "birthDate": "1950",
  "alumniOf": [
    {
      "@type": "EducationalOrganization",
      "name": "University of California, Berkeley"
    }
  ],
  "knowsAbout": [
    "Computer Science",
    "Algorithms",
    "Number Theory",
    "Computational Geometry"
  ],
  "sameAs": [
    "https://en.wikipedia.org/wiki/Gary_Miller_(computer_scientist)",
    "https://www.wikidata.org/wiki/Q5555555"
  ],
  "description": "American computer scientist known for developing the Miller-Rabin primality test and contributions to computational geometry"
}

## References

1. [Source](https://awards.acm.org/kanellakis/award-recipients)
2. [Source](https://awards.acm.org/award-recipients/miller_1556943)
3. [Mathematics Genealogy Project](https://www.genealogy.math.ndsu.nodak.edu/id.php?id=31473)
4. Mathematics Genealogy Project
5. [Source](https://scholar.harvard.edu/meret)
6. [Source](https://awards.acm.org/fellows/award-recipients)
7. Freebase Data Dumps. 2013
8. Quora