DESC:FORM 2

THE PATENTS ACT, 1970
(39 of 1970)
&
THE PATENT RULES, 2003

COMPLETE SPECIFICATION
(See Section 10 and Rule 13)

Title of invention:

“VISUALLY GUIDED MECHANISM FOR CREATING SECURE PASSWORD PATTERNS”

Applicant

Tata Consultancy Services Limited
A company Incorporated in India under the Companies Act, 1956
Having address:
Nirmal Building, 9th floor,
Nariman point, Mumbai 400021,
Maharashtra, India

The following specification particularly describes the invention and the manner in which it is to be performed.

CROSS-REFERENCE TO RELATED APPLICATIONS AND PRIORITY
[001] The present application claims priority to Indian Patent Application No. 201821006059, filed on February 16, 2018, the complete disclosure of which, in its entirety is herein incorporated by reference.

TECHNICAL FIELD
[002] The disclosure herein generally relates to field of password patterns creation, more particularly, to visually guided mechanism for creating secure password patterns.

BACKGROUND
[003] Electronic devices such as smart phones, tablets, Personal Digital Assistants (PDAs) and the like have become an integral part of people’s daily life. The electronic devices or devices, with their enhanced computation and communication capabilities are used extensively by a device owner or a device user to store and process personal and critical information. Thus, the electronic devices are a gateway to a plethora of personal information and are provided with authentication mechanisms to ensure access and information security
[004] Password patterns are one of the most popular authentication methods on electronic devices and are considered as promising authentication alternative to textual passwords. Conventional password pattern generation techniques used in the electronic devices allow a user to generate a pattern of his/her choice by connecting a series of markers in an nxn grid displayed on device screen. The path tracing with the connection of markers however should follow certain pre-defined rules. Further, the conventional techniques are independent of the initial finger position of the user on the device screen. Furthermore, the conventional password pattern creation approaches do not provide any mechanism enabling user to consider connectivity characteristics such as knight moves, overlaps, direction changes, intersections (crosses). A knight move occurs when a marker is connected to another marker that is two units away in the horizontal (vertical) direction and one unit away in the vertical (horizontal) direction. An overlap occurs when a marker is directly connected to another marker, and if the marker in the middle of their path is already connected. A direction change occurs when two consecutive line segments in a given pattern have different Euclidean distances. An intersection occurs when two nonconsecutive line segments in a pattern cross each other. Further, available theoretical space of the grid interfaces is very large, but users are unable to make use of the available theoretical space. Moreover, in conventional approaches creation of pattern is dependent on user and no indication or assistance is provided to the user to define a better or more complex pattern and secure pattern, which may enhance the security level provided by a selected pattern.

SUMMARY

[005] Embodiments of the present disclosure present technological improvements as solutions to one or more of the above-mentioned technical problems recognized by the inventors in conventional systems. For example, in one aspect, there is provided a processor implemented method for generating a secure password pattern, comprising: (a) receiving, from a user, a gesture input on a nxn grid interface, wherein the nxn grid interface comprises a plurality of markers; (b) identifying, based on the gesture input, a marker from the plurality of markers on the nxn grid interface; and (c) identifying and displaying, using a visual and guided mechanism, a set of unconnected reachable markers from the identified marker. In an embodiment, the set of unconnected reachable markers is identified and displayed by applying one or more connectivity rules on the plurality of markers. In another embodiment, the one or more connectivity rules for creating the password pattern comprises (i) selecting at least four markers from the plurality of markers on the nxn grid interface; (ii) refraining a connected marker for re-use; (iii) enabling movement of the gesture input in straight direction only; and (iv) connecting from a current marker to a new marker through a previously connected marker in the identified path. The method further comprises (d) determining a status corresponding to an action pertaining to another gesture input, wherein the status comprises a release action or a no-release action. In an embodiment, based on the status, the method may further comprise performing one of: (e) receiving another gesture input on at least one unconnected reachable marker from the set and repeating the step (b) through (d); or (f) generating, using the visual and guided mechanism, a password pattern by identifying a path taken from the gesture input till a last gesture input that is identified based on the release action, wherein the identified path comprises a plurality of connected reachable markers.
[006] In an embodiment, prior to receiving gesture input, the one or more hardware processors are configured to determine one or more co-prime pair of coordinates for each marker from the plurality of markers; and determine, based on the one or more co-prime pair of coordinates, one or more unique explorable directions on the nxn grid interface for each of the plurality of markers.
[007] In another aspect, there is provided a system for generating a secure password pattern comprising: a memory storing instructions; one or more communication interfaces; and one or more hardware processors coupled to the memory through the one or more communication interfaces, wherein the one or more hardware processors are configured by the instructions to (a) receive, from a user, a gesture input on a nxn grid interface, wherein the nxn grid interface comprises a plurality of markers; (b) identify, based on the gesture input, a marker from the plurality of markers on the nxn grid interface; and (c) identify and display, using a visual and guided mechanism, a set of unconnected reachable markers from the identified marker. In an embodiment, the set of unconnected reachable markers is identified and displayed by applying one or more connectivity rules on the plurality of markers. In another embodiment, the one or more connectivity rules for creating the password pattern are executed by said one or more hardware processors to (i) select at least four markers from the plurality of markers on the nxn grid interface; (ii) refrain a connected marker for re-use; (iii) enable movement of the gesture input in straight direction only; and (iv) connect from a current marker to a new marker through a previously connected marker in the identified path. In an embodiment, the one or more hardware processors are further configured to (d) determine a status corresponding to an action pertaining to another gesture input, wherein the status comprises a release action or a no-release action. In an embodiment, based on the status, the one or more hardware processors are further configured to perform one of: (e) receive another gesture input on at least one unconnected reachable marker from the set and repeat the step (b) through (d); or (f) generate, using the visual and guided mechanism, a password pattern by identifying a path taken from the gesture input till a last gesture input that is identified based on the release action, wherein the identified path comprises a plurality of connected reachable markers.
[008] In an embodiment, prior to receiving gesture input, the one or more hardware processors are configured to determine one or more co-prime pair of coordinates for each marker from the plurality of markers; and determine, based on the one or more co-prime pair of coordinates, one or more unique explorable directions on the nxn grid interface for each of the plurality of markers.
[009] In an embodiment, the one or more hardware processors are further configured to compute, at each gesture input from user, number of connected markers from the plurality of markers; and perform a comparison of the number of connected markers with a pre-defined threshold. In another embodiment, based on the comparison, the one or more hardware processors are further configured to perform one of: (a) detect, an unconnected marker from a current marker in each of the one or more unique explorable directions that are previously determined; and (b) associate the unconnected marker as a reachable marker in the one or more unique explorable directions that are previously determined; or (i) determine a direction for each unconnected marker from the plurality of markers; and (ii) identify at least one unconnected marker as an unconnected reachable marker if the identified at least one unconnected marker is a first marker in the determined direction.
[010] In yet another aspect, there are provided one or more non-transitory machine readable information storage mediums comprising one or more instructions which when executed by one or more hardware processors cause (a) receiving, from a user, a gesture input on a nxn grid interface, wherein the nxn grid interface comprises a plurality of markers; (b) identifying, based on the gesture input, a marker from the plurality of markers on the nxn grid interface; and (c) identifying and displaying, using a visual and guided mechanism, a set of unconnected reachable markers from the identified marker. In an embodiment, the set of unconnected reachable markers is identified and displayed by applying one or more connectivity rules on the plurality of markers. In another embodiment, the one or more connectivity rules for creating the password pattern comprises (i) selecting at least four markers from the plurality of markers on the nxn grid interface; (ii) refraining a connected marker for re-use; (iii) enabling movement of the gesture input in straight direction only; and (iv) connecting from a current marker to a new marker through a previously connected marker in the identified path. The instructions further cause (d) determining a status corresponding to an action pertaining to another gesture input, wherein the status comprises a release action or a no-release action. In an embodiment, based on the status, the method may further comprise performing one of: (e) receiving another gesture input on at least one unconnected reachable marker from the set and repeating the step (b) through (d); or (f) generating, using the visual and guided mechanism, a password pattern by identifying a path taken from the gesture input till a last gesture input that is identified based on the release action, wherein the identified path comprises a plurality of connected reachable markers.
[011] In an embodiment, the step of receiving gesture input is preceded by determining one or more co-prime pair of coordinates for each marker from the plurality of markers; and determining, based on the one or more co-prime pair of coordinates, one or more unique explorable directions on the nxn grid interface for each of the plurality of markers.
[012] In an embodiment, the instructions may further cause computing, at each gesture input from user, number of connected markers from the plurality of markers; and performing a comparison of the number of connected markers with a pre-defined threshold. In another embodiment, based on the comparison, the method may further comprise performing one of: (a) detecting, an unconnected marker from a current marker in one or more unique explorable directions that are previously determined; and (b) associating the unconnected marker as a reachable marker in the one or more unique explorable directions that are previously determined; or (i) determining a direction for each unconnected marker from the plurality of markers; and (ii) identifying at least one unconnected marker as an unconnected reachable marker if the identified at least one unconnected marker is a first marker in the determined direction.
[013] It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.

