Neal Koblitz

Last updated
Neal Koblitz
Born (1948-12-24) December 24, 1948 (age 75)
NationalityAmerican
Alma mater Princeton University
Harvard University
Known for Elliptic and hyperelliptic curve cryptography
Scientific career
Fields Mathematics
Institutions University of Washington
University of Waterloo
Doctoral advisor Nick Katz
Doctoral students Daqing Wan

Neal I. Koblitz (born December 24, 1948) [1] is a Professor of Mathematics at the University of Washington. He is also an adjunct professor with the Centre for Applied Cryptographic Research at the University of Waterloo. He is the creator of hyperelliptic curve cryptography and the independent co-creator of elliptic curve cryptography.

Contents

Biography

Koblitz received his B.A. in mathematics from Harvard University in 1969. [1] While at Harvard, he was a Putnam Fellow in 1968. [2] He received his Ph.D. from Princeton University in 1974 under the direction of Nick Katz. From 1975 to 1979 he was an instructor at Harvard University. [3] In 1979 he began working at the University of Washington.

Koblitz's 1981 article "Mathematics as Propaganda" [4] criticized the misuse of mathematics in the social sciences and helped motivate Serge Lang's successful challenge to the nomination of political scientist Samuel P. Huntington to the National Academy of Sciences. [5] In The Mathematical Intelligencer , Koblitz, [6] [7] [8] Steven Weintraub, [9] and Saunders Mac Lane later criticized the arguments of Herbert A. Simon, who had attempted to defend Huntington's work. [10]

He co-invented elliptic-curve cryptography in 1985 [11] with Victor S. Miller, and for this was awarded the Levchin Prize [12] in 2021.

With his wife Ann Hibner Koblitz, he in 1985 founded the Kovalevskaia Prize to honor women scientists in developing countries. It was financed from the royalties of Ann Hibner Koblitz's 1983 biography of Sofia Kovalevskaia. [13] Although the awardees have ranged over many fields of science, one of the 2011 winners was a Vietnamese mathematician, Lê Thị Thanh Nhàn. [14] Koblitz is an atheist. [15]

Koblitz's 2007 article "The uneasy relationship between mathematics and cryptography" discusses the increased contact between mathematics and cryptography in the 1990s. He argues that there is an unjustified "aura" placed onto mathematical proofs in cryptographic competitions and received much ire for the view. [16] Koblitz, in co-operation with Alfred Menezes, went on to write a series of Another Look papers that describe errors or weaknesses in existing security proofs, the first being Another look at HMAC (2013). The two now maintain a website dedicated to this type of papers. [17]

In 2011, Koblitz published "Elliptic curve cryptography: The serpentine course of a paradigm shift" with Ann Hibner Koblitz and Alfred Menezes. Using the history of ECC and shifting attitudes in the cryptographic community, the article argues that the field of cryptography is not as scientific and meritocratic as cryptographers want to show to the outside world; the field is controlled by social factors, especially path dependence. [18]

See also

Selected publications

Related Research Articles

Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC allows smaller keys compared to non-EC cryptography to provide equivalent security.

<span class="mw-page-title-main">Sofya Kovalevskaya</span> Russian mathematician (1850–1891)

Sofya Vasilyevna Kovalevskaya, born Korvin-Krukovskaya, was a Russian mathematician who made noteworthy contributions to analysis, partial differential equations and mechanics. She was a pioneer for women in mathematics around the world – the first woman to obtain a doctorate in mathematics, the first woman appointed to a full professorship in northern Europe and one of the first women to work for a scientific journal as an editor. According to historian of science Ann Hibner Koblitz, Kovalevskaya was "the greatest known woman scientist before the twentieth century".

<span class="mw-page-title-main">Jean-Pierre Serre</span> French mathematician

Jean-Pierre Serre is a French mathematician who has made contributions to algebraic topology, algebraic geometry and algebraic number theory. He was awarded the Fields Medal in 1954, the Wolf Prize in 2000 and the inaugural Abel Prize in 2003.

