- Revilla, M., & Höhne, J. K. (2020). How long do respondents think online surveys should be? New evidence from two online panels in Germany. International Journal of Market Research, 62(5), 538–545. https://doi.org/10.1177/1470785320943049
- Introduction
- Previous research suggests that longer surveys, especially online, lead to reduced response rates, shorter answers, and less variability in multiple choice responses.
- Revilla and Ochoa (2017) conducted an opt-in panel in Mexico to determine the ideal length of an online survey. Most participants preferred surveys about 10 minutes long, and most said they would not fill out a survey longer than 20 minutes.
- The only socioeconomic factor which induced variability in these opinions was age, with older participants willing to fill out longer surveys.
- Koops, B.-J. (2013, February). Overview per country. Overview per Country. Retrieved December 12, 2021, from http://www.cryptolaw.org/cls2.htm
- France had in place severe restrictions on the domestic use of cryptography until as recently as 1999.
- In Iran and China, a license is still required for the use of cryptography.
- minutephysics. (2019). How Quantum Computers Break Encryption | Shor’s Algorithm Explained. YouTube. Retrieved December 14, 2021, from https://www.youtube.com/watch?v=lvTqbM5Dq4Q.
- It’s very easy to multiply prime numbers, but VERY hard to find the prime factors of a large number.
- Anyone with a working quantum computer today would pose a major security threat to the entire internet.
- This is because of Shor’s Algorithm
- “Encrypting data isn’t a guarantee of protection. It’s a way of making it harder to access.”
- Shor’s algorithm starts with a bad guess of a number that might share a factor, then through a process only possible in an efficient way on a quantum computer, turns it into a much better guess which almost certainly shares a factor.
- Scenario:
- N = big prime (N = a*b)
- g = a guess which may share a factor with N (g = a*c)
- For any numbers which have no common factor, you can multiply one number by itself a certain number of times to get a multiple of B + 1
- AP = m * B + 1
- Better guesses from Shor’s: g -> gP/2 ± 1
- Three problems with these guesses
- One might be c*N, making the other a factor of m not N
- P might be an odd number, making our power a fraction and the resulting number a fraction (bad)
- 37.5% of the time neither of these happen