This post is about providing a Dynamic CVV, which allows a credit card or a debit card to be used even in an unsecured network environment, without using OTP. This plan can be used across any platform that deals with ultra-safe cash vaults or similar platforms like entry to a secured building, which may be under malicious surveillance. This can also be used to recover lost passwords in e-mails or any other online platform that uses username/password credentials. It can also be simply used to enter those sites with Dynamic passwords every time.
Need for Dynamic CVV
If you are using a debit card or credit card, there will be a CVV printed on the back of the card, which needs to be given as input to process your credit/debit card transaction. If an intruder gets hold of the card details and the CVV through phishing, he will be able to impersonate you and use your credit/debit card details to siphon off your money. In this article, we are providing a method through which the credit card or debit card user enters a Dynamic CVV, which will change every time he uses the card to perform online transactions. This will make phishing ineffective and useless because the intruder has to provide a new Dynamic CVV every time, which is known only to the credit/debit card user.
Need for Dynamic passcode for Cash Vaults
In Cash Vaults and Safes, there is a more urgent need to use a Dynamic passcode, because it cannot send OTP to the Cash Vault user. If the Cash Vault user uses the same passcode every time to enter the Cash Vault, it will give rise to vulnerabilities such as malicious surveillance by an intruder, who may get hold of the passcode to enter the Cash Vault.
Need for Dynamic password in recovering e-mail and online platforms
Suppose an email user loses his password credentials, he can use the Dynamic password generated from the below-explained method ( which is the subject of this article ), to enter his email and reset the password. Or he can simply use the Dynamic password generated every time to log into his email platform. Similarly, he can use it on any other online platform which requires username and password credentials to log in.
Usage of Dynamic CVV in Credit/Debit Cards
To generate a Dynamic CVV, the credit/debit card user has to enter the details of the card and wait for the website to give you two numbers. They are six-digit numbers each. One is a randomly generated six-digit Dynamic Cipher and the other is a six-digit Timestamp (HH:MM:SS) sent by the online credit/debit card platform. With those numbers, we need to calculate a Dynamic CVV which is a three-digit number, and enter it in the Dynamic CVV field. The calculation is to be performed manually by the Credit/Debit card user based on methods that will be given to the Credit/Debit user ( Account holder ) when he applies for a card.
The Account holder can also receive a CD with software, which automatically calculates the Dynamic CVV, every time he needs it when he feeds the six-digit Dynamic Cipher and Timestamp into the software in the CD. This software needs to be installed only in a secured system like your home PC, otherwise, it will jeopardize the whole purpose.
This process can be done by giving two options to the Credit/Debit card user. One is Simplified Manually Generated Dynamic CVV, which requires simple calculations and has to be manually calculated by the Credit/Debit Card user. Another is Computer Generated Dynamic CVV, which requires complex calculations and can be done only by Software on Personal Computers. The Credit/Debit card user can use any of the two choices whenever he wants, by choosing the option on the online website. Simplified Manually Generated Dynamic CVV is for unsecured network environments like browsing centers. Computer-Generated Dynamic CVV is for secured network environments like home PCs.
Usage of Dynamic Passcode in Cash Vaults
This method is more pronounced in present times since Cash Vaults are stand-alone systems and cannot send OTPs to mobile phones. Here the Cash Vault is pre-programmed with a set of parameters and calculations. Here also the Cash Vault generates two six-digit numbers, Dynamic Cipher and Timestamp (HH:MM:SS). The Cash Vault maker will give an App( even offline) that can be accessed by employees in Banks or other officials in Casinos, who will enter the Dynamic Cipher and Timestamp in the App and the App will generate a three-digit Passcode. This three-digit Passcode needs to be punched into the keyboard of the Cash Vault to get entry access to the Vault. Since this App generates a new Dynamic Passcode every time you enter, looking over the shoulder or having malicious Surveillance cameras will not give fruition. This method can be extended to every cash box inside the Cash Vaults in a bank.
Usage of Dynamic Password in email recovery and online authentication
This process of using a Dynamic password can be applied to scenarios where the email user has forgotten his password. Instead of asking questions to verify his identity, the email user can be asked to input a Dynamic password which is a three-digit number, calculated from the six-digit Dynamic Cipher and six-digit Timestamp. This three-digit Dynamic password can be calculated manually from the method given to the email user when he created the email account. This method needs to be kept as a hard copy, to use in case of recovery. You can even take a printout of this document in an unsecured environment like a browsing center because to calculate the Dynamic Password, you need a User key and the User Name, which will not be part of the document. Also, You can simply use a Dynamic password every time to log in to your email in case you keep your mail for important transactions. Online platforms can also provide their own processes.
Basics of the process
The process of calculating involves feeding the input of the process with Dynamic Cipher and Timestamp and using the process given to the User to calculate the Dynamic CVV, Passcode or Password. To calculate them, the User will possess a User Key which will be given along with the process document. The User has to follow the steps in the process document and find the Dynamic CVV, Passcode, and Password after calculating the steps one by one. The calculating process changes from one User to another User and there are more than a trillion different ways of calculating processes even with a few basic different process methods in between them to calculate the output. That makes this process robust because only through the brute force method we can calculate the process and the key and it involves an innumerable number of calculations.
The process of calculating Dynamic CVV, Dynamic Passcode, and Dynamic Password
The process involves four steps
Find a three-digit Dynamic Key ( which always changes every time you create a Dynamic CVV, Passcode or Password ), from the three-digit User Key ( which is constant for a User, is given along with the process steps document ). The Dynamic Key is generated from the Timestamp and the User Key by a process, which will be explained below.
Simply put : Find Dynamic Key from User Key and Timestamp.
Process Method A [ It's a method, that changes from User to User( as given in the process document ), and which processes Dynamic Cipher using Dynamic Key ( generated in the above step ) and creates another output Dynamic Cipher, which is fed to the next Method B as the new Dynamic Cipher ].
Simply put : Process Dynamic Cipher
Process Method B [ It's another method, which calculates another Dynamic Cipher from the input got from the Process Method A, using the same Dynamic Key generated from Step 1].
Simply put : Process Dynamic Cipher again
Pick Digits for Dynamic CVV, Dynamic Passcode and Dynamic Password from the Dynamic Cipher derived from Process Method B.
Simply put : Pick digits from Dynamic Cipher
Step 1
Finding Dynamic Key from Timestamp and User Key
There are innumerable number of ways by which we can perform the above step. We will take three examples to calculate the Dynamic Key.
Example 1:
User Key : 125
Timestamp : 23:12:36 ( HH:MM:SS)
Basic calculation rules : Always take the ones place of a number if the result is multiple digit and you need only one digit output.
Method :
If First digit of User Key is present in HH ( hours ), then [ Add 5 else Add 9 ] to HH
If Second digit of User Key is present in MM ( Minutes ), then [ Add 6 else Add 3 ] to MM
If Third digit of User Key is present in SS ( Seconds ), then [ Add 2 else Add 1 ] to SS
Calculation:
Take 1, 2 and 5 from the User Key
First digit of User key ( 1 ) is not present in HH ( 23 ). So Add 9 to HH( 23 )
9 + 23 = 32, Take one’s place ( 2 )
Second digit of User key ( 2 ) is present in MM ( 12 ). So Add 6 to MM ( 12 )
6 + 12 = 18, Take one’s place ( 8 )
Third digit of User key ( 5 ) is not present in SS ( 36 ). So Add 1 to SS ( 36 )
1 + 36 = 37, Take one’s place ( 7 )
Dynamic Key : [ 287 ] Got by taking three digits from above three calculations.
Note : We can interchange the Hours, Seconds and Minutes and other mathematical operations and so on.
Example 2 :
User Key : 125
Timestamp : 23:12:36 ( HH:MM:SS)
Basic calculation rules: If we need to find the place of a six-digit Timestamp, above sixth place, just count after sixth place back to first place, second place, third place, and so on. Here we introduce sequence position. The sequence position is not the place where that digit is present in the Timestamp. But it represents the place value like one’s place(6) hundreds place(5) and so on in the Timestamp.
Method :
If the Digit in Sequence Position of [ First digit of User Key ] in Timestamp is in (0, 1, 2, 3), then [ Add 8 else Add 2 ] to HH
If the Digit in Sequence Position of [ Second digit of User Key ] in Timestamp is in( 7, 8, 9), then [ Add 2 else Add 1 ] to MM
If the Digit in Sequence Position of [ Third digit of User Key ] in Timestamp is in ( 4, 5, 6 ), then [ Add 4 else Add 3 ] to SS
Calculation :
Digit in Sequence Position of [ First digit of User Key (1) ] in Timestamp which is 2 is in (0, 1, 2, 3). So Add 8 to HH(23)
8 + 23 = 31, Take one’s place(1)
Digit in Sequence Position of [ second digit of User Key (2) ] in Timestamp which is 3 is not in (7, 8, 9). So Add 1 to MM(12)
1 + 12 = 13, Take one’s place(3)
Digit in Sequence Position of [ Third digit of User Key (5) ] in Timestamp which is 3 is not in (4, 5, 6). So Add 3 to SS(36)
3 + 36 = 39, Take one’s place(9)
Dynamic Key : [139] Got by taking three digits from above three calculations.
Example 3:
User Key : 125
Timestamp : 23:12:36 ( HH:MM:SS)
Method :
If the Digit in Sequence Position of [ First digit of User Key ] in Timestamp is even, then [ Add 6 else Add 9 ] to HH
If the Digit in Sequence Position of [ Second digit of User Key ] in Timestamp is even, then [ Add 3 else Add 2 ] to MM
If the Digit in Sequence Position of [ Third digit of User Key ] in Timestamp is even, then [ Add 1 else Add 8 ] to SS
Calculation :
Digit in Sequence Position of [ First digit of User Key (1) ] in Timestamp which is 2 is even. So Add 6 to HH(23)
6 + 23 = 29, Take one’s place(9)
Digit in Sequence Position of [ second digit of User Key (2) ] in Timestamp which is 3 is not even. So Add 2 to MM(12)
2 + 12 = 14, Take one’s place(4)
Digit in Sequence Position of [ Third digit of User Key (5) ] in Timestamp which is 3 is not even. So Add 8 to SS(36)
8 + 36 = 44, Take one’s place(4)
Dynamic Key : [ 944 ]. Got by taking three digits from above three calculations.
Note : We can provide three alternative ways for a single user to calculate three Dynamic Keys from the same User Key and Timestamp using three different methods as explained above with examples. These three ways provide three Dynamic CVVs, Passcodes and Passwords. The single user can input any one of the three generated outputs and all three are valid. This is done to confuse the intruder who tries to decrypt using brute force, the only method possible.
Step 2 and 3
Process Method A and Process Method B
Both of the Process Methods can use methods from the same pool of methods which will be discussed below. Process Method A uses the Dynamic Cipher given from the website and uses the Dynamic Key generated from the step 1 to produce another Dynamic Cipher. Dynamic Cipher created from Process Method A is fed as input to Process Method B, which further creates another Dynamic Cipher. There are innumerable number of ways a method can be created. Let's get into the simplest of them which can be used for Simplified Manually Generated Dynamic CVV creation.
Example Method 1: Addition
Dynamic Key : [ 360 ]
Dynamic Cipher : [ 416283 ]
Compulsory Calculation : Take the digits of Dynamic Key and add it to the Dynamic Cipher digits at different places and put the sum in those positions, leaving other places unchanged.
Basic calculation rules : Always take the ones place of a number if the result is multiple digit and you need only one digit output.
Method and Calculation :
First digit of Dynamic Key + First digit of Dynamic Cipher = [ 3 + 4 ] = 7
Second digit of Dynamic Key + Third digit of Dynamic Cipher = [ 6 + 6 ] = 12, one’s place (2)
Third digit of Dynamic Key + Fifth digit of Dynamic Cipher = [ 0 + 8 ] = 8
New Dynamic Cipher : [ 712283 ]
Optional using In case in addition to the compulsory section : Take the sum of last two digits of New Dynamic Cipher and place it at the fifth place, in case, fourth digit of Dynamic Cipher is less than 4 or else place it in second place.
New Dynamic Cipher : [ 712283 ]
Method :
Sum of last two digits of New Dynamic Cipher → Fifth place ( if fourth digit < 4 )
Sum of last two digits of New Dynamic Cipher → Second place ( if fourth digit >= 4 )
Calculation :
Fourth digit(2) < 4, So (8 + 3) = 11, Take one’s place(1) → Fifth place
New Dynamic Cipher : [ 712213 ]
Example Method 2: Subtraction
Dynamic Key : [ 360 ]
Dynamic Cipher : [ 416283 ]
Compulsory Calculation : Take the digits of Dynamic Key and subtract it from the Dynamic Cipher digits at different places and put the difference in the respective positions, leaving other places unchanged.
Basic calculation rules : Always take the ones place of a number if the result is multiple digit, because you need only one digit output. If the number is negative, take the modulus of the number, which is taking the digit and leave the negative symbol.
Method and Calculation: :
Third digit of Dynamic Cipher - First digit of Dynamic Key = [ 6 - 3 ] = 3
Fifth digit of Dynamic Cipher - Second digit of Dynamic Key = [ 8 - 6 ] = 2
Sixth digit of Dynamic Cipher - Third digit of Dynamic Key = [ 3 - 0 ] = 3
New Dynamic Cipher : [ 413223 ]
Optional using In case in addition to the compulsory section
Method :
If the fourth digit of the New Dynamic Cipher is less than 2, Subtract 2 from the third digit of the New Dynamic Cipher, or else subtract 3 from the third digit of the New Dynamic Cipher.
Calculation :
New Dynamic Cipher : [ 413223 ]
Fourth digit(2) is not less than 2, So Third digit of New Dynamic Cipher - 3 = 3 - 3 = 0
New Dynamic Cipher : [ 410223 ]
Example 3 : Drop and Replace
Dynamic Key : [ 360 ]
Dynamic Cipher : [ 416283 ]
Compulsory calculation : Drop the digits in the Dynamic Cipher, whose places are obtained from the digits of Dynamic Key and replace it with specified numbers.
Basic calculation rules : If we need to find the place of a six-digit Dynamic Cipher, above sixth place, just count after sixth place go back to first place, second place, third place and so on. There is no Zeroth position which is required to avoid unnecessary confusions, which may arise from zero based calculations.
Method :
Take the first digit from the Dynamic Key and go to the sequence position of that digit in the Dynamic Cipher. Sequence position is not the place where that digit is present in the Dynamic Cipher. But it represents the place value like one’s place(6) hundreds place(5) and so on in the Dynamic Cipher. Drop the digit in that position and replace it with 8.
Take the second digit from the Dynamic Key, go to the sequence position of that digit in Dynamic Cipher. Drop that digit and replace it with 4.
Take the third digit from the Dynamic Key, go to the sequence position of that digit in Dynamic Cipher. Drop that digit and replace it with 1.
Calculation :
First digit of Dynamic Key is 3. Go to third position in Dynamic Cipher. Drop the digit in that position and Replace it with 8.
Second digit of Dynamic Key is 6. Go to sixth position in Dynamic Cipher. Drop the digit in that position and Replace it with 4.
Third digit of Dynamic Key is 0. Go to zeroth position in Dynamic Cipher. As there is no zeroth position which is kept for clarity and easy calculation. No action is done.
New Dynamic Cipher : [ 418284 ]
Optional using In case in addition to the compulsory section :
Method :
In case First digit of New Dynamic Cipher is less than 5, Drop the digit and replace it with 6, else Drop and replace it with 2.
Calculation :
First digit of the New Dynamic Cipher is 4, which is less than 5. Drop the digit and replace it with 6.
New Dynamic Cipher : [ 618284 ]
Example 4 : Drop and fill
Dynamic Key : [ 360 ]
Dynamic Cipher : [ 416283 ]
Compulsory calculation : Drop the digits in the Dynamic Cipher, whose places are obtained from the digits of Dynamic Key and then fill the places of the Dynamic Cipher as mentioned by the specification. The specification can be that, after dropping the digits in Dynamic Cipher, fill some other positions of Dynamic Cipher with specific values.
Basic calculation rules : If we need to find the place of a six-digit Dynamic Cipher, above sixth place, just count after sixth place go back to first place, second place, third place and so on. There is no Zeroth position which is required to avoid unnecessary confusions, which may arise from zero based calculations.
Note : To perform this method, you should remember that fill happens only in the end. The Filling positions are the final positions in the Newly created Dynamic Cipher. If one drop can not be performed in case of presence of zero, there is one less fill to be performed which can be calculated clearly.
Method :
Take the first digit from the Dynamic Key and go to the sequence position of that digit in the Dynamic Cipher. Sequence position is not the place where that digit is present in the Dynamic Cipher. But it represents the place value like one’s place(6) hundreds place(5) and so on in the Dynamic Cipher. Drop the digit in that position and then fill the first position of the Dynamic Cipher with 5.
Take the second digit from the Dynamic Key, go to the sequence position of that digit in Dynamic Cipher. Drop that digit and then fill the third position of Dynamic Cipher with 6.
Take the third digit from the Dynamic Key, go to the sequence position of that digit in Dynamic Cipher. Drop that digit and then fill the fifth position of Dynamic Cipher with 8.
Calculation :
First digit of Dynamic Key is 3. Go to third position in Dynamic Cipher. Drop the digit in that position and Fill the first position with 5. Remember fill has to be performed in the end, if there is a Drop associated with it.
Second digit of Dynamic Key is 6. Go to sixth position in Dynamic Cipher. Drop the digit in that position and Fill the third position with 6.
Third digit of Dynamic Key is 0. Go to zeroth position in Dynamic Cipher. As there is no zeroth position which is kept for clarity and easy calculation. No action needs to be done.
Drop third digit(6) and sixth digit(3). [ 4128 ]
Fill first position with 5. Fill third position with 6. [ 546128 ]
New Dynamic Cipher : [ 546128 ]
Optional using In case, in addition to the compulsory section :
Method :
In case, First digit of New Dynamic Cipher is less than 5, then Drop the first digit and fill the second position of newly generated Dynamic Cipher with 6, else Drop the first digit and fill the fifth position with 2.
New Dynamic Cipher : [ 546128 ]
Calculation :
First digit of the New Dynamic Cipher is 5 which is not less than 5. Drop the digit and fill the fifth position with 2
New Dynamic Cipher : [ 461228 ]
Example 5 : Reverse the number
Dynamic Key : [ 360 ]
Dynamic Cipher : [ 416283 ]
Compulsory calculation : Reverse the digits of the Dynamic Cipher to the left everytime from the sequence position. The sequence position is got from the digits of Dynamic Key.
Basic calculation rules : If we need to find the place of a six-digit Dynamic Cipher, above sixth place, just count after sixth place go back to first place, second place, third place and so on. There is no Zeroth position which is required to avoid unnecessary confusions, which may arise from zero based calculations.
Method :
Reverse the digits of Dynamic Cipher to the left from first to last digit of Dynamic Key.
Calculation :
First digit of Dynamic Key is (3) Reverse the Dynamic Cipher to the left from third position. → [ 614283 ]
Second digit of Dynamic Key is (6) Reverse the Dynamic Cipher to the left from sixth position. → [ 382416 ]
Third digit of Dynamic Key is (0) No zeroth position is there. So no calculation is needed.
New Dynamic Cipher : [ 382416 ]
Optional using In case, in addition to the compulsory section :
Method :
In case, first digit of New Dynamic Cipher is greater than 2, Reverse to the left from fourth position, else Reverse to the left from fifth position.
Calculation :
New Dynamic Cipher : [ 382416 ]
First digit of New Dynamic Cipher is (3) which is greater than 2, so Reverse to the left from fourth position.
New Dynamic Cipher : [ 428316 ]
Example 6 : Jumble the numbers
Dynamic Key : [ 360 ]
Dynamic Cipher : [ 416283 ]
Compulsory calculation : Take the digits of the Dynamic Key and based on that sequence position in the Dynamic Cipher, perform the jumble operations. Remember Sequence position is not the place where that digit is present in the Dynamic Cipher. But it represents the place value like one’s place(6) hundreds place(5) and so on in the Dynamic Cipher.
Method :
Take the first digit of Dynamic Key and find the sequence position of that digit in the Dynamic Cipher. Take the digit which is present in that sequence position of the Dynamic Cipher and jumble it to the last position.
Take the second digit of Dynamic Key and find the sequence position of that digit in the Dynamic Cipher. Take the digit which is present in that sequence position of the Dynamic Cipher and jumble it to the second position.
Take the third digit of Dynamic Key and find the sequence position of that digit in the Dynamic Cipher. Take the digit which is present in that sequence position of the Dynamic Cipher and jumble it to the third position.
Calculation :
First digit of Dynamic Key is 3, the digit in sequence position ( third ) of Dynamic Cipher is 6. Jumble it with last position of Dynamic Cipher. [ 413286 ]
Second digit of Dynamic Key is 6, the digit in sequence position ( sixth ) of Dynamic Cipher is 6( from above calculation). Jumble it with second position of Dynamic Cipher. [ 463281 ]
Third digit of Dynamic Key is 0, So no calculations needs to be done.
New Dynamic Cipher : [ 463281 ]
Optional using In case, in addition to the compulsory section :
Method :
In case first digit of New Dynamic Cipher is an odd number, Jumble alternative numbers, else bring digits in the odd positions of New Dynamic Cipher to the beginning.
New Dynamic Cipher : [ 463281 ]
Calculation :
First digit of New Dynamic Cipher is (4) which is not an odd number, so bring digits in the odd positions ( first, third and fifth positions ) of the New Dynamic Cipher to the front.
New Dynamic Cipher : [ 438621 ]
Example 7 : Using mod function
Dynamic Key : [ 360 ]
Dynamic Cipher : [ 416283 ]
Compulsory calculation : We can take mod of the digits in Dynamic Key and Dynamic Cipher and put it in the mentioned positions of Dynamic Cipher.
Basic calculation rules : Zero can be used in calculating mod function. So it need not be excluded in calculation.
Method :
Put [ ( First digit of Dynamic Key ) mod ( Third digit of Dynamic Cipher ) ] in Third position of Dynamic Cipher.
Put [ ( Second digit of Dynamic Key ) mod ( Fourth digit of Dynamic Cipher ) ] in Fourth position of Dynamic Cipher.
Put [ ( Third digit of Dynamic Key ) mod ( First digit of Dynamic Cipher ) ] in First position of Dynamic Cipher.
Calculation :
3 mod 6 = 3 in Third position of Dynamic Cipher
6 mod 2 = 4 in Fourth position of Dynamic Cipher
0 mod 4 = 0 in First position of Dynamic Cipher
New Dynamic Cipher : [ 013483 ]
Optional using In case, in addition to the compulsory section :
Method :
In case odd number comes in First sequence position of New Dynamic Cipher, perform mod operation between first digit and last digit of New Dynamic Cipher, and put it in last position of New Dynamic Cipher, else perform mod operation between second digit and third digit of New Dynamic Cipher and put it in the third position of New Dynamic Cipher.
Calculation :
First digit of New Dynamic Cipher is (0) which is not odd, so perform mod between second digit (1) and third digit (3) → Third position of New Dynamic Cipher
1 mod 3 = 1 → Third position
New Dynamic Cipher : [ 011483 ]
Example 8 : Using Information with the Bank or Mail Provider
There are lot of information with the service provider like Name, Date of Birth, Account Number, Credit Card / Debit Card Number, House number, PIN code. We can derive numbers from these Information like total number of characters in Name. Numbers from other information can be used to perform calculations on the Dynamic Cipher along with the Dynamic Key to derive New Dynamic Ciphers.
Process Method A and B
The Methods A and B are similar in nature and it is used to do two operations on Dynamic Cipher using Dynamic Key in sequence. The operation methods and sequence of it changes from User to User and there are innumerable number of such methods available which needs to be found out and implemented by service providers. We can even do hybrid methods by taking Compulsory calculation method of one example and mix it with optional( in case methods) of another example and making it robust.
Step 4 :
Pick up Dynamic CVV, Passcode and Password
Picking up the final three digit output from Newly generated Dynamic Cipher after it has undergone Process Method A and Process Method B is discussed below.
Example :
Dynamic Key : [ 360 ]
New Dynamic Cipher : [ 011483 ]
Method :
If digit in the Fifth sequence position of New Dynamic Cipher has ( 0, 3, 5 ), then Add First digit of Dynamic Key to it, else Add Second digit of Dynamic Key to it.
If digit in the Third sequence position of New Dynamic Cipher has ( 2, 4, 9 ), then Add Second digit of Dynamic Key to it, else Add Third digit of Dynamic Key to it.
If digit in the First sequence position of New Dynamic Cipher has ( 2, 8, 1 ), then Add Third digit of Dynamic Key to it, else Add Second digit of Dynamic Key to it.
Calculation :
Digit in the Fifth sequence position of New Dynamic Cipher has 8 which is not in ( 0, 3, 5 ) Add Second digit of Dynamic Key (6) to it. [ 8 + 6 = 14 ]→ 4
Digit in the Third sequence position of New Dynamic Cipher has 1 which is not in ( 2, 4, 9 ) Add Third digit of Dynamic Key (0) to it. [ 1 + 0 = 1 ] → 1
Digit in the First sequence position of New Dynamic Cipher has 0 which is not in ( 2, 8, 1 ) Add Second digit of Dynamic Key (6) to it. [ 0 + 6 = 6 ] → 6
Final Dynamic CVV, Passcode or Password is [ 416]
Conclusion
The whole process involving all four steps with two methods A and B has to be chosen by the service provider and given to the User either in person in case of Dynamic CVVs and Dynamic Passcodes or through email for Dynamic passwords. The whole process has to be changed every year to ensure safety.
Payment
If you want to apply this technique to any of your applications, please let me know so that we can arrange a mutually beneficial agreement on this idea. For details go to my profile and click “My Web Page” under my picture or click “How you can support us” under My Blogs.
Or Simply Click https://supportusbydeepak.blogspot.com/

Comments
Post a Comment