IP Library Granted Patent US 12,355,863
Granted Patent B2
US 12,355,863 · App. 17/634,732 · Granted Jul 8, 2025

Round-free cryptographic hashing device for secure and low-latency communications

Inventor: Fereydoun Farrahi Moghaddam (Brossard, CA)
Assignee: Telefonaktiebolaget LM Ericsson (publ)
H04L9/0643H04L2209/12
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,355,863
App. No.
17/634,732
Granted
Jul 8, 2025
Kind
B2
Abstract

A hashing circuit includes gates or combinations of gates, each being configured to asynchronously output a state value in response to a respective input to the gate or combination of gates. Each of a plurality of bit inputs is asynchronously coupled to one or more of the inputs to the gates or combinations of gates, and each of one or more of the outputted state values is asynchronously coupled to one or more inputs of other gates or combinations of gates, in combination with one or more of the bit inputs and/or one or more other outputted state values. All or some of the state values, or output bits from a logical function of all or some of the state values, or a combination of a first subset of the state values and a logical function of a second subset of state values, are provided as hash-circuit output bits.

Claims (64)

1. A hashing circuit for generating hash-circuit output bits from hash-circuit input bits, the hashing circuit comprising:

a plurality of gates or combinations of gates, each gate or combination of gates being configured to asynchronously output a state value in response to a respective input to the gate or combination of gates; and

a plurality of bit inputs coupled to the hash-circuit input bits,

wherein each of the bit inputs is asynchronously coupled to one or more of the inputs to the gates or combinations of gates, wherein the asynchronously coupled bit inputs indicates that the coupling of the plurality of bit inputs includes no intervening clocked circuit elements,

wherein each of one or more of the outputted state values is asynchronously coupled to one or more inputs of other gates or combinations of gates, in combination with one or more of the bit inputs and/or one or more other outputted state values,

wherein all or a subset of the state values, or output bits from a logical function of all or a subset of the state values, or a combination of a first subset of the state values and a logical function of a second subset of state values, are provided as hash-circuit output bits, and

wherein the one or more outputted state values are determined from the one or more of the inputs according to a function of the form:

Output

=

f

(

Input

)

=

{

1

Input

<

.5

0

Input

.5

}

.

2. The hashing circuit of claim 1 , wherein each of one or more of the gates is an electrical NOT gate.

3. The hashing circuit of claim 1 , wherein each of one or more of the gates is a photonic gate.

4. The hashing circuit of claim 1 , wherein the hashing circuit has fewer hash-circuit output bits than state values output by the gates or combinations of gates.

5. The hashing circuit of claim 1 , wherein the bit inputs are coupled to the hash-circuit input bits via a latching circuit configured to selectively capture and hold values of the hash-circuit input bits during a hashing operation.

6. A wireless communication device, comprising:

a radio circuitry configured for communication with a wireless network and/or one or more other wireless communication devices;

a hashing circuit; and

processing circuitry operatively coupled to the radio circuitry and the hashing circuit and configured to use the hashing circuit for one or more hashing operations,

wherein the hashing circuit comprising:

a plurality of gates or combinations of gates, each gate or combination of gates being configured to asynchronously output a state value in response to a respective input to the gate or combination of gates; and

a plurality of bit inputs coupled to the hash-circuit input bits,

wherein each of the bit inputs is asynchronously coupled to one or more of the inputs to the gates or combinations of gates, wherein the asynchronously coupled bit inputs indicates that the coupling of the plurality of bit inputs includes no intervening clocked circuit elements,

wherein each of one or more of the outputted state values is asynchronously coupled to one or more inputs of other gates or combinations of gates, in combination with one or more of the bit inputs and/or one or more other outputted state values,

wherein all or a subset of the state values, or output bits from a logical function of all or a subset of the state values, or a combination of a first subset of the state values and a logical function of a second subset of state values, are provided as hash-circuit output bits, and

wherein the one or more outputted state values are determined from the one or more of the inputs according to a function of the form:

Output

=

f

(

Input

)

=

{

1

Input

<

.5

0

Input

.5

}

.

7. The wireless communication device of claim 6 , wherein each of one or more of the gates is an electrical NOT gate.

8. The wireless communication device of claim 6 , wherein each of one or more of the gates is a photonic gate.

9. The wireless communication device of claim 6 , wherein the hashing circuit has fewer hash-circuit output bits than state values output by the gates or combinations of gates.

