PATENT CLAIM ANALYSIS

Application Number: 16253911
Application Type: Utility
Filing Date: 2019-01
Publication Date: 2019-07
Patent Classification: ["713", "171000"]

Abstract:
Generally ciphers project a fixed measure of security, defined by the complexity of their algorithms. Alas, threat is variable, and should be met with matching security. It is useless to project insufficient security, and it is wasteful and burdensome to over-secure data. Advanced BitFlip comes with threat-adjustable flexibility, established via: (i) smart decoy strategy, (ii) parallel encryption, (iii) uniform letter frequency adjustment—tools which enable the BitFlip user to (a) adjust its ciphertexts to match the appraised threat, and (b) sustain security levels for aging keys. The use of these threat-adjusting tools may be automated to allow (1) AI engines to enhance the security service of the cipher, and (2) to enable remote hard-to-access IoT devices to keep aging keys useful, and preserve precious energy by matching security to the ad-hoc threat level. BitFlip may also be operated in a zero-leakage mode where no attributes of a conversation are disclosed, up to full steganographic levels. BitFlip security is two-dimensional: intractability and equivocation, both may be conveniently increased to meet quantum cryptanalytic attacks.

Claim (Index 1):
A method for using a substitution cipher where each letter a i  of the used alphabet A: {a 1 , a 2 , . . . . a t } is substituted with an n-bits long bit string, c i , such that the Hamming distance between it and a secret n-bits string is is a secret integer f i  where 0\u2264f i \u2264n: H(c i , k i )=f i , and such that for all other letters a j  in A where a i \u2260a j  it holds that the Hamming distance between c i  and k j  is not equal to f j , where f j  is a secret integer, 0\u2264f j \u2264n associated with a j , and k j  is a secret n-bits long string representing a j in A: H(c i , k j )\u2260f j ; the t strings k 1 , k 2 , . . . k t  together with the t integers f 1 , f 2 , . . . . f t  comprise the secret cipher key.

Metadata:
- Claim Count in Document: 7.0
- Percentile: 99.0
- Lexical Diversity: 1.70248
- Patent Class: 713.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['13482902', '12656897', '12656901', '12958300', '12318404']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3673871078083414
- 35 USC 102 Novelty (BERT): 0.4922659980960301
- Combined Prediction Score: 0.3798749968371103
- Mean Citation Score: 179.939524
- Max Citation Score: 187.04697
- Similarity Product: 133.2405809995991

Labels:
- Claim Label 101: 1
- Claim Label 102: 0
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 1

Dataset: test