Beaufort Cipher Tool

Apply Beaufort explicit uppercase key convention. Classical educational encoding only; not secure encryption, no hidden normalization or inferred key.

Description

Beaufort subtracts message indices from repeated key indices modulo twenty-six.

Beaufort subtracts message indices from repeated key indices modulo twenty-six.1

Its reciprocal historical transformation differs from variant Beaufort's reversed subtraction. Use Beaufort Cipher Tool to evaluate the supplied inputs under the specific model below.

When to use Beaufort Cipher Tool

Use Beaufort Cipher Tool to evaluate the supplied inputs under the specific model below. Choose the intended encoding, alphabet or check and keep the exact character, key and measurement conventions described below.

How to use Beaufort Cipher Tool and understand its results

  1. Choose the intended encoding, alphabet or check and keep the exact character, key and measurement conventions described below.
  2. Enter Text, Key using the field table and validation rules below, then run the tool.
  3. Read Encoded and interpret units, signs, ordering and placeholders as explained below.
  4. If the tool reports an input error, correct that field and rerun. A successful false result, empty match list or unknown-evidence placeholder has the specific meaning described here; check the limitations before applying the result.
Input fieldMeaningValue typeRequirement
textTextstringRequired; constraints below
keyKeystringRequired; constraints below

Enter uppercase A–Z text and a nonempty uppercase A–Z key, each at most 4096 characters. Repeat the key, subtract each text value from its key value modulo 26 and return uppercase output. The operation is reciprocal, accepts empty text and performs no case conversion or punctuation stripping.

output[i] = (key[i mod keyLength]−text[i]) mod 26

Field order, units and branch conditions follow the implementation explanation above.

Output fieldMeaningValue type
encodedEncodedstring
json
{
  "input": {
    "text": "ABC",
    "key": "BCD"
  },
  "output": {
    "encoded": "BBB"
  }
}

Limitations and assumptions

Its reciprocal historical transformation differs from variant Beaufort's reversed subtraction. Apply the exact scope and assumptions described above.

All listed fields require explicit values. Unexpected fields, incorrect types, nonfinite numbers and sparse arrays fail validation. Domain-specific bounds, alignments and supported tokens are stated above; extremely large inputs or outputs can also be rejected. These errors differ from successful results such as false, no matches or unknown evidence.

This educational transformation or format check does not establish modern cryptographic confidentiality, authentication or key security.

Alternative or Complementary methods

Use Variant Beaufort Cipher Tool for a related task: Variant Beaufort subtracts repeated key letters from plaintext letter indices.

Use Porta Cipher Tool for a related task: Porta substitution pairs key letters and swaps between alphabet halves.

References

  1. Beaufort Cipher Tool — tool.io

Similar or alternative tools

Don't forget to set a bookmark for tool.io!
Privacy | Imprint | Cookies