Enigma-like cipher: variable rotor stepping

I'm writing an enigma-like cipher w/five rotors where adjacent rotors
rotate opposite direction of their neighbors and they have variable
stepping in which they step a number of times equal to the position of
the character they're on plus one, starting from zero, ie. in FOOD, F's
position would be zero, and the rotors would step once, on O they would
step twice, etc. Keeping w/ the fact that the first rotor would step
after every character, the second rotor would step when the first one
stepped 36 times,etc. How much more security would that give me over a
normal three rotor machine.

.

Relevant Pages

  • Re: Mathematics of the Enigma cipher?
    ... A character is mapped to an integer which becomes ... All the Rotors should be advanced ... char val3=R2.GetCharacterIndex; ... I thought the Reflector was fixed. ...
    (comp.programming)
  • Re: Mathematics of the Enigma cipher?
    ... A character is mapped to an integer which becomes ... All the Rotors should be advanced ... char val3=R2.GetCharacterIndex; ... I thought the Reflector was fixed. ...
    (comp.programming)
  • Re: Enigma-like cipher: variable rotor stepping
    ... the character they're on plus one, starting from zero, ie. in FOOD, F's ... position would be zero, and the rotors would step once, on O they would ... appropriate for encryption. ... char val3=R2.GetCharacterIndex; ...
    (sci.crypt)
  • Re: Enigma-like cipher: variable rotor stepping
    ... the character they're on plus one, starting from zero, ie. in FOOD, F's ... position would be zero, and the rotors would step once, on O they would ... appropriate for encryption. ... char val3=R2.GetCharacterIndex; ...
    (sci.crypt)
  • Re: Enigma-like cipher: variable rotor stepping
    ... the character they're on plus one, starting from zero, ie. in FOOD, F's ... position would be zero, and the rotors would step once, on O they would ... appropriate for encryption. ... char val3=R2.GetCharacterIndex; ...
    (sci.crypt)