In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of computational methods for investigating and solving problems in number theory and arithmetic geometry, including algorithms for primality testing and integer factorization, finding solutions to diophantine equations, and explicit methods in arithmetic geometry. Computational number theory has applications to cryptography, including RSA, elliptic curve cryptography and post-quantum cryptography, and is used to investigate conjectures and open problems in number theory, including the Riemann hypothesis, the Birch and Swinnerton-Dyer conjecture, the ABC conjecture, the modularity conjecture, the Sato-Tate conjecture, and explicit aspects of the Langlands program.

Scott A. Vanstone was a mathematician and cryptographer in the University of Waterloo Faculty of Mathematics. He was a member of the school's Centre for Applied Cryptographic Research, and was also a founder of the cybersecurity company Certicom. He received his PhD in 1974 at the University of Waterloo, and for about a decade worked principally in combinatorial design theory, finite geometry, and finite fields. In the 1980s he started working in cryptography. An early result of Vanstone was an improved algorithm for computing discrete logarithms in binary fields, which inspired Don Coppersmith to develop his famous exp(n^{1/3+ε}) algorithm.

In mathematics, the Sato–Tate conjecture is a statistical statement about the family of elliptic curves Ep obtained from an elliptic curve E over the rational numbers by reduction modulo almost all prime numbers p. Mikio Sato and John Tate independently posed the conjecture around 1960.

<span class="mw-page-title-main">Serge Lang</span> French-American mathematician

Serge Lang was a French-American mathematician and activist who taught at Yale University for most of his career. He is known for his work in number theory and for his mathematics textbooks, including the influential Algebra. He received the Frank Nelson Cole Prize in 1960 and was a member of the Bourbaki group.

Provable security refers to any type or level of computer security that can be proved. It is used in different ways by different fields.

<span class="mw-page-title-main">J. W. S. Cassels</span> British mathematician

John William Scott "Ian" Cassels, FRS was a British mathematician.

<span class="mw-page-title-main">Ernst Witt</span>

Ernst Witt was a German mathematician, one of the leading algebraists of his time.

Alfred Menezes is co-author of several books on cryptography, including the Handbook of Applied Cryptography, and is a professor of mathematics at the University of Waterloo in Canada.

In number theory, Tunnell's theorem gives a partial resolution to the congruent number problem, and under the Birch and Swinnerton-Dyer conjecture, a full resolution.

Élisabeth Lutz was a French mathematician. The Nagell–Lutz theorem in Diophantine geometry describes the torsion points of elliptic curves; it is named after Lutz and Trygve Nagell, who both published it in the 1930s.[L37]

Pairing-based cryptography is the use of a pairing between elements of two cryptographic groups to a third group with a mapping to construct or analyze cryptographic systems.

<span class="mw-page-title-main">Brian Snow</span> Mathematician, cryptographer

Brian Snow served in the U.S. National Security Agency from 1971 to 2006, including a six-year term as Technical Director of the Information Assurance Directorate (IAD), which is the defensive arm of the NSA, charged with protecting U.S. information security. During his time in research management positions in the NSA, he played a key role in promoting a more open and collaborative relationship between the Agency and the broader community of security professionals.

In mathematics, a p-adic zeta function, or more generally a p-adic L-function, is a function analogous to the Riemann zeta function, or more general L-functions, but whose domain and target are p-adic. For example, the domain could be the p-adic integersZp, a profinite p-group, or a p-adic family of Galois representations, and the image could be the p-adic numbersQp or its algebraic closure.

In mathematics, a p-adic distribution is an analogue of ordinary distributions that takes values in a ring of p-adic numbers.