BRIEF DESCRIPTION OF THE DRAWINGS

[014] The accompanying drawings, which are incorporated in and constitute a part of this disclosure, illustrate exemplary embodiments and, together with the description, serve to explain the disclosed principles:
[015] FIG. 1 illustrates a functional block diagram of a system (device) for generating secure password pattern based on a visually guided mechanism, according to some embodiments of the present disclosure;
[016] FIG. 2 is an exemplary flow diagram of a processor implemented method for generating secure password pattern based on a visually guided mechanism, in accordance with some embodiments of the present disclosure;
[017] FIG. 3 A and 3B illustrate a working example of determining unique explorable directions from a selected marker on a 12x 12 grid interface, in accordance with some embodiments of the present disclosure;
[018] FIG. 4 depicts an exemplary methodology for password pattern creation on a 3x3 grid interface, in accordance with an example embodiment of the present disclosure;
[019] FIG. 5 illustrates one or more example connectivity rules including direct and overlap connectivity rules and example password patterns, in accordance with some embodiments of the present disclosure;
[020] FIGS. 6A through 9B depict exemplary flow diagrams illustrating various methodologies for generating secure password pattern, in accordance with some embodiments of the present disclosure;
[021] FIG. 10 illustrates an example of grid interface division into four quadrants for identifying a currently connected marker and identifying reachable markers from the currently connected marker in all the quadrants, in accordance with some embodiments of the present disclosure; and
[022] FIG. 11A, 11B and 11C depict graphs illustrating comparison of simulation results of the various methodologies for generating secure password pattern on 10x10, 20x20 and 30x30 grids, in accordance with some embodiments of the present disclosure.
[023] It should be appreciated by those skilled in the art that any block diagrams herein represent conceptual views of illustrative systems and devices embodying the principles of the present subject matter. Similarly, it will be appreciated that any flow charts, flow diagrams, and the like represent various processes which may be substantially represented in computer readable medium and so executed by a computer or processor, whether or not such computer or processor is explicitly shown.

DETAILED DESCRIPTION OF EMBODIMENTS

