How good is Victor Miller?

Victor Miller has a Lunoo score of 8.8/10. This score is based on AI-powered analysis of category fit, feature coverage, pricing signals, public reception, and recency.

What are the best alternatives to Victor Miller?

Visit lunoo.com/alternatives/victor-miller to see top-ranked competitors with objective AI-powered scores and side-by-side comparisons.

zoom_in Click to enlarge

Victor Miller

8.79

Great

▲ ▼

Computer Scientist American Mathematics Cryptography Ibm Elliptic Curves

description Victor Miller Overview

Victor S. Miller is an American mathematician at IBM Research who, independently of Neal Koblitz, proposed elliptic curves as the basis for public-key cryptography in 1985. The discrete logarithm problem on elliptic curves provides comparable security to systems like RSA with much smaller keys, making ECC central to modern protocols such as TLS and Signal. His work is foundational to cryptographic engineering and standards including NIST SP 800-186.

insights Ranking position

Victor Miller ranks #62 of 185 in the Computer Scientist ranking, behind Thomas Cover, ahead of Jon Kleinberg.

help Victor Miller FAQ

What did Victor Miller propose for elliptic curve cryptography?

In 1985, Victor Miller, then a researcher at IBM, independently proposed using the group of points on elliptic curves as the basis for public-key cryptography, parallel to Neal Koblitz's similar proposal. Miller's key insight was that the elliptic curve discrete logarithm problem appeared to be significantly harder than the standard discrete logarithm problem.

Who independently discovered elliptic curve cryptography alongside Victor Miller?

Neal Koblitz at the University of Washington independently proposed elliptic curve cryptography at roughly the same time as Miller, in 1985-1987. Both Miller and Koblitz are jointly credited as the founders of the field, which enables much smaller key sizes than RSA for equivalent security.

What does Victor Miller do at IBM?

Victor Miller has been a researcher at IBM Research, where he has worked on cryptography, number theory, and algorithmic mathematics. His work on elliptic curve cryptography has been adopted in standards including the NIST elliptic curve standards used in TLS and other security protocols.

Why is elliptic curve cryptography more efficient than RSA?

Elliptic curve cryptography achieves comparable security to RSA with much smaller key sizes: a 256-bit ECC key provides roughly equivalent security to a 3072-bit RSA key. This efficiency makes ECC attractive for mobile devices, smartcards, and other resource-constrained environments.