Abstract:
The invention provides a solution for secure authentication of an individual. The invention comprises methods and apparatus for secure input of a user's identifier e.g. PIN. An image of a keypad is superimposed over an operable keypad within a display zone of a screen associated with an electronic device. The keypad image and/or the operable keypad are generated by the device using a scrambled or randomised keypad configuration generated on or at the electronic device. The configuration or order of keys depicted in the image may or may not be scrambled or randomised. Thus, the order of keys depicted in the image do not correspond to the order of the keys in the operable keypad, so that when the user selects a ‘key’ depicted in the image on the screen, the underlying operable keypad is caused to operate and an encoded version of the user's input is received into memory on the device. The encoded input can be sent for decoding on a remote computer. The keypad configurations used for generation of the operable keypad(s) and/or keypad image(s) are generated using an input. The input could be a true or pseudo random number or biometric data relating to a user of the device. The device may be a mobile phone, a tablet computer, laptop, PC, payment terminal or any other electronic computing device with a screen.
Abstract:
The invention provides a solution for secure authentication of an individual. The invention comprises methods and apparatus for secure input of a user's identifier e.g. PIN. An image of a keypad is superimposed over an operable keypad within a display zone of a screen associated with an electronic device. The keypad image and/or the operable keypad are generated by the device using a scrambled or randomised keypad configuration generated on or at the electronic device. The configuration or order of keys depicted in the image may or may not be scrambled or randomised. Thus, the order of keys depicted in the image do not correspond to the order of the keys in the operable keypad, so that when the user selects a ‘key’ depicted in the image on the screen, the underlying operable keypad is caused to operate and an encoded version of the user's input is received into memory on the device. The encoded input can be sent for decoding on a remote computer. The keypad configurations used for generation of the operable keypad(s) and/or keypad image(s) are generated using an input. The input could be a true or pseudo random number or biometric data relating to a user of the device. The device may be a mobile phone, a tablet computer, laptop, PC, payment terminal or any other electronic computing device with a screen.
Abstract:
A fully homomorphic method and system for randomizing an input, wherein all computations are over a commutative ring is described. Equivalent methods for performing the randomization using matrices and polynomials are detailed, as well as ways to mix the matrix and polynomial functions. Addition, multiplication, and division of the matrix and polynomial functions is further described. By performing computations of the functions modulo N over a ring ZN, the functions are usable as encryption functions. The method and system can also be used for verifying that a returned result of a calculation performed by a third party is valid for any of the calculations described herein. Related methods, systems, and apparatus are also described.
Abstract:
A computer system contains a module configured to receive a query, to request rows and columns from a data store, to add or remove rows in such a way that combinations of queries cannot be used to infer information about individuals in the data store. The module executes a statistical computation over the adjusted rows and columns to produce a perturbed answer so that neither the perturbed answer alone, nor repeats of the perturbed answer can be used to infer information about individuals in the data store.
Abstract:
To perform secret computation under a lower probability of success in falsification than before. Each of at least three arithmetic units 2 1 ,...,2 N comprises: a random number generating part determining a shared value [r] obtained by performing secret sharing of a random number r; a randomization part using a shared value [a 0 ],...,[a M-1 ] obtained by performing secret sharing of a value a 0 ,...,a M-1 and a shared value [r] to generate a randomized shared value ,..., with the shared value [a 0 ],...,[a M-1 ] and a shared value [a 0 r],...,[a M-1 r] as a pair; a secret computation part determining a concealed function value [F([a 0 ],...,[a M-1 ])] by executing a function F including at least one secret operation while including a randomized shared value which is an operation target and an operation result depending on the contents of secret operation into the checksum C:= ,..., ; and a correctness proving part verifying correctness of the function value [F([a 0 ],...,[a M-1 ])] on the basis of a shared value [Ø] obtained by multiplying a sum total of shared values [f i ] included in the checksum C by the shared value [r] and a shared value [È] which is a sum total of shared values [f i r] included in the checksum C.
Abstract:
A random wave envelope is created from a set of bounded random numbers by additively combining a triangle, a square and a sine wave. The random wave envelope is then used to create a sequence of wave random numbers from the wave envelope, which are used to generate random-variant keys for encryption in place of the pre-placed encryption key. An ambiguity envelope is thus created over the transmission of data packets as random-variant-keys are used that are distinct and separate for each packet and may also be distinct and separate for each incoming and outgoing packet. The random-variant keys are only created at the time of the actual use for encrypting or decrypting a data packet and not before and then discarded after one time use. The random-variant keys may be used in wireless network using wireless access points, cellular phone and data networks and ad hoc mobile wireless networks.
Abstract:
Various methods and systems related to chaos-based pseudo-random number generation are presented. In one example, among others, a system includes a pseudo¬ random number generator (PRNG) to generate a series of digital outputs and a nonlinear post processing circuit to perform an exclusive OR (XOR) operation on a first portion of a current digital output of the PRNG and a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output. In another example, a method includes receiving at least a first portion of a current output from a PRNG and performing an XOR operation on the first portion of the current PRNG output with a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output.
Abstract:
Techniques and mechanisms for generating a random number. In an embodiment, a first signal is received from a first cell including a first source follower transistor. Circuit logic detects for a pulse of the first signal and, in response to the pulse, generates a signal indicating detection of a first random telegraph noise event in the first source follower transistor. In another embodiment, a first count update is performed in response to the indicated detection of the first random telegraph noise event. The first count update is one basis for generation of a number corresponding to a plurality of random telegraph noise events.