[024] Exemplary embodiments are described with reference to the accompanying drawings. In the figures, the left-most digit(s) of a reference number identifies the figure in which the reference number first appears. Wherever convenient, the same reference numbers are used throughout the drawings to refer to the same or like parts. While examples and features of disclosed principles are described herein, modifications, adaptations, and other implementations are possible without departing from the spirit and scope of the disclosed embodiments. It is intended that the following detailed description be considered as exemplary only, with the true scope and spirit being indicated by the following claims.
[025] The embodiments herein provide systems and methods that implement visually guided mechanism for generating secure password pattern wherein the mechanism provides assistance to a user in creating password pattern on an nxn grid interface thereby enhancing security of password patterns generated. The nxn grid comprises a plurality of markers, wherein the marker can be a dot, a symbol, and the like, wherein the symbol can take any shape and size and may vary based on the grid interface type. In an embodiment, the password patterns generated may include graphical patterns, and alike. In an embodiment, the method enhances existing grid interfaces by employing one or more design principles such as visibility and consistency with a visual indicator mechanism. According to the visibility principle, mechanisms to convey the users about possible actions are explained. The visually guided mechanism makes the set of available choices visible to users by highlighting the next set of unconnected markers that can be visited from the currently connected marker and helps users in selecting more diverse patterns. The highlighting of markers occurs in real-time while the pattern is being generated or created. Further, the consistency principle makes the grid interface intuitive to use. The highlighting of markers in proposed method and system is made available during pattern creation (generation) as well as during recall. This eliminates the confusion since the behavior of the grid interface is consistent during creation (generation) and recall. Further, the highlighting of markers could also serve as cue when the user is trying to retrieve the pattern based on user’s memory. The proposed system also retains a feedback mechanism of the existing grid interface for enforcing the first three requirements for creating (generating) patterns. For instance, if the user connects less than 4 markers, it displays a feedback message, “Connect at least 4 markers. Try again.”
[026] Referring now to the drawings, and more particularly to FIGS. 1 through 11, where similar reference characters denote corresponding features consistently throughout the figures, there are shown preferred embodiments and these embodiments are described in the context of the following exemplary system and/or method.
[027] FIG. 1 illustrates a functional block diagram of a system for assisting a user in creating secure graphical pattern, according to some embodiments of the present disclosure. The system or device 100 includes or is otherwise in communication with one or more hardware processors such as a processor 106, an I/O interface 104, at least one memory such as a memory 102, and a pattern creation module 108. In an embodiment, the pattern creation module 108 can be implemented as a standalone unit in the system 100. In another embodiment, the pattern creation module 108 can be implemented as a module in the memory 102. The processor 106, the I/O interface 104, and the memory 102, may be coupled by a system bus.
[028] The I/O interface 104 may include a variety of software and hardware interfaces, for example, a web interface, a graphical user interface, and the like. The interfaces 104 may include a variety of software and hardware interfaces, for example, interfaces for peripheral device(s), such as a keyboard, a mouse, an external memory, a camera device, and a printer. The interfaces 104 can facilitate multiple communications within a wide variety of networks and protocol types, including wired networks, for example, local area network (LAN), cable, etc., and wireless networks, such as Wireless LAN (WLAN), cellular, or satellite. For the purpose, the interfaces 104 may include one or more ports for connecting a number of computing systems with one another or to another server computer. The I/O interface 104 may include one or more ports for connecting a number of devices to one another or to another server.
[029] The hardware processor 106 may be implemented as one or more microprocessors, microcomputers, microcontrollers, digital signal processors, central processing units, state machines, logic circuitries, and/or any devices that manipulate signals based on operational instructions. Among other capabilities, the hardware processor 106 is configured to fetch and execute computer-readable instructions stored in the memory 102.
[030] The memory 102 may include any computer-readable medium known in the art including, for example, volatile memory, such as static random access memory (SRAM) and dynamic random access memory (DRAM), and/or non-volatile memory, such as read only memory (ROM), erasable programmable ROM, flash memories, hard disks, optical disks, and magnetic tapes. In an embodiment, the memory 102 includes the plurality of modules 108 and a repository 110 for storing data processed, received, and generated by one or more of the modules 108. The modules 108 may include routines, programs, objects, components, data structures, and so on, which perform particular tasks or implement particular abstract data types.
[031] The data repository 110, amongst other things, includes a system database and other data. The other data may include data generated as a result of the execution of one or more modules in the modules 108. The system database stores the password patterns generated as a result of the execution of one or more modules in the modules 108. The data stored in system database can be learnt to further provide generation of more secure password patterns.
[032] In an embodiment, the pattern generation module 108 can be configured to provide assistance to the user to generate secure password pattern. Assisting the user for generation of the graphical pattern can be carried out by using various methodologies, described in conjunction with FIG. 2, FIGS. 6 through 9 and using examples.
[033] FIG. 2A through 2C, with reference to FIG. 1, is an exemplary flow diagram of a processor implemented method for generating secure password pattern based on a visually guided mechanism using the pattern generation module 108 of FIG. 1, in accordance with some embodiments of the present disclosure. In an embodiment of the present disclosure, at step 202, the one or more hardware processors 106 receive, from a user, a gesture input on an nxn grid interface, wherein the nxn grid interface comprises a plurality of markers. In an embodiment, the plurality of markers may comprise but are not limited to a dot, a symbol and the like wherein the symbol may take any shape and size. In an embodiment of the present disclosure, the shape and size may vary based on the grid interface type. For example, the shape and size of the plurality of markers may be same for grid interface types say 3x5 and 4x6, in one embodiment. In another embodiment, the shape and size of the plurality of markers may be different for each grid interface type. For instance, the shape and size of the plurality of markers may be circular and small respectively for a grid interface type say 3x5, but the shape and size of the plurality of markers may be square and medium respectively for a grid interface type say 4x6. In yet another embodiment, the shape and size of the plurality of markers may be dynamically determined by the system 100 based on the path taken by the user to create pattern (e.g., say password pattern). In other words, when a first gesture input from a user is being received, the shape and size that may be dynamically selected by the system 100 as circular and small respectively. However, when a second gesture input from the user is being received, the shape and size may be identical or different from the initial dynamic selection. For example, when the second gesture input from the user is being received, the shape and size that is dynamically selected by the system 100 may now be say of same shape and size (e.g., circular and small respectively) or could be square and of medium size. In an embodiment, the gesture input can either be received by means of user’s touch on grid interface or providing values externally that are interpreted by the system and corresponding marker is selected as an input for pattern creation. In an embodiment, with reference to FIGS. 6A through 9B, as depicted in step 602, 704, 804, and 904, the method includes receiving the gesture input, on a first marker as input from a user on a nxn grid interface, wherein the first marker becomes currently connected marker. Further, the method computes coordinates of the received marker on a nxn grid interface. In an embodiment, the step of receiving the gesture input (202), with reference to FIGS. 7A through 9B, as depicted in step 702, 802, and 902, is preceded by computing a number of explorable unique directions to find a set of reachable markers for each marker. In one embodiment, the number of the explorable unique directions are computed by determining one or more co-prime pair of coordinates for each marker from the plurality of markers, wherein the co-prime pair of coordinates are the coordinates representing difference between the coordinates of current marker and next marker in x and y direction respectively, and determining, based on the one or more co-prime pair of coordinates, one or more unique explorable directions on the nxn grid interface for each of the plurality of markers. In an embodiment, the co-prime pair of coordinates defines at least a unique explorable direction. In another embodiment, the co-prime pair of coordinates of the identified marker (based on the received gesture input) are represented by (i, j), where 0 < i < n and 0 < j < n. In an embodiment, the one or more pair of coordinates in the nxn grid are defined as co-prime pair of coordinates when Greatest Common Divisor (GCD) of the pair of coordinates is one. For example, markers with pair of coordinates say (1, 1), or (1, 2), or (2, 1) or (3, 4) or (4, 7) define the unique explorable direction as the GCD of these pair of coordinates is one. However, markers with coordinates say (2, 2) or (2, 4) or (3, 3) or (3, 6) or (4, 4) or (4, 6) and so on do not define unique explorable directions as the GCD of these pair of coordinates is not one. The step of computing the unique explorable directions, is further explained and depicted in FIG. 3A and 3B. As depicted at step 1 (e.g., a first representation depicted at left top side) of FIG. 3A, markers in 12 x 12 grid are marked along row and columns, wherein the markers in 12X12 grid are numbered from 1 to144 in row major order using co-ordinates (i, j) where 0 <= i < 12 and 0 <= j < 12. As depicted at step 2 (e.g., a second representation depicted at right top side) of FIG. 3A, the system receives a first marker based on user inputs provided to the 12 x 12 grid interface with the coordinates (5, 5) and displays a set of unconnected markers reachable from the first marker. At step 3 (e.g., a third representation depicted at left bottom side) of FIG. 3A, the system receives a second marker with the coordinates (4, 6) when user selects one of the markers from the set of marker reachable from the first marker with coordinates (5, 5), wherein the second marker lies in direction having coordinates (1, -1) from the first marker. Here, the direction having coordinates (1, -1) defines at least a unique explorable direction. Further, the system computes and displays a set of markers reachable from the second marker. Since the marker with coordinates (5, 5) in the unique explorable direction (1, -1) is already connected, the system does not consider the first marker with coordinates (5, 5), as reachable marker from the second marker. However, the first unconnected marker from the second marker with coordinates (4, 6) in the unique explorable direction (1, -1) is a marker with coordinates (6, 4). So, at step 4 (e.g., a fourth representation depicted at right bottom side), the system receives a third marker with coordinates (6, 4) when user selects one of the markers from set of markers reachable from the second marker and displays a set of markers reachable from the third marker. Further, as depicted in step 5 of FIG. 3B (e.g., a fifth representation depicted at right top side), the system receives a fourth marker with coordinates (3, 3) when user selects one of the markers from set of markers reachable from the third marker with coordinates (6, 4) and displays a set of markers reachable from the third marker, wherein the fourth marker lies in direction having coordinates (3, 1) from the third marker. Here, the direction having coordinates (3, 1) also defines at least a unique explorable direction. Further, as depicted in step 6 of FIG. 3B, a pattern connecting markers with coordinates (5, 5), (4, 6), (6, 4) and (3, 3) is generated and no reachable markers are further displayed.
[034] Referring back to FIG. 2A, at step 204, the one or more hardware processors 106 identify, based on the gesture input, a marker from the plurality of markers on the nxn grid interface. For example, as depicted in FIG. 4, at step 1, the system 100 receives a gesture input and a marker is identified, wherein the identified marker is marker 3 (e.g., refer FIG. 4 wherein a first representation depicted at left top side wherein last marker in first row of 3x3 grid interface is identified). Upon identifying a marker, at step 206, the one or more hardware processors 106 identify and display, using a visual and guided mechanism, a set of unconnected reachable markers (e.g., second marker, fourth marker, fifth marker, sixth marker and eighth marker) from the identified marker (say which in this case is 3 or third marker). Here, the reachable markers refer to the set of unconnected markers that can be visited from the currently identified new marker (say which in this case is 3 or third marker). In an embodiment, FIGS. 6A through 9B, illustrate various methodologies implemented by the system for generating secure password pattern. More specifically, the step 206, is discussed (or described) in steps 604 through 608 of FIG. 6A, steps 706 through 710 of FIG. 7A, steps 806 through 812 of FIG. 8A, and steps 906 through 912 of FIGS. 9A and 9B. The steps for example, comprise detecting a set of unconnected markers from the recent (or current) marker selected by the user on the nxn grid interface, flagging all the detected unconnected markers as unvisited, and dividing the grid interface into four quadrants with currently connected marker as origin respectively. While the step 206 is being performed by the system 100, the system 100 for each quadrant performs:
1. selecting an unvisited direction among all possible directions from the currently connected marker
2. detecting a first encountered unconnected marker from the currently connected marker in the selected unvisited direction
3. marking the detected first encountered unconnected marker as reachable marker in the selected unvisited direction,
4. marking all unconnected markers in the selected unvisited direction as visited, and repeating above steps for all unexplored directions among the possible directions respectively.
[035] As depicted in step 610, the step of exploring all possible directions from the currently connected marker for identifying and displaying the set of unconnected reachable markers requires visiting all possible markers in all the possible directions in nxn grid. For example, a first marker received, based on the user input on a 12x12 grid, is the marker with coordinates (5, 5). Further, for computation of the set of unconnected reachable markers, from the first marker with coordinates (5, 5), the method includes searching for unconnected reachable markers in all possible directions including directions with coordinates (1, 1), (2, 2), (3, 3), (4, 4), (5, 5) and (6, 6) and the like. If the second marker, identified based on user inputs from the set of reachable markers from the first marker with coordinates (5, 5), is the marker with coordinates (6, 6). Then, the identified second marker is marked as reachable, wherein the second identified marker lies in the direction with coordinates (1, 1) from the first marker with coordinates (5, 5). Even though, the second marker with coordinates (6, 6) is already marked as reachable in the direction with (1, 1) from the first marker with coordinates (5, 5), the method would continue visiting to other nodes in the same direction such as markers with coordinates (7, 7), (8, 8) and the like. While visiting the other nodes lying in the same direction from the marker with coordinates (5, 5), the method would revisit previously visited markers such as revisit marker (6, 6) for visiting marker (7, 7) from the marker (5, 5).
[036] The step of visiting all possible markers in all the possible directions in nxn grid results in revisiting already visited nodes multiple times, thereby, poses a challenge thus making the system inefficient. In order to overcome the above challenge, the step of computing a number of explorable unique directions is performed to find the set of reachable markers (e.g., refer FIGS. 7A through 9B and associated steps 702, 802 and 902 respectively). For example, a first marker received, based on the user input on a 12x12 grid, is the marker with coordinates (5, 5). Since, the one or more unique explorable directions are already computed, so for computation of the set of unconnected reachable markers, from the first marker with coordinates (5, 5), the method includes searching for unconnected reachable markers in all pre-computed unique explorable directions including directions with coordinates (1, 1), (1, 2), (3, 1), and the like.
[037] However, searching for unconnected reachable markers in the directions with coordinates (2, 2), (3, 3), (4, 4) is not required as said directions are not identified as unique explorable directions. Further, the second marker selected from the set of unconnected reachable marker from the marker with coordinates (5, 5), is the marker with coordinates (6, 6). Since the marker with coordinates (6, 6), lying in the direction with coordinates (1, 1) from the marker with coordinates (5, 5), is the first unconnected reachable marker, the method includes marking it reachable and stop visiting the markers lying in the same direction such as markers with coordinates (7, 7), (8, 8) and the like. Thus, the problem of revisiting already visited nodes multiple times is overcome. In other words, the system 100 performs steps of selecting a direction among all pre-computed unique explorable directions from the currently connected marker, detecting a first encountered unconnected marker from the currently connected marker in the selected direction, marking the detected first encountered unconnected marker as reachable marker in the selected direction, marking all unconnected markers in the selected direction as visited, and repeating above steps for all unexplored directions among the pre-computed unique explorable directions (e.g., refer steps 610, 710 and 910 of FIGS. 6A, 7A and 9A respectively). It is evident from FIGS. 7A and 9A that steps 710 and 910 are modification of step 610 of FIG. 6A.
[038] In an embodiment, the set of unconnected reachable markers are identified and displayed (as depicted in step 206) by applying one or more connectivity rules on the plurality of markers (e.g., refer FIG. 5 that depicts various connectivity rules). In the present disclosure, the one or more connectivity rules for creating the password pattern may comprise (i) selecting at least four markers from the plurality of markers on the nxn grid interface; (ii) refraining a connected marker for re-use; (iii) enabling movement of the gesture input in straight direction only; and (iv) connecting from a current marker to a new marker through a previously connected marker in the identified path. The fourth connectivity rule among the one or more connectivity rules implies that one can connect two markers denoted by di and dj (di?dj) directly, if all the markers along the straight line path are already connected. For instance, in a 3x3 grid, connecting marker 1 directly to marker 3 (1?3) is possible if marker 2 is already connected or connecting marker 2 directly to marker 8 (2?8) is possible if marker 5 is already connected.
[039] FIG. 5 illustrates the one or more connectivity rules including direct and overlap connectivity rules and example password patterns, in accordance with some embodiments of the present disclosure. FIG. 5 depicts the connectivity rules with help of steps 1 through step 9. At step 1, all markers in a 3X3 grid are labelled in a row-major order, where the upper-left marker is labelled as 1 and the lower-right marker is labelled as 9. In an embodiment, when referring to a line segment or connection between two consecutive markers d1 and d2 in a pattern, the notation d1?d2 is used. For instance, the line segment between consecutive markers 3 and 8 in the pattern 9538127, as depicted at step 7, is represented as 3?8. At step 2, direct connectivity rule of generating password patterns from a corner marker of 3x3 grid is explained. The corner marker can be connected directly to any of the 5 non-corner markers. For example, from marker 1, one can directly connect any one of the five segments, 1?2, 1?4, 1?5, 1?6 or 1?8. As depicted in FIG. 5, at step 3, direct connectivity rule of generating password patterns from a side marker of 3x3 grid is explained. The side marker can be connected directly to any of the remaining 7 markers. For example, from marker 2, one can directly connect any one of the seven segments, 2?1, 2?3, 2?4, 2?5 2?6, 2?7, or 2?9. As depicted in FIG. 5, at step 4, direct connectivity rule of generating password patterns from a centre marker of 3x3 grid is explained. The corner marker can be connected directly to any of the remaining 8 markers. For example, from markers 5, one can directly connect any one of the eight segments, 5?1, 5?2, 5?3, 5?4, 5?5, 5?6, 5?7, 5?8 or 5?9. As depicted in FIG. 5, at step 5 and 6, one or more overlap connectivity rules of generating password patterns from a corner markers and side marker of 3x3 grid are explained. For example, from marker 1, one can connect the corner marker 1?3 only if dot 2 is already connected. Likewise one can connect corner marker 1?7 if dot 4 is already connected, and one can connect corner marker 1?9 if dot 5 is already connected. In an embodiment, the fourth connectivity rule states connecting from a current marker to a new marker through a previously connected marker in the identified path which can be realized in at least two ways, as depicted in FIGS. 4-5, at step 7, 8 and 9, namely:
i) Overlapping segment: In a 3x3 grid, it occurs when the connection to marker 2 is immediately followed by markers 1 and 3. In this case, the line segment 2?1 is covered completely by the line segment 1?3. An example of such pattern is explained at step 7 of FIG. 5 as pattern 521384.
ii) Overlapping marker: In a 3x3 grid, it occurs when the connection to marker 2 is followed by some other marker(s) followed by markers 1 and 3. An example of such pattern is explained at step 8 of FIG. 5 as pattern 62413589. Similarly, one can also connect the side marker 2?9 if marker 6 is already connected.
[040] Utilization of one or more overlap connectivity rules help in increasing the search space on a nxn grid interface. For example, the theoretical distribution of overlaps in a 3X3 patterns is illustrated in below Table 1. As can be seen from Table 1, if overlaps are never used in the patterns then the search space diminishes to just 139,880. The maximum number of overlaps that can occur in a pattern is 5, and it is observed for instance in patterns that begin with the center marker, followed by all side markers followed by all corner markers such as pattern 528463971 depicted in FIG. 5, at step 9.
#Overlaps Count Percentage
0 139,880 35.95%
1 159,480 40.98%
2 69,896 17.96%
3 16,912 4.35%
4 2,688 0.69%
5 252 0.07%
Total 389,112 100%
Table 1
[041] As can be seen from Table 1, the theoretical space of 3x3 grid is 389,112. Due to limited or no use of overlaps, in user chosen patterns, the theoretical space reduces to 139, 880. Referring back to Table 1, it can be seen that with the use of the one or more connectivity rules, the utilization of theoretical space of 3X3 patterns by user increases. Referring back to FIG. 2A, in an embodiment of the present disclosure, at step 208, the one or more hardware processors 106 receive another gesture input on at least one unconnected reachable marker from the set. In an embodiment, with reference to FIGS. 6B through 9B, as depicted in step 614, 714, 816, and 916, the another gesture input may be detected based on finger drag movement of the user from the currently connected marker to a next marker selected from the displayed reachable markers. Upon receiving a second gesture input (or at each subsequent gesture inputs), the system 100 computes a number of connected markers from the plurality of markers, and performs a comparison of the number of connected markers with a pre-defined threshold. Step 908 as depicted in FIG. 9A, illustrates a comparison of the number of connected markers with a pre-defined threshold, wherein the value of pre-defined threshold is 1/3 of total number of markers in the grid interface. Based on the comparison, the system 100 either (i) detects, an unconnected marker from a current marker in one or more unique explorable directions that are previously determined and (ii) associates the unconnected marker as a reachable marker in the one or more unique explorable directions that are previously determined, as depicted in step 910 of the FIG. 9A and steps 706 through 710 of the FIG. 7A; or (a) determines a direction for each unconnected marker from the plurality of markers and (b) identifies at least one unconnected marker as an unconnected reachable marker if the identified at least one unconnected marker is a first marker in the determined direction, as depicted in step 912 of the FIG. 9B and steps 806 through 812 of FIG. 8A. In other words, when the number of connected markers is less than the threshold (e.g., 1/3), the system 100 performs steps (i) and (ii), else (e.g., when the number of connected markers is greater than the threshold (e.g., 1/3), the system 100 performs steps (a) and (b).
[042] Referring back to FIG. 2A, in an embodiment of the present disclosure, at step 210, the one or more hardware processors 106 determine a status corresponding to an action pertaining to another gesture input, wherein the status comprises a release action or a no-release action.
[043] Based on the status, the system 100 (or the one or more hardware processors 106) at step 214, repeats, the steps 206 through 210; or generates, at step 216, using the visual and guided mechanism, a password pattern by identifying a path taken from the gesture input till a last gesture input that is identified based on the release action, wherein the identified path comprises a plurality of connected reachable markers. For instance, if the status is no release action then the system 100 repeats the steps 206 till 210, else (when the status is say finger released, step 216 is performed by the system. Specifically, steps 616, 716, 816, and 918 of FIGS. 6B, 7B, 8B and 9B respectively are performed for status determination. When the finger is released, the system 100 generates a password pattern. For instance, refer FIG. 4 wherein assuming the user connects marker 7 and performs a release action post which the system 100 identifies the path taken by the user and records a pattern as 385196427.
[044] The above steps (e.g. step 202 till 216) of FIGS. 2A and 2B are illustrated by way of an example as depicted in FIG. 4. More particularly, FIG. 4 depicts an exemplary methodology for password pattern creation on a 3x3 grid interface in accordance with an example embodiment of the present disclosure. For instance, when a marker is selected by way of a gesture input, the system 100 displays a set of reachable markers from current received and identified marker. In an embodiment, as depicted in FIG. 4, at step 1, the user receives a gesture input and identify a marker, wherein the identified marker is marker 3. From identified marker 3, the user can visit any non-corner marker {2, 4, 5, 6, 8} according to direct connectivity rule. However, the user cannot visit marker 1 as marker 2 is still unconnected or marker 7 as marker 5 is unconnected or marker 9 as marker 6 is unconnected according to overlap connectivity rule. Hence, only non-corner dots {2, 4, 5, 6, 8} are displayed. At step 2, the user connects marker 8. From marker 8, the user can visit any marker except marker 2. This is because marker 5 is yet to be connected according to overlap connectivity rule. Therefore, all unconnected markers {1, 4, 5, 6, 7, 9} except marker 2 are displayed. At step 3, the user connects marker 5. From marker 5, the user can visit any unconnected marker {1, 2, 4, 6, 7, 9} as displayed. At step 4, the user connects marker 1. From there, the user can visit any unconnected non-corner marker {2, 4, 6} based on direct connectivity rule. Since marker 5 is already connected, the user can also visit marker 9 according to overlap connectivity rule. However, the user cannot visit marker 7 as marker 4 is yet to be connected. Hence, the set {2, 4, 6, 9} is displayed. At step 5, the user connects marker 9. From there, the user can visit any unconnected non-corner marker {2, 4, 6} according to direct connectivity rule. Further, since marker 8 is already connected, the user can now visit marker 7 according to overlap connectivity rule. Hence, the set {2, 4, 6, 7} is displayed. At step 6, the user connects marker 6. From marker 6, in addition to unconnected markers 2 and 7 according to direct connectivity rule, the user can also visit marker 4 since marker 5 is already connected according to overlap connectivity rule. Therefore, the set {2, 4, 7} is displayed. At step 7, the user connects marker 4. From there, the user can go to either marker 2 or marker 7 according to direct connectivity rule as displayed. At step 8, the user connects marker 2. Now, the only choice available is marker 7 according to direct connectivity rule which is displayed. At step 9, the user connects marker 7 and perform the release action resulting in generating and recording a pattern 385196427.
[045] Referring back to steps 608, 708, and 910 of FIG. 6A, FIG. 7A, and FIG. 9A respectively, the step of dividing the grid interface into four quadrants with currently connected marker as origin, and identifying reachable markers from the currently connected marker, are explained with reference to FIG. 10. As depicted in FIG. 10, at step 1, a 12 x 12 grid is divided into four quadrants and the first received and identified marker, based on the user inputs, is the marker with coordinates (5, 5). Further, as depicted in step 2 of FIG. 10, the set of unconnected reachable markers from first received and identified marker with coordinates (5, 5), for each of the four quadrants, is computed by using the pre-computed unique explorable directions denoted by coordinates (dx, dy) in real-time. Here, dx represents the number of steps taken along x- direction and dy represents the number of steps taken along y- direction.
In the first quadrant, dx = 0 and dy = 0,
In the second quadrant, dx = 0 and dy < 0,
In the third quadrant, dx > 0 and dy = 0 and
In the fourth quadrant, dx > 0 and dy > 0.
As depicted in step 1 of FIG. 10, the set of unconnected markers with coordinates (x, y), which are identified as reachable from first received and identified marker with coordinates (5, 5) in the first quadrant (dx = 0 and dy = 0), is provided below as:
Coordinates of marker (x, y) Marker number dx dy
(5,6) 67 0 1
(4,5) 54 -1 0
(4,6) 55 -1 1
(4,7) 56 -1 2
(4,8) 57 -1 3
(4,9) 58 -1 4
(4,10) 59 -1 5
(4,11) 60 -1 6
(3,6) 43 -2 1
(3,8) 45 -2 3
(3,10) 47 -2 5
(2,6) 31 -3 1
(2,7) 32 -3 2
(2,9) 34 -3 4
(2,10) 35 -3 5
(1,6) 19 -4 1
(1,8) 21 -4 3
(1,10) 23 -4 5
(0,6) 7 -5 1
(0,7) 8 -5 2
(0,8) 9 -5 3
(0,9) 10 -5 4
(0,11) 12 -5 6

As depicted in step 2 of FIG. 10, the set of unconnected markers (x, y) identified as reachable from marker (5, 5) in the second quadrant (dx = 0 and dy < 0) are given below:
Coordinates of marker (x, y) Marker
number dx dy
(5,4) 65 0 -1
(4,4) 53 -1 -1
(4,3) 52 -1 -2
(4,2) 51 -1 -3
(4,1) 50 -1 -4
(4,0) 49 -1 -5
(3,4) 41 -2 -1
(3,2) 39 -2 -3
(3,0) 37 -2 -5
(2,4) 29 -3 -1
(2,3) 28 -3 -2
(2,1) 26 -3 -4
(2,0) 25 -3 -5
(1,4) 17 -4 -1
(1,2) 15 -4 -3
(1,0) 13 -4 -5
(0,4) 5 -5 -1
(0,3) 4 -5 -2
(0,2) 3 -5 -3
(0,1) 2 -5 -4
(5,4) 65 0 -1
(4,4) 53 -1 -1
(4,3) 52 -1 -2

As depicted in step 3 of FIG. 10, the set of unconnected markers (x,y) identified as reachable from marker (5, 5) in the third quadrant (dx > 0 and dy = 0) are given below:
Coordinates of marker (x, y) Marker
number dx dy
(6,5) 78 1 0
(6,4) 77 1 -1
(6,3) 76 1 -2
(6,2) 75 1 -3
(6,1) 74 1 -4
(6,0) 73 1 -5
(7,4) 89 2 -1
(7,2) 87 2 -3
(7,0) 85 2 -5
(8,4) 101 3 -1
(8,3) 100 3 -2
(8,1) 98 3 -4
(8,0) 97 3 -5
(9,4) 113 4 -1
(9,2) 111 4 -3
(9,0) 109 4 -5
(10,4) 125 5 -1
(10,3) 124 5 -2
(10,2) 123 5 -3
(10,1) 122 5 -4
(11,4) 137 6 -1
(11,0) 133 6 -5
(6,5) 78 1 0

As depicted in step 4 of FIG. 10, the set of unconnected markers (x, y) identified as reachable from marker (5, 5) in the fourth quadrant (dx > 0 and dy > 0) are given below:
Coordinates of marker (x, y) Marker
number dx dy
(6,6) 79 1 1
(6,7) 80 1 2
(6,8) 81 1 3
(6,9) 82 1 4
(6,10) 83 1 5
(6,11) 84 1 6
(7,6) 91 2 1
(7,8) 93 2 3
(7,10) 95 2 5
(8,6) 103 3 1
(8,7) 104 3 2
(8,9) 106 3 4
(8,10) 107 3 5
(9,6) 115 4 1
(9,8) 117 4 3
(9,10) 119 4 5
(10,6) 127 5 1
(10,7) 128 5 2
(10,8) 129 5 3
(10,9) 130 5 4
(10,11) 132 5 6
(11,6) 139 6 1
(11,10) 143 6 5

[046] The illustrated steps of method 200 is set out to explain the exemplary embodiments shown, and it should be anticipated that ongoing technological development may change the manner in which particular functions are performed. These examples are presented herein for purposes of illustration, and not limitation.
[047] Experimental Results:
[048] The performance of the various methodologies is analyzed in terms of simulation results. FIGS. 11A, 11B and 11C depict graphs illustrating comparison of simulation results of the various methodologies for generating secure password pattern on 10x10, 20x20 and 30x30 grids, in accordance with some embodiments of the present disclosure. The simulation results provides graphical representation of running time of the various methodologies. The simulation results show that the methodology of FIGS. 7A and 7B is more efficient than the methodology of FIGS. 6A and 6B. The methodology of FIGS. 8A and 8B becomes more efficient than the methodology of FIGS. 7A and 7B, when a = 1/3 ~ 0.33 as shown in simulation results, wherein a is the number of connected markers in the pattern. As can be seen in below Table 2, an analysis of the running time of the various methodologies for generating secure password pattern is provided.
Methodology Pre-processing Reachable Set per dot
1 0 1.3921n2
2 n2log(n) 0.6079n2 + a
3 n2log(n) n2 – a
4 n2log(n) min(0.6079n2 + a, n2 – a)
Table 2

As depicted in Table 2, the methodology of FIGS. 6A and 6B for generating secure password pattern computes the set of reachable markers by visiting all possible markers in nxn grid. To count the number of times each marker is visited, the methodology of FIGS. 6A and 6B uses an Euler’s totient function, wherein, for,
f(1) + f(2) + … + f(n) ~ (3*n2)/(pi*pi)
f(k) is the Euler’s totient function that counts positive integers upto k which are co-prime to k. For example, f(5) = 4 and f(6) = 2. In nxn grid, each pair (i, j), 0 <= i < n and 0 <= j < n, such that GCD(i, j) = 1, represents a unique explorable direction, wherein (i, j) and (j, i) represent two different directions. Therefore, there are approximately, 2*(f(1) + f(2) + … + f(n)) ~ (6*n2)/(pi*pi) ~ 0.6079 * n2 unique explorable directions in nxn grid. So, in the methodology of FIGS. 6A and 6B, there are 0.6079 * n2 markers that are visited once and the remaining 0.3921 * n2 markers are visited twice. So, the total running time of the methodology of FIGS. 6A and 6B is
0.6079 * n2 + 2 * 0.3921 * n2
~ 0.6079 * n2 + 0.7842 * n2
~ 1.3921 * n2
[049] As already mentioned in the Table 2, there are 0.6079 * n2 unique explorable directions in nxn grid. Therefore, the methodology of FIGS. 7A and 7B requires to visit at least 0.6079 * n2 markers to compute the reachable set. If the number of markers connected in nxn grid is a, then in the worst case, the methodology of FIGS. 7A and 7B would require to visit 0.6079 * n2 + a markers. Initially, when a << n2 (a is small), the running time of the methodology of FIGS. 7A and 7B is approximately 0.6079 * n2. But, when the pattern becomes longer, say, a = 0.8 * n2, then the running time of the methodology of FIGS. 7A and 7B surpasses the running time of the methodology of FIGS. 6A and 6B and becomes 0.6079 * n2 + 0.8 * n2 = 1.4079 * n2 > 1.3921 * n2.
[050] The methodology of FIGS. 8A and 8B processes only unconnected markers to compute reachable set. Therefore, the time complexity of the methodology of FIGS. 8A and 8B is n2 – a, where a is the number of dots connected in the pattern. Initially when a is small, the running time of the methodology of FIGS. 8A and 8B is n2 which is greater than the running time of the methodology of FIGS. 7A and 7B (0.6079 n2). As a increases, the running time of the methodology of FIGS. 8A and 8B decreases. When a is between 0.2*n2 and 0.4*n2, 0.2 * n2 <= a <= 0.4 * n2, the running time of the methodology of FIGS. 7A and 7B surpasses the running time of the methodology of FIGS. 8A and 8B. So, the system proposes the methodology of FIGS. 9A and 9B also known as hybrid methodology, which executes the methodology of FIGS. 7A and 7B when a < 1/3 and switches to the methodology of FIGS. 8A and 8B when a >= 1/3. Alternatively, if the number of connected markers is greater than 1/3 then the methodology of FIGS. 7A and 8B is executed, otherwise, the methodology of FIGS. 8A and 8B is executed. Therefore, the running time of the methodology of FIGS. 9A and 9B or hybrid methodology never exceeds 0.6079n2 with a minimum value min (0.6079n2 + a, n2 – a).
[051] Hence the proposed system and method provides a secure visually guided mechanism for generating password pattern by providing assistance to user.
[052] The written description describes the subject matter herein to enable any person skilled in the art to make and use the embodiments. The scope of the subject matter embodiments is defined by the claims and may include other modifications that occur to those skilled in the art. Such other modifications are intended to be within the scope of the claims if they have similar elements that do not differ from the literal language of the claims or if they include equivalent elements with insubstantial differences from the literal language of the claims.
[053] It is to be understood that the scope of the protection is extended to such a program and in addition to a computer-readable means having a message therein; such computer-readable storage means contain program-code means for implementation of one or more steps of the method, when the program runs on a server or mobile device or any suitable programmable device. The hardware device can be any kind of device which can be programmed including e.g. any kind of computer like a server or a personal computer, or the like, or any combination thereof. The device may also include means which could be e.g. hardware means like e.g. an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or a combination of hardware and software means, e.g. an ASIC and an FPGA, or at least one microprocessor and at least one memory with software modules located therein. Thus, the means can include both hardware means and software means. The method embodiments described herein could be implemented in hardware and software. The device may also include software means. Alternatively, the embodiments may be implemented on different hardware devices, e.g. using a plurality of CPUs.
[054] The embodiments herein can comprise hardware and software elements. The embodiments that are implemented in software include but are not limited to, firmware, resident software, microcode, etc. The functions performed by various modules described herein may be implemented in other modules or combinations of other modules. For the purposes of this description, a computer-usable or computer readable medium can be any apparatus that can comprise, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
[055] The illustrated steps are set out to explain the exemplary embodiments shown, and it should be anticipated that ongoing technological development will change the manner in which particular functions are performed. These examples are presented herein for purposes of illustration, and not limitation. Further, the boundaries of the functional building blocks have been arbitrarily defined herein for the convenience of the description. Alternative boundaries can be defined so long as the specified functions and relationships thereof are appropriately performed. Alternatives (including equivalents, extensions, variations, deviations, etc., of those described herein) will be apparent to persons skilled in the relevant art(s) based on the teachings contained herein. Such alternatives fall within the scope and spirit of the disclosed embodiments. Also, the words “comprising,” “having,” “containing,” and “including,” and other similar forms are intended to be equivalent in meaning and be open ended in that an item or items following any one of these words is not meant to be an exhaustive listing of such item or items, or meant to be limited to only the listed item or items. It must also be noted that as used herein and in the appended claims, the singular forms “a,” “an,” and “the” include plural references unless the context clearly dictates otherwise.
[056] Furthermore, one or more computer-readable storage media may be utilized in implementing embodiments consistent with the present disclosure. A computer-readable storage medium refers to any type of physical memory on which information or data readable by a processor may be stored. Thus, a computer-readable storage medium may store instructions for execution by one or more processors, including instructions for causing the processor(s) to perform steps or stages consistent with the embodiments described herein. The term “computer-readable medium” should be understood to include tangible items and exclude carrier waves and transient signals, i.e., be non-transitory. Examples include random access memory (RAM), read-only memory (ROM), volatile memory, nonvolatile memory, hard drives, CD ROMs, DVDs, flash drives, disks, and any other known physical storage media.
[057] It is intended that the disclosure and examples be considered as exemplary only, with a true scope and spirit of disclosed embodiments being indicated by the following claims.
,CLAIMS:1. A processor implemented method for generating a secured password pattern, comprising:
(a) receiving, from a user, a gesture input on a nxn grid interface, wherein the nxn grid interface comprises a plurality of markers;
(b) identifying, based on the gesture input, a marker from the plurality of markers on the nxn grid interface;
(c) identifying and displaying, using a visual and guided mechanism, a set of unconnected reachable markers from the identified marker;
(d) determining a status corresponding to an action pertaining to the gesture input, wherein the status comprises a release action or a no-release action; and
based on the status, performing one of:
(e) receiving another gesture input on at least one unconnected reachable marker from the set and repeating the steps (b) through (d) ; or
(f) generating, using the visual and guided mechanism, a password pattern by identifying a path taken from the gesture input till a last gesture input that is identified based on the release action, wherein the identified path comprises a plurality of connected reachable markers.

2. The processor implemented method of claim 1, wherein the step of receiving gesture input is preceded by:
determining one or more co-prime pair of coordinates for each marker from the plurality of markers; and
determining, based on the one or more co-prime pair of coordinates, one or more unique explorable directions on the nxn grid interface for each of the plurality of markers.

3. The processor implemented method of claim 1, wherein the set of unconnected reachable markers is identified and displayed by applying one or more connectivity rules on the plurality of markers.

4. The processor implemented method of claim 3, wherein the one or more connectivity rules for creating the password pattern comprises:
(i) selecting at least four markers from the plurality of markers on the nxn grid interface;
(ii) refraining a connected marker for re-use;
(iii) enabling movement of the gesture input in straight direction only; and
(iv) connecting from a current marker to a new marker through a previously connected marker in the identified path.

5. The processor implemented method of claim 1, further comprising:
computing, at each gesture input from user, number of connected markers from the plurality of markers; and
performing a comparison of the number of connected markers with a pre-defined threshold.

6. The processor implemented method of claim 5, further comprising, based on the comparison:
performing one of:
(a) detecting, an unconnected marker from a current marker in one or more unique explorable directions that are previously determined; and
(b) associating the unconnected marker as a reachable marker in the one or more unique explorable directions that are previously determined; or
(i) determining a direction for each unconnected marker from the plurality of markers; and
(ii) identifying at least one unconnected marker as an unconnected reachable marker if the identified at least one unconnected marker is a first marker in the determined direction.

7. A system (100) for generating a secured password pattern, comprising:
a memory(102);
one or more communication interfaces(104); and
one or more hardware processors (106) coupled to said memory through said one or more communication interfaces, wherein said one or more hardware processors are configured to:
(a) receive, from a user, a gesture input on a nxn grid interface, wherein the nxn grid interface comprises a plurality of markers;
(b) identify, based on the gesture input, a marker from the plurality of markers on the nxn grid interface;
(c) identify and display, using a visual and guided mechanism, a set of unconnected reachable markers from the identified marker;
(d) determine a status corresponding to an action pertaining to the another gesture input, wherein the status comprises a release action or a no-release action; and
based on the status, said one or more hardware processors are further configured to perform one of:
(e) receive another gesture input on at least one unconnected reachable marker from the set and repeat the step (b) through (d); or
(f) generate, using the visual and guided mechanism, a password pattern by identifying a path taken from the gesture input till a last gesture input that is identified based on the release action, wherein the identified path comprises a plurality of connected reachable markers.

8. The system of claim 7, wherein prior to receiving the gesture input said one or more hardware processors are configured to:
determine one or more co-prime pair of coordinates for each marker from the plurality of markers; and
determine, based on the one or more co-prime pair of coordinates, one or more unique explorable directions on the nxn grid interface for each of the plurality of markers.

9. The system of claim 7, wherein the set of unconnected reachable markers is identified and displayed by applying one or more connectivity rules on the plurality of markers.

10. The system of claim 9, wherein the one or more connectivity rules for creating the password pattern are executed by said one or more hardware processors to:
(i) select at least four markers from the plurality of markers on the nxn grid interface;
(ii) refrain a connected marker for re-use;
(iii) enable movement of the gesture input in straight direction only; and
(iv) connect from a current marker to a new marker through a previously connected marker in the identified path.

11. The system of claim 7, wherein said one or more hardware processors are further configured to:
compute, at each gesture input from user, number of connected markers from the plurality of markers; and
perform a comparison of the number of connected markers with a pre-defined threshold.

12. The system of claim 11, wherein based on the comparison, said one or more hardware processors are further configured to:
perform one of:
(a) detect, an unconnected marker from a current marker in one or more unique explorable directions that are previously determined; and
(b) associate the unconnected marker as a reachable marker in the one or more unique explorable directions that are previously determined; or
(i) determine a direction for each unconnected marker from the plurality of markers; and
(ii) identify at least one unconnected marker as an unconnected reachable marker if the identified at least one unconnected marker is a first marker in the determined direction.