Virtual Code Verification Using Dynamic Detailed Codes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing code systems, such as one-time passwords (OTPs), are vulnerable to hacking and require user identification procedures, making them difficult to apply across various areas, and there is a need for a system to search for a real code based on a virtual code without revealing user or device identification information.
Innovation Solution
A system and method for generating and verifying virtual codes that include a virtual code generating device and a verifying device, using a combination of detailed codes with a specific rule to search for a real code, where the codes are changed per unit count and include a storage location search algorithm to adjust the real code's location, ensuring security and uniqueness.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a real code is written on a card surface without change, then the code can be easily read and used, but the code may be visually flowed out to others and hacked
Solution Approach 1:
The patent applies dynamics by transforming the static real code into a dynamic virtual code that changes over time. The virtual code is generated based on the real code but is updated periodically, making it impossible for hackers to use static theft methods. The code evolves from a fixed state to a time-varying state, resolving the contradiction between ease of reading and security against hacking.
Solution Approach 2:
The patent creates a virtual copy of the real code that serves as a substitute. Instead of using the original real code directly, a virtual code is generated that contains the necessary information but cannot be reverse-engineered to reveal the real code. This copying approach allows the system to maintain security while preserving functionality.
2Object-affected harmful factors
If a one time password (OTP) is used to change code per time, then hacking is prevented, but a log-in procedure is needed to determine user identification algorithm
Solution Approach 1:
The patent implements self-service by enabling the terminal device itself to generate the virtual code without requiring external authentication servers or complex login procedures. The terminal uses its own resources (processor, memory, clock) to autonomously generate time-based virtual codes, eliminating the need for OTP servers and simplifying the user experience while maintaining security.
Solution Approach 2:
The system performs preliminary action by pre-generating and storing multiple virtual codes in advance within the terminal device. Instead of generating codes on-demand during authentication, the terminal prepares a sequence of virtual codes beforehand, allowing for faster authentication and reducing the complexity of real-time code generation during the login process.
3Adaptability or versatility
If OTP is applied to various areas, then versatility is improved, but it is difficult to apply without user identification information
Solution Approach 1:
The patent achieves universality by designing a virtual code generation system that can be applied across multiple domains (payment, authentication, access control) without requiring domain-specific identification information. The terminal device generates virtual codes based solely on time and internal algorithms, making the system universally applicable wherever time-based one-time codes are needed, eliminating the need for user-specific identification data.
Data Source
AI summary
A system, a method, and a program for providing a virtual code, a virtual code generating device, and a virtual code verifying device are provided. The method includes receiving, by a virtual code verifying means, a virtual code from a virtual code generating means, extracting, by the virtual code verifying means, a plurality of detailed codes included in the virtual code, and searching for, by the virtual code verifying means, a storage location of a real code based on the plurality of detailed codes.