Відео

Actually, the Vietnam Ciphers was invented 35 years before he patented it Frank Miller, Sacramento banker and Stanford Director invented it. Nice video, thank you.

You have provided an extremely elegant summary of the fundamental idea. It is usually lost in most material: in the sea of computations for some or in that of lemmas and proofs for others. Thank you.

Too the man who inspired me to start my own UA-cam channel. You're awesome and I love your videos. I'd love to have you on my channel as a guest to discuss Quantum computing & Crypto. Let me know if you're instructed🙂.

I have a question. What if you assign 2 numbers for every letter in the Alphabet. When sending a message like "A" would be 34 so it could be 1231. The person or persons would have the same Alphabet with the same numbers an that could be any 2 numbers would that be a way to send a text securely. I got the idea from OTP using rows of 5 digits.

"You may only succeed if you desire succeeding; you may only fail if you do not mind failing." *Philippos

Easily understandable explanation, thank you!

Thank you Shardus, There are plenty of hard computation problems In fact we use them to design a quantum-proof digital currency. Guess who used it first: the government of China! Beloow some intro. More in BitMintcash.com The Algorithmic Mutations Advantage: LeVeL is Quantum Safe Algorithmic stagnation is the hidden fault in the sweeping success of crypto currencies, including those with CBDC aspirations. This fault is buried so deep in the annals of cryptographic scholastics that crypto users and financial mavens are oblivious to it, and keep cultivating their preferred crypto currency much as happy farmers who farm on the fertile slopes of a dormant volcano about to erupt. There is no excuse for a selecting committee to pick a digital currency platform to be of reliable long-term service, which has no good answer to the ticking bomb of the quantum threat. Some of those unprotected digital coins are very attractive on many counts, and some are very successful, traded by millions. Such glaring success can blind the uncareful evaluator, but should not sweep away the good judgment of the judges of this competition. We would like to assume that this competition is narrowed down to the few who have taken the quantum threat seriously and have developed an antidote. These few are the competitors that LeVeL is positioned to compete against. And that is the case that we make forth. 1 Ever since the cryptographic community agreed to the reality of the quantum threat, the community announced a global post-quantum cryptography campaign. Indeed a host of quantum-resistant digital money solutions have been published. We at LeVeL examined these post-quantum proposals and found out that they deploy the same strategy: building up an extended computational complexity to be too much of a hurdle against the quantum dragon. We consider this line of thought unproductive. The reason being: the quantum threat is developed behind veils of secrecy. The public knows only what quantum developers want the public to know and not more. You cannot be sure that a computation hurdle will be good enough to forestall an attacking computer you don’t know how fast it computes. The LeVeL team opted for an innovative turn. If you lock your treasure box with a lock, that would take 10 minutes for a locksmith to crack, then you cannot expose it for more than so many minutes. And it would not do, to sweat it and build a stronger lock, which will take 15 minutes for the locksmith to crack, or 20 or 30 minutes. What you can do though, is to fit your box with another lock, say every two minutes. Then, by the time the locksmith cracks the first lock, he will face five more locks, which will take him 50 minutes to crack, but in these 50 minutes you installed 25 more locks. On it goes -- you keep mutating the locks and guarding your treasure. That is the LeVeL quantum defense strategy. Turing machines (today's computers) are so much slower than quantum computers. They cannot compete with cracking codes, but they don't have to. These Turing machines are fast enough to install new codes to be cracked at a pace that will keep the quantum machine always behind. The LeVeL coin is fitted with another lock every time it changes hands. The more it trades, the more secure it is. Again: the innovative LeVeL solution is not based on adding more and more layers of complexity that eventually quantum computers will crack, but rather on using Turing machines to post more and more computational challenges to the much faster quantum predators, and safeguard digital commerce. The LeVeL advantage. 2

Very interesting. I suppose X1 and Y1 can be large primes and product could be the first question Q1. From a large set of randomly chosen large primes Alice could compute the set of questions very quickly. However this would be vulnerable to quantum computers. Maybe you can provide more details of the questions generated by Alice.

The example with a contract, I don’t see how cryptography could possibly enforce or verify the terms of a contract. You hire someone to paint your house. They say they did the job, you say they didn’t do it (or didn’t do a good job). How in the world could this dispute be resolved cryptographically without involving a third-party judge and legal system? In the example of health insurance, they could follow this process now if they wanted to, without the use of cryptography. I’m not sure what cryptography adds to the process. Health Insurance companies could certainly give a certificate to the patient and allow them to shop around right now. Seems like adding crypto would only complicate the process without adding any advantages.

Thank you so so much sir

'promo sm'

Hey Gideon great to see you again. Thanks for the inspiration by the way to create my own channel 😊👍

You really have a talent explaining things. Thank you

Suggested name: Rock & Poll 😂

That is brilliant!

I guess this is the clearest explaination of the proof I found on the internet, great job and thank you

I wish I could double like this video. All these years of trying to understand how RSA works and it is finally clear to me. Professor you have a gift of explaining things. Thanks for making this video.

brilliant explanation - thank you so much

Thank you very much!

Excellent video. Would like to ask 11:09 shows the joint probability, not the conditional probability. Should the formula be different?

You are gifted, the ability to break down such a complex topic in way that is so digestible is amazing. Thank you sir.

Very interesting that youtube showed me this after all this years. Very interesting channel. Bitcoin is dead, long live bitcoin.😅

what do u think about chaum's xxnetwork? its privacy and quantum resistant blockchain.. i really wanna listen to your opinion

I read the whitepaper and I am definitely going to buy the book!

Great video Professor! Thx from Mexico.

Hi Gideon, After going over, as much as I could, of the two papers dealing with BitFlip, I think it would be great to have a talk "straight from the horse's mouth" about attacks on BitFlip and their mitigations (problems with the 'naive' mode of operation and the various decoy and obfuscation strategies which are very interesting). This is discussed extensively in the papers but they are very math heavy and I think an intuitive guide would be really helpful, I may be in a small minority of people who want to see you dive deeper on those things, so I would understand if you don't find the time to do that :) However, it would be a great resource for those who want to, at some point in the future, adopt and/or investigate further the security properties of the protocol. All the best! Amit

חחחחחחחח איזה מלך לקח לי שנייה להבין למה אתה נשמע מוכר

quantum computing: im boutta end this mans whole career

The only professor, who doesn't use cookies and remembers his password from his UA-cam account in mind.

A role model for all central banks.

Superb!

Simple and powerful!

Great to see your videos again 👍🏼

so that means ( P^ke mod 2^100 )^kd mod 2^100 = P? Interesting...

Gosh, always overwhelmingly inspired by your passion and love for crypto

Would you recommend any books or resources about cryptography proofs? And your explanation is perfect

Very clear, thanks

Great to see you posting again. You were missed :-)

