Host Processor Precomputation for ITS ECDSA Verification

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The computational complexity of Elliptic Curve Digital Signature Algorithm (ECDSA) verification in intelligent transportation systems (ITS) limits the number of messages that can be processed and verified, particularly due to the high number of modular multiplications and reductions required, which is a bottleneck in V2X communication systems.

Innovation Solution

Implementing a host processor with precomputation capabilities to store and reuse data for frequently encountered ITS stations, reducing the computational load by precomputing elliptic points and scalar values, allowing for accelerated verification of subsequent messages from the same station.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If ECDSA verification is performed using standard computational methods, then verification accuracy is maintained, but verification speed is limited due to high computational complexity

Engineering Contradiction:
Improveverification speedVSAvoidcomputational complexity
Core Design Contradiction:
SpeedVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by precomputing elliptic curve points and storing them in lookup tables before verification operations. The host processor precomputes scalar multiplications of elliptic curve points and stores results in memory, so that during message verification, these precomputed values can be directly retrieved and combined, significantly reducing the computational complexity and time required for each verification operation.

Inventive Principle:
Principle #10Preliminary action

2Productivity

If more messages are verified per second, then system productivity increases, but computational resources are overwhelmed

Engineering Contradiction:
Improvemessages processed per secondVSAvoidcomputational resource consumption
Core Design Contradiction:
ProductivityVSUse of energy by moving object

Solution Approach 1:

The patent applies copying by creating precomputed copies of elliptic curve point multiplications and storing them in lookup tables. Instead of performing computationally intensive scalar multiplications during each message verification, the host processor retrieves precomputed copies of these values from memory, enabling rapid verification of multiple messages per second with minimal computational resource consumption.

Inventive Principle:
Principle #26Copying

3Speed

If specialized hardware accelerators are used for ECDSA verification, then verification speed increases, but device complexity and cost increase

Engineering Contradiction:
Improveverification speedVSAvoidhardware complexity
Core Design Contradiction:
SpeedVSDevice complexity

Solution Approach 1:

The patent applies universality by implementing ECDSA verification acceleration using a general-purpose host processor combined with precomputed lookup tables in standard memory, rather than requiring specialized hardware accelerators. The same host processor that runs the operating system and application logic can perform cryptographic verifications by retrieving precomputed values from memory, making the system both fast and versatile without adding dedicated cryptographic hardware.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS11057396B2Intelligent transportation system station, host processor, and method therefor
Publication Date: 2021.07.06 NXP BV
  • US11057396B2 patent drawing
  • US11057396B2 patent drawing
  • US11057396B2 patent drawing

AI summary

An intelligent transportation system, ITS, station (600) comprising: a host processor (640); and a memory (664) operably coupled to the host processor (640). The host processor (640) is configured to: perform verification per identity that includes precomputation of data for a plurality of neighbouring ITS stations of the ITS station (600); store precomputation data for the verified identity of the plurality of neighbouring ITS stations in the memory (664); and extract from memory (664) and use the stored precomputation data for a respective neighbouring ITS station to perform an accelerated verification of a subsequent message received from that neighbouring ITS station.