##### Special-purpose chip reduces power consumption of public-key encryption by 99.75 percent, increases speed 500-fold. Most sensitive web transactions are protected by public-key cryptography, a type of encryption that lets computers share information securely without first agreeing on a secret encryption key.

Public-key encryption protocols are complicated, and in computer networks, they’re executed by software. But that won’t work in the internet of things, an envisioned network that would connect many different sensors — embedded in vehicles, appliances, civil structures, manufacturing equipment, and even livestock tags — to online servers. Embedded sensors that need to maximize battery life can’t afford the energy and memory space that software execution of encryption protocols would require.

MIT researchers have built a new chip, hardwired to perform public-key encryption, that consumes only 1/400 as much power as software execution of the same protocols would. It also uses about 1/10 as much memory and executes 500 times faster. The researchers describe the chip in a paper they’re presenting this week at the International Solid-State Circuits Conference.

Like most modern public-key encryption systems, the researchers’ chip uses a technique called elliptic-curve encryption. As its name suggests, elliptic-curve encryption relies on a type of mathematical function called an elliptic curve. In the past, researchers — including the same MIT group that developed the new chip — have built chips hardwired to handle specific elliptic curves or families of curves. What sets the new chip apart is that it is designed to handle any elliptic curve.

“Cryptographers are coming up with curves with different properties, and they use different primes,” says Utsav Banerjee, an MIT graduate student in electrical engineering and computer science and first author on the paper. “There is a lot of debate regarding which curve is secure and which curve to use, and there are multiple governments with different standards coming up that talk about different curves. With this chip, we can support all of them, and hopefully, when new curves come along in the future, we can support them as well.”

Joining Banerjee on the paper are his thesis advisor, Anantha Chandrakasan, dean of MIT’s School of Engineering and the Vannevar Bush Professor of Electrical Engineering and Computer Science; Arvind, the Johnson Professor in Computer Science Engineering; and Andrew Wright and Chiraag Juvekar, both graduate students in electrical engineering and computer science.

**Modular reasoning**

To create their general-purpose elliptic-curve chip, the researchers decomposed the cryptographic computation into its constituent parts. Elliptic-curve cryptography relies on modular arithmetic, meaning that the values of the numbers that figure into the computation are assigned a limit. If the result of some calculation exceeds that limit, it’s divided by the limit, and only the remainder is preserved. The secrecy of the limit helps ensure cryptographic security.

One of the computations to which the MIT chip devotes a special-purpose circuit is thus modular multiplication. But because elliptic-curve cryptography deals with large numbers, the chip’s modular multiplier is massive. Typically, a modular multiplier might be able to handle numbers with 16 or maybe 32 binary digits, or bits. For larger computations, the results of discrete 16- or 32-bit multiplications would be integrated by additional logic circuits.

The MIT chip’s modular multiplier can handle 256-bit numbers, however. Eliminating the extra circuitry for integrating smaller computations both reduces the chip’s energy consumption and increases its speed.

Another key operation in elliptic-curve cryptography is called inversion. Inversion is the calculation of a number that, when multiplied by a given number, will yield a modular product of 1. In previous chips dedicated to elliptic-curve cryptography, inversions were performed by the same circuits that did the modular multiplications, saving chip space. But the MIT researchers instead equipped their chip with a special-purpose inverter circuit. This increases the chip’s surface area by 10 percent, but it cuts the power consumption in half.

The most common encryption protocol to use elliptic-curve cryptography is called the datagram transport layer security protocol, which governs not only the elliptic-curve computations themselves but also the formatting, transmission, and handling of the encrypted data. In fact, the entire protocol is hardwired into the MIT researchers’ chip, which dramatically reduces the amount of memory required for its execution.

The chip also features a general-purpose processor that can be used in conjunction with the dedicated circuitry to execute other elliptic-curve-based security protocols. But it can be powered down when not in use, so it doesn’t compromise the chip’s energy efficiency.

“They move a certain amount of functionality that used to be in software into hardware,” says Xiaolin Lu, director of the internet of things (IOT) lab at Texas Instruments. “That has advantages that include power and cost. But from an industrial IOT perspective, it’s also a more user-friendly implementation. For whoever writes the software, it’s much simpler.”

Learn more: Energy-efficient encryption for the internet of things

##### The Latest on: Elliptic-curve encryption

*via Google News*

##### The Latest on: Elliptic-curve encryption

- Blockchain latest news: a state-owned quantum computer could break blockchains in as little as three yearson November 26, 2019 at 8:26 am
A commercially viable quantum computer is still probably a decade away but the first rudimentary, state-owned device capable of breaking common public key encryption algorithms like RSA and elliptic ...

- Has the quantum crypto break already happened?on November 26, 2019 at 5:39 am
Ever since Peter Shor released a quantum algorithm in 1994 that proved quantum computers with enough quantum bits (qubits) could easily break most popular public key cryptography (e.g., RSA, ...

- elliptic curve cryptographyon October 23, 2019 at 5:00 pm
In addition to the primer article, so far they have covered the Diffie-Hellman exchange (using prime numbers, exponentiation and modular arithmetic) and the evolution of this exchange using elliptic ...

- Elliptic Curve Cryptography (ECC) for range of applicationson October 20, 2019 at 5:00 pm
No portion of this site may be copied, retransmitted, reposted, duplicated or otherwise used without the express written permission of Design And Reuse.

- Google Supercomputer Could Break Bitcoin Encryption In Seconds, Crypto At Riskon October 4, 2019 at 4:38 am
Will Google supercomputers land a deathblow to bitcoin and the rest of the crypto industry? Last month, Google revealed in a scientific paper that it was able to develop quantum computers that could ...

- Quantum-Resistant Cryptography: Our Best Defense Against An Impending Quantum Apocalypseon September 25, 2019 at 4:33 am
and elliptic-curve cryptography (ECC)-based encryption, today’s most common encryption types. If the industry does not adapt, it risks leaving the door open to widespread compromise. The systems that ...

- Cryptographic security and the quantum apocalypseon September 9, 2019 at 2:13 am
Elliptic Curve Cryptography works by finding two points on an elliptic curve that intersect perfectly to ‘unlock’ an encrypted asset. Solving for two points in this curve is likewise difficult for ...

- How the United States Is Developing Post-Quantum Cryptographyon September 6, 2019 at 11:26 am
This category also includes public-key encryption algorithms—such as RSA and Elliptic Curve cryptography—that do the same thing, but are less efficient. A second category involves algorithms for ...

- Dr. Neal Koblitz: Independent Co-creator of Elliptic Curve Cryptographyon July 13, 2019 at 11:44 am
Neal Koblitz and Victor Miller independently co-discovered elliptic-curve cryptography. In this interview with Dr. Koblitz, we learn about his life and passion for mathematics. You might love math.

- Announcing our own Elliptic Curve Cryptography in Solidityon July 8, 2019 at 4:04 am
Recently Gorka Irazoqui Apecechea and me proudly published an Elliptic Curve Cryptography Solidity library as open source project under the MIT license. But, why have we implemented our own crypto ...

*via Bing News*