the problem of exchanging keys still remains. RSA is still nedeed !

The Hacker guy looks like if Owen Wilson had a baby with Tweety Bird.

The XOR swap algorithm is well known (and, obviously, reversible). It seems that what's needed is truly random generation of key values to encrypt. Tricky is for two parties to 'magically' initialise their random number generators to the same starting point, simultaneously contradicting the term "truly random"... With infinite resources, a 'hacker' could generate all possible decryptions, and then is left to sift through those hoping to find a plausible plaintext... The ciphertext "My aunt lost her shoes" could become "The tanks will roll out Monday" or "Tuna are needed for cold fusion"... (No, I haven't counted letters.) We all encode our thoughts with idiomatic influences (lexicon, grammar, 'jargon', accent, tone register, channel selection), all regulated to include/exclude others... Short of a Vulcan mind-meld, it seems to me that no communication can be made absolutely secure against a determined codebreaker. For example: "Pussy" doesn't mean 'pussy' to over half of American voters when said by someone who runs for president... Go figure...

Thank you. What was my very, very tentative grasp of the problem has, by your presentation, gained much 'substance'...

Very clear explanation. Thanks Prof. Gideon!

Get this man a marker. btw Thank you so much.

Thanks. Good explanation! Most ppl only explain the algo.

I think you are confusing congurnecr and equal signs.

Dude, you have random mod n appearing and disappearing. Love the idea of the video but there are big gaps.

This seems to miss the point that we need to exchange information about each other's keys ...

Have you heard of Cyber Polygon?