Picturing randomness on a graphics supercomputer

Pickover, Clifford A.

doi:10.1147/rd.351.0227

Cited by 7 publications

(2 citation statements)

References 5 publications

(5 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed improved method is, in our modest opinion, a novelty in producing strong passwords that was not seen for years, maybe ever since the invention of graphical passwords in 1990s [73,74]. "The idea of PsychoPass is that a password can be created, memorized and recalled by just thinking of an action sequence instead of a word or string of characters" [72].…”

Section: A Psychopass Methodsmentioning

confidence: 99%

Brute force analysis of PsychoPass-generated Passwords

Brumen

Černezel

2014

2014 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)

View full text Add to dashboard Cite

Background: Recently, Cipresso et al proposed a novel method for generating textual passwords. The PsychoPass password can be created, memorized and recalled by thinking of an action sequence instead of a string of characters.Objective: The objective of this paper is to analyze how and when the PsychoPass passwords are resilient to brute force attacks and how they compare to randomly generated ones.Methods: The PsychoPass method was studied analytically. The number of possible different passwords that can be created using PsychoPass method was calculated for different possible settings.Results: The PsychoPass generates passwords that are resilient to brute force attacks with password lengths comparable to those generated randomly. A PsychoPassgenerated password with 18 characters is as strong as a completely randomly generated password of length 11 characters with mixed upper and lowercase letters, numbers and symbols, but can easily be remembered. Conclusion: The PsychoPass method is an alternative to the existing passwords and is resilient to brute force attack.There is no known dictionary to enable the dictionary attack. The PsychoPass passwords look like random ones, eg. »aEy|dX%7Tu]6hJ«, but a user can easily remember it based on the action sequence instead of remembering its characters.

show abstract

Section: A Psychopass Methodsmentioning

confidence: 99%

Brute force analysis of PsychoPass-generated Passwords

Brumen

Černezel

2014

2014 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)

View full text Add to dashboard Cite

show abstract

“…Today it is widely acknowledged that certified randomness can be a valuable resource (e.g., for testing primality [13,14]), and that under various circumstances a lack of randomness may have negative consequences (e.g., erroneous numerical calculations [15]). The pitfalls of software-generated pseudo-randomness [16] are well-known [15,[17][18][19]. In John von Neumann's words [20]: "Anyone who considers arithmetical methods of producing random digits is, of course, in a state of sin."…”

Section: Introductionmentioning

confidence: 99%

How Random Is Quantum Randomness? An Experimental Approach

Calude,

Dinneen,

Dumitrescu

et al. 2009

Preprint

View full text Add to dashboard Cite

Our aim is to experimentally study the possibility of distinguishing between quantum sources of randomness-recently proved to be theoretically incomputable-and some well-known computable sources of pseudo-randomness. Incomputability is a necessary, but not sufficient "symptom" of "true randomness."We base our experimental approach on algorithmic information theory which provides characterizations of algorithmic random sequences in terms of the degrees of incompressibility of their finite prefixes. Algorithmic random sequences are incomputable, but the converse implication is false. We have performed tests of randomness on pseudo-random strings (finite sequences) of length 2 32 generated with software (Mathematica, Maple), which are cyclic (so, strongly computable), the bits of π, which is computable, but not cyclic, and strings produced by quantum measurements (with the commercial device Quantis and by the Vienna IQOQI group). Our empirical tests indicate quantitative differences, some statistically significant, between computable and incomputable sources of "randomness."

show abstract

Random number generators: Pretty good ones are easy to find

Pickover

1995

The Visual Computer

View full text Add to dashboard Cite

Picturing randomness on a graphics supercomputer

Cited by 7 publications

References 5 publications

Brute force analysis of PsychoPass-generated Passwords

Brute force analysis of PsychoPass-generated Passwords

How Random Is Quantum Randomness? An Experimental Approach

Random number generators: Pretty good ones are easy to find

Contact Info

Product

Resources

About