In mathematics, a p-adic modular form is a p-adic analog of a modular form, with coefficients that are p-adic numbers rather than complex numbers. Serre (1973) introduced p-adic modular forms as limits of ordinary modular forms, and Katz (1973) shortly afterwards gave a geometric and more general definition. Katz's p-adic modular forms include as special cases classical p-adic modular forms, which are more or less p-adic linear combinations of the usual "classical" modular forms, and overconvergent p-adic modular forms, which in turn include Hida's ordinary modular forms as special cases.

Hoàng Xuân Sính is a Vietnamese mathematician, a student of Grothendieck, the first female mathematics professor in Vietnam, the founder of Thang Long University, and a recipient of the Ordre des Palmes Académiques.

Ann Hibner Koblitz is a Professor Emerita of Women and Gender Studies at Arizona State University known for her studies of the history of women in science. She is the Director of the Kovalevskaia Fund, which supports women in science in developing countries.

References

  1. 1 2 Engquist, Björn; Schmid, Wilfried, eds. (2001), Mathematics Unlimited: 2001 and Beyond, Berlin: Springer, p. 1225, ISBN   978-3-540-66913-5
  2. ↑ "Putnam Competition Individual and Team Winners". Mathematical Association of America . Retrieved December 13, 2021.
  3. ↑ Koblitz, Neal (2007), Random Curves: Journeys of a Mathematician, Springer-Verlag, p. 123
  4. ↑ Koblitz, Neal (1981), "Mathematics as Propaganda", in Steen, Lynn Arthur (ed.), Mathematics Tomorrow, Springer Verlag, pp. 111–120, doi:10.1007/978-1-4613-8127-3_12, ISBN   0-387-90564-2
  5. ↑ Krantz, Steven George (2005), Mathematical apocrypha redux, Cambridge University Press, ISBN   0-88385-554-2
  6. ↑ Koblitz, Neal (Winter 1988), "A Tale of Three Equations; or The Emperors Have No Clothes", The Mathematical Intelligencer , 10 (1), New York, NY: 4–10, doi:10.1007/BF03023843, S2CID   121312716
  7. ↑ Koblitz, Neal (Winter 1988), "Reply to Unclad Emperors", The Mathematical Intelligencer , 10 (1), New York, NY: 14–16, doi:10.1007/BF03023845, S2CID   123030288
  8. ↑ Koblitz, Neal (Spring 1988), "Simon Falls off the Wall", The Mathematical Intelligencer , 10 (2), New York, NY: 11–12, doi:10.1007/bf03028350
  9. ↑ Weintraub, Steven H. (Summer 1988), "Trivial Pseudomathematics", The Mathematical Intelligencer , 10 (3), New York, NY: 3–4, doi:10.1007/bf03026633, S2CID   189883909
  10. ↑ Brown, James Robert (1999), Philosophy of mathematics, Routledge, ISBN   0-415-12275-9
  11. ↑ Koblitz, N. (1987). "Elliptic curve cryptosystems". Mathematics of Computation. 48 (177): 203–209. doi: 10.2307/2007884 . JSTOR   2007884.
  12. ↑ Levchin Prize
  13. ↑ Hickey, Hannah (2007-11-08), Neal Koblitz: Deciphering the cryptographer, University Week
  14. ↑ Nguyen, Ha (March 13, 2012), "Women make their mark in sciences", Việt Nam News .
  15. ↑ Koblitz, Neal. Random Curves: Journeys of a Mathematician. Berlin: Springer Verlag, 2008. Print. "For me, an atheist and an aspiring mathematician..."
  16. ↑ Koblitz, Neal (2007). "The uneasy relationship between mathematics and cryptography". Notices of the AMS. 54: 972–979.
  17. ↑ Neal, Koblitz; Alfred, Menezes. "Another Look at Provable Security". www.math.uwaterloo.ca.
  18. ↑ Koblitz, Ann Hibner; Koblitz, Neal; Menezes, Alfred (May 2011). "Elliptic curve cryptography: The serpentine course of a paradigm shift". Journal of Number Theory. 131 (5): 781–814. doi: 10.1016/j.jnt.2009.01.006 .
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.