Systems and methods using search engines to generate cryptographic keys from erratic physical unclonable functions
US-2022417043-A1 · Dec 29, 2022 · US
US12526128B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12526128-B2 |
| Application number | US-202218702071-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 28, 2022 |
| Priority date | Oct 28, 2021 |
| Publication date | Jan 13, 2026 |
| Grant date | Jan 13, 2026 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A ciphertext comparison method according to an embodiment is performed by a processor in a computing apparatus, and the method includes an operation of segmenting a first ciphertext and a second ciphertext into m part bitstreams (in this instance, m is a natural number satisfying 1<m), respectively; an operation of extracting a value corresponding to a j−1th part bitstream (in this instance, j=i+1, i is a natural number satisfying 0≤i≤m−1) of the first ciphertext and a j−1th part bitstream of the second ciphertext, as a jth intermediate value between a first value and a second value in a first lookup table including the first value and the second value of which Hamming weights are identical; an operation extracting a value corresponding to the jth intermediate value and a j−1th result value, as a jth result value between a third value and a fourth value in a second lookup table including the third value and the fourth value of which Hamming weights are identical; and in a case of j≠m, an operation of repeatedly performing extraction as the jth intermediate value and extraction as the jth result value by increasing J; and in a case of j=m, an operation of outputting an mth result value as a result value of comparison between the first ciphertext and the second ciphertext.
Opening claim text (preview).
The invention claimed is: 1 . A ciphertext comparison method performed by a processor in a computing apparatus, the method comprising: segmenting a first ciphertext and a second ciphertext into m part bitstreams (in this instance, m is a natural number satisfying 1<m), respectively; extracting a value corresponding to a j−1 th part bitstream (in this instance, j=i+1, i is a natural number satisfying 0≤i≤m−1) of the first ciphertext and a j−1 th part bitstream of the second ciphertext, as a j th intermediate value between a first value and a second value in a first lookup table including the first value and the second value of which Hamming weights are identical; extracting a value corresponding to the j th intermediate value and a j−1 th result value, as a j th result value between a third value and a fourth value in a second lookup table including the third value and the fourth value of which Hamming weights are identical; and in a case of j≠m, repeatedly performing extraction as the j th intermediate value and extraction as the j th result value by increasing J; and in a case of j=m, outputting an m th result value as a result value of comparison between the first ciphertext and the second ciphertext. 2 . The method of claim 1 , wherein the segmenting comprises segmenting, based on a predetermined segmentation unit, the first ciphertext and the second ciphertext into m part bitstreams, respectively. 3 . The method of claim 1 , wherein the extracting as the j th intermediate value comprises extracting a value of which an index is identical to a bitstream obtained by concatenating the j−1 th part bitstream of the first ciphertext and the j−1 th part bitstream of the second ciphertext, as the j th intermediate value between the first value and the second value in the first lookup table, and wherein the extracting as the j th result value comprises extracting a value of which an index is identical to a value obtained by concatenating the j th intermediate value and the j−1 th result value, as the j th result value between the third value and the fourth value in the second lookup table. 4 . The method of claim 1 , wherein the first value and the second value are predetermined values indicating whether the j−1 th part bitstream of the first ciphertext and the j−1 th part bitstream of the second ciphertext are identical, and wherein the third value and the fourth value are predetermined values indicating whether the first ciphertext and the second ciphertext are identical. 5 . The method of claim 1 , wherein the j th intermediate value satisfies Equation 2 below, t m p j = T 1 [ C j - 1 C j - 1 ′ ] = { A 1 , if C j - 1 = C j - 1 ′ A 2 , if C j - 1 ≠ C j - 1 ′ [ Equation 2 ] (in this instance, C j−1 denotes the j−1 th part bitstream of the first ciphertext that satisfies C j−1 ∈[0,2 n ), C′ j−1 denotes the j−1 th part bitstream of the second ciphertext that satisfies C′ j−1 ∈[0,2 n ), n denotes a predetermined segmentation unit, A 1 denotes the first value, A 2 denotes the second value, and T 1 [C j−1 ||C′ j−1 ] denotes a value of which an index is C j−1 ||C′ j−1 in the first lookup table). 6 . The method of claim 5 , wherein the j th result value satisfies Equation 3 or Equation 4 below, r j =
Testing cryptographic entity, e.g. testing integrity of encryption key or encryption algorithm · CPC title
Manipulating the length of blocks of bits, e.g. padding or block truncation · CPC title
for power analysis, e.g. differential power analysis [DPA] or simple power analysis [SPA] · CPC title
Countermeasures against side channel or fault attacks · CPC title
Passive attacks, e.g. eavesdropping or listening without modification of the traffic monitored · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.