10. The wireless communication device of claim 6 , wherein the bit inputs are coupled to the hash-circuit input bits via a latching circuit configured to selectively capture and hold values of the hash-circuit input bits during a hashing operation.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 11, 2022
From: FARRAHI MOGHADDAM, FEREYDOUN
To: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Reel/Frame 058990/0838 →
Continuity (1)
Related Publication 20220278823A1 · Sep 1, 2022
References Cited (49)
US 4327985A · Urushihara · 1982 [cited by examiner]
US 6334190B1 · Silverbrook · 2001 [cited by examiner]
US 6745331B1 · Silverbrook · 2004 [cited by examiner]
US 7249108B1 · Walmsley · 2007 [cited by examiner]
US 8045706B2 · Liu · 2011 [cited by applicant]
US 8359346B2 · Grayson · 2013 [cited by examiner]
US 8447988B2 · Alekseev · 2013 [cited by examiner]
US 8452006B2 · Alekseev · 2013 [cited by examiner]
US 9407276B1 · Coban · 2016 [cited by examiner]
US 9529569B2 · Miller · 2016 [cited by examiner]
US 9553881B2 · Costantini · 2017 [cited by examiner]
US 9632782B2 · Yap · 2017 [cited by examiner]
US 9780868B2 · Costantini · 2017 [cited by examiner]
US 9960909B2 · Karighattam · 2018 [cited by examiner]
US 10038550B2 · Gopal · 2018 [cited by examiner]
US 10103738B2 · Ek · 2018 [cited by examiner]
US 10110238B2 · Ek · 2018 [cited by examiner]
US 10164772B2 · Ciet · 2018 [cited by examiner]
US 10177748B2 · Bagger · 2019 [cited by examiner]
US 10491377B2 · Alakuijala · 2019 [cited by examiner]
US 10790808B2 · Mu · 2020 [cited by examiner]
US 10833847B2 · Wassenberg · 2020 [cited by examiner]
US 10922465B2 · Baratam · 2021 [cited by examiner]
US 10944568B2 · Hars · 2021 [cited by examiner]
US 11895241B2 · Schnabel · 2024 [cited by examiner]
US 11895636B2 · Andgart · 2024 [cited by examiner]
US 20040049468A1 · Walmsley · 2004 [cited by examiner]
US 20040260740A1 · Liu · 2004 [cited by examiner]
US 20080107273A1 · Munro · 2008 [cited by examiner]
US 20100278331A1 · Walker · 2010 [cited by examiner]
US 20120201373A1 · Hua · 2012 [cited by examiner]
US 20140177837A1 · Zubairy · 2014 [cited by examiner]
US 20170154924A1 · Johnson · 2017 [cited by examiner]
US 20170345505A1 · Noel · 2017 [cited by examiner]
US 20170353185A1 · Peterson · 2017 [cited by examiner]
US 20190050347A1 · Bolotov · 2019 [cited by examiner]
US 20200213126A1 · Schnabel · 2020 [cited by examiner]
US 20200344084A1 · Shribman · 2020 [cited by examiner]
US 20200358805A1 · Segal · 2020 [cited by examiner]
US 20200358858A1 · Shribman · 2020 [cited by examiner]
EP 1782181B1 · 2010 [cited by applicant]
PCT International Search Report and Written Opinion mailed Apr. 23, 2020 for International Application No. PCT/IB2019/057353, 10 pages. [cited by applicant]
McLoone, M. et al., “High-Speed & Low Area Hardware Architectures of the Whirlpool Hash Function”, Journal of VLSI Signal Processing, vol. 47, No. 1, Northern Ireland, UK, Nov. 13, 2006, XP019509445, 11 pages. [cited by applicant]
Hoang, A-T et al., “Pipelining a Multi-Mode SHA-384/512 Core with High Area Performance Rate”, IEICE Transactions on Information & Systems, vol. E92-D, No. 10, Oct. 10, 2009, XP001553370, 9 pages. [cited by applicant]
Hannig, F. et al., “Parallelization Approaches for Hardware Accelerators-Loop Unrolling Versus Loop Partitioning”, International Conference on Financial Cryptography and Data Security, Springer, Berlin, Heidelberg, Mar.… [cited by applicant]
Wikipedia, “Cryptographic Hash Function”, web link: https://en.wikipedia.org/wiki/Cryptographic_hash_function, May 2016, 13 pages. [cited by applicant]
Wikipedia, “Comparison of Cryptographic Hash Functions”, web link: https://en.wikipedia.org/wiki/Comparison_of_cryptographic_hash_functions, 5 pages. [cited by applicant]
Wikipedia, “SHA-2”, National security Agency, web link: https://en.wikipedia.org/wiki/SHA-2, 2001, 8 pages. [cited by applicant]
Zhang, Y. et al., “High Performance and Low Power Hardware Implementation for Cryptographic Hash Functions”, Hindawi Publishing Corporation, International Journal of Distributed Sensor Networks, vol. 2014, Article ID 73… [cited by applicant]
Cited By (1)
US 12,561,486