Toward a code-breaking quantum computer
The most recent email you sent was likely encrypted using a tried-and-true method that relies on the idea that even the fastest computer would be unable to efficiently break a gigantic number into factors.
Quantum computers, on the other hand, promise to rapidly crack complex cryptographic systems that a classical computer might never be able to unravel. This promise is based on a quantum factoring algorithm proposed in 1994 by Peter Shor, who is now a professor at MIT.
As some researchers work to build larger quantum computers, others have been trying to improve Shor’s algorithm so it could run on a smaller quantum circuit. About a year ago, New York University computer scientist Oded Regev proposed a major theoretical improvement. His algorithm could run faster, but the circuit would require more memory.
In the long run, this new algorithm could inform the development of novel encryption methods that can withstand the code-breaking power of quantum computers.
Cracking cryptography
To securely transmit messages over the internet, service providers like email clients and messaging apps typically rely on RSA, an encryption scheme invented by MIT researchers Ron Rivest, Adi Shamir, and Leonard Adleman in the 1970s (hence the name “RSA”). The system is based on the idea that factoring a 2,048-bit integer (a number with 617 digits) is too hard for a computer to do in a reasonable amount of time.
That idea was flipped on its head in 1994 when Shor, then working at Bell Labs, introduced an algorithm which proved that a quantum computer could factor quickly enough to break RSA cryptography.
“That was a turning point. But in 1994, nobody knew how to build a large enough quantum computer. And we’re still pretty far from there. Some people wonder if they will ever be built,” says Vaikuntanathan.
It is estimated that a quantum computer would need about 20 million qubits to run Shor’s algorithm. Right now, the largest quantum computers have around 1,100 qubits.
A quantum computer performs computations using quantum circuits, just like a classical computer uses classical circuits. Each quantum circuit is composed of a series of operations known as quantum gates. These quantum gates utilize qubits, which are the smallest building blocks of a quantum computer, to perform calculations.
But quantum gates introduce noise, so having fewer gates would improve a machine’s performance. Researchers have been striving to enhance Shor’s algorithm so it could be run on a smaller circuit with fewer quantum gates.
#Professor, #Lecturer, #Scientist, #Scholar, #Researcher, #Analyst,
#BestTeacherAward, #BestPaperAward, #LifetimeAchievementAward, #YoungScientistAward, #OutstandingResearcherAward, #DistinguishedEducatorAward, #ExcellenceInTeachingAward, #InnovationInEducationAward, #BestThesisAward, #ExcellenceInMentoringAward, #LeadershipInEducationAward, #CommunityImpactAward, #OutstandingContributionToResearchAward, #BestStudentResearchAward, #ResearchCollaborationAward, #ScienceCommunicationAward, #AcademicIntegrityAward, #BestDissertationAward, #ExcellenceInPublicEngagementAward
International Young Scientist Awards Website link: youngscientistawards.com
NominationLink:https://youngscientistawards.com/awardnomination/ecategory=Awards&rcategoryrdee Contact Us: support@youngscientistawards.com
___________________________________
Social Media:
Twitter : https://twitter.com/youngsc06963908
Linkedin- : https://www.linkedin.com/in/shravya-r...
Pinterest : https://in.pinterest.com/youngscienti...
Blog : https://youngscientistaward.blogspot....
Tumblr : https://www.tumblr.com/blog/shravya9v
