# data[].attributes.body
1.25
2.Modular aritmetic
3.26
4.Mixed Caesar cipher

# data[].attributes.body
1. 25
2. Modular aritmetic (26-22=4, 30-26=4)
3. 26
4.Mixed Ceaser cipher

# data[].attributes.body
1.25
2. The circle repeats 26 letters.
3.  26*25*24*23.....
4. Mixed Caesar cipher

# data[].attributes.body
1. 25
2. Modular Aritmetic
3. 25*25=676
4. Mixed Caesar cipher

# data[].attributes.body
1. 25
2. Modular
Aritmetic
3.26
4. Mixed Caesar cipher

# data[].attributes.body
1. 25
2. Modular
aritmetic
3.26
4 Mixed Caesar cipher

# data[].attributes.body
1) 25
2) Modular arithmetic
26-22=4
30-26=4
3) 26!
4) Mixed Caesar

# data[].attributes.body
1. 25
2. Modular arithmetic
3. 26
4. Mixed Caesar cipher

# data[].attributes.body
1) 25
2) Modular aritmetic
26-22=4,
30-26=4
3) 26
4)Mixed Caesar

# data[].attributes.body
1) 25
2) modular arithmetic
3) 4.03×10^24
4) mixed caesar

# data[].attributes.body
1) 25
2) Modular aritmetic
(26-22=4, 30-26=4 )
3) 26
4) Mixed Caesar

# data[].attributes.body
1) 25
2) Modular aritmetic
26-22=4
30-26=4
3) 26
4) Mixed caesar

# data[].attributes.body
1) 25
2) Modular arithmetic (30-26=4; -22+26=4)
3) 26
4) Mixed caesar

# data[].attributes.body
Rose Lacroix
1) 25
2)Modular Arithmeric
3)26
4) Mixed caesar

# data[].attributes.body
1) 25
2)modular Arithmetic
3)26
4) Mixed caesar

# data[].attributes.body
1)25
2)There are 26 letters in the alphabet.26-22=4
-22+30=4
-22+30-4=4
Then is Modular Arithmetic 30=4
3)The Mixed Caesar Cipher has maximum  26 letters, 26!= 26x25x24x23x22x…….x3x2x1=403,291,461,126,605,635,548,000,000 attempts to break this cipher.
4)Mixed Caesar

# data[].attributes.body
1) 25
2) Modular Arithmetic
3)26!
4)Mixed Caesar

# data[].attributes.body
1) 25
2) Modular Arithmetic
3) 26
4) Mixed Caesar

# data[].attributes.body
1) 25
2) Modular Arithmetic
3) 26!
4) Mixed Caesar

# data[].attributes.body
1)25
2)Modular Arithmetic
3)26
4)Mixed Caesar

# data[].attributes.body
1)25
2)Modular Arithmetic
3)26
4)Mixed Caesar.

# data[].attributes.body
1) Depending on the language somewhere between 20-74 times. Generally, it's easy to brute-force a pure Caesar cypher.
2) Because keys lower than 0 and greater than the number of letters in the alphabet wrap around, so (using the English alphabet)
30 > 26, therefore it wraps back around to 4 because 30 - 26 = 4; -22 < 0, -22 + 26 = 4. This wrap around concept is known as modular arithmetic.
3) A mixed cypher is way harder to
brute-force, but it's still technically possible: we just need to take into account all possible configurations of letters with no repeating letters . Let's go (presuming we're using the English alphabet): 26 * 25 * 24 * ... * 2 * 1=  403291461120000000000000000 or 4 hundred SEPTILLION different combinations. So, uh, good luck searching through all those.
4) Mixed, definitely.

# data[].attributes.body
1. 25
2. Modular arithmetic (30-26=4, -22+26=4)
3. It's impossible to find because we don't know the key word so we don't know what the first couple of letters in the alphabet were substituted with
4. Mixed ceasar

# data[].attributes.body
1)25
2)Modular Arithmetic
3)26
4)Mixed Caesar

# data[].attributes.body
1) 25
2) Because it's repeat a Modular Arithmetic
3) 26
4) Mixed Caesar.

# data[].attributes.body
1. 26 letters → 1 plain letter → 25 other ciphered letters can change it

2.   Modular arithmetic (-22 + 26 = 4; 4 + 26 = 30)

3.   It is almost impossible to find encrypted text

4.   Mixed Ceasar

# data[].attributes.body
1) 25
2) Modular arithmetic
3) 26
4) Mixed caesar

# data[].attributes.body
1. 25
2. Modular arithmetic
3. 26
4. Mixed Caesar

# data[].attributes.body
1)25
2) Modular Arithmetic
3) 26
4) Mixed Caesar

# data[].attributes.body
1)25
2)Modular Arithmetic
3)26
4)Mixed Caesar

# data[].attributes.body
1) 25
2) Modular Arithmetic
3) 26
4) Mixed Caesar

# data[].attributes.body
1)25
2)Modular Arithmetic
3)26
4)A mixed Caesar

# data[].attributes.body
1)25
2)The alphabet we are using has 26 letters so key 4 would mean code has shifted for four letters, key 30 and -22 mean the same since 30-26=4 and 26-22=4.
3) 26
4) Mixed Caesar

# data[].attributes.body
1)25
2 Modular Arithmetic
3)26
4) A mixed caesar

# data[].attributes.body
A). 25
B).Modular Arithmetic
3). 26
4). Mixed Caesar

# data[].attributes.body
1)25
2)Modular Arithmetic
3)26
4)Mixed Caesar

# data[].attributes.body
1) 25
2) Modular Arithmetic
3) 26
4) Mixed Caesar

# data[].attributes.body
1) 25
2) Because it is repeated / Modular
Arithmetic
3) 26
4) Mixed Caesar

# data[].attributes.body
1) 25 attempts
2) Those keys are repeated due to the fact that their value will always represent the letter on that position and that the keys with values ​​greater than 25
will represent the same letters that can be represented by values ​​less than 25, and if the row ends, it will be taken from its beginning again
3)
26 to the 7th power (26 symbols and can be entered only 7 symbols )
4) Mixed Caesar - ( we need to find the key which is a word )

# data[].attributes.body
1)2
2)
3)3
4)MixedCaesar