Proof-of-quantum challenges
Pauli Group is using NFTs on proof-of-quantum.com to measure and protect the future of blockchains from quantum attacks.Why?Because along...
0
%
Satisfied Clients
Anchor’s smart contract wallet fortresses your assets against threats posed by today’s technology, and tomorrow’s. Our decentralized technology ensures your investments are safe, secure, and supported with advanced quantum-resistant infrastructures.
Featured on
A solution to the Post-quantum blockchain threat
BAD Crypto Podcast
The Truth about Quantum Computing
In our last episode we shared news of Google’s new Quantum computer, which raised all kinds of questions about breaking Bitcoin’s cryptographic code. While we were able to speculate a bit about what that means, we decided to invite a quantum physicist to the show to provide deeper insight.
The very specific method that Satoshi picked to sign the transactions… it turns out is 100 times easier to break that the one used by banks.
Pierre-Luc Dallaire-Demers– quantum physicist + Founder & CEO of Pauli Group
Blockchain North
Crypto's Next Biggest THREAT
Pierre-Luc and Flo discuss the threat of quantum on crypto projects, how crypto owners can stay secure, and what the future of regulation looks like amidst this looming threat of quantum computing…
Each time you sign a transaction on a blockchain, it uses a cryptographic method which can be broken by the quantum computers coming…
Pierre-Luc Dallaire-Demers– quantum physicist + Founder & CEO of Pauli Group
The Problem
Protecting Signatures On Blockchains
The imminent evolution of quantum computing threatens the security and integrity of your data, and will soon be after your crypto encryptions. Elliptic curve cryptography is the Achilles heel of web3 and jeopardizes your ownership, privacy, and autonomy.
A large enough quantum computer can recover the private key from the public key.
Sign up for Updates and Exclusive Perks!
Be up to date with the latest news, giveaways, contests and possible airdrops 😉
In the meantime, join us on Discord
The Pauli Group Solution
Decentralized quantum resistant signature verification
But quantum computing won’t have an upper hand at breaking a Lamport signature. Our smart contract wallet uses compact post-quantum signature schemes to safeguard assets from quantum computers. We deploy Lamport signature functions across all ETH and EVM blockchains to strengthen security, move funds, and create and manage tokens and currency.
Our code is open source. Visit our GitHub
The Problem
Anchor Wallet brings trusted security to the blockchain
Safe first, sorry never.
Protect your assets from the regret of hindsight with our (quantum-proof) smart contract wallet.
Long-term storage of digital assets
Quantum-resistant signatures are the future of secure blockchain. Create your wallet now.
Simple and Effective
Simply minting your smart contracts future-proofs your blockchain assets seamlessly, invisibly, and quickly by anchoring your signature on the blockchain.
Your keys. Your crypto.
Your keys are your property and will remain that way. No one can access your info, you can’t access theirs.
Store crypto and NFTs in one place.
You only need one physical wallet, and the same goes for your digital one.
Truly Decentralized
Anchor Wallet puts the power back into your wallet. Only you have exclusive control over your funds so you’re the main authority over your financial future.
Testimonials
What Our Clients Say About Crasoft
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua
Businessman
Lorem ipsum dolor sit amet, consectet adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore
Marketing
Lorem ipsum dolor sit amet, consectet adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore
Entrepreneur
Lorem ipsum dolor sit amet, consecte adipiscing elit, sed do eiusmod tempor inci
0
+
Best Features
Lorem ipsum dolor sit amet, consecte adipiscing elit, sed do eiusmod tempor inci
0
+
Trusted Company
Lorem ipsum dolor sit amet, consecte adipiscing elit, sed do eiusmod tempor inci
0
+
Top Countries
Lorem ipsum dolor sit amet, consecte adipiscing elit, sed do eiusmod tempor inci
Our Pricing
Choose The Right Plan For You
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua
$49,9/month
Personal Plan
Lorem ipsum dolor sit amet, consectetur adipisci elit
- 5 Analytics Campaigns
- Marketing Automation
- 300 Keywords for SEO
- 24/7 Customer Support
$189,9/month
Professional Plan
Lorem ipsum dolor sit amet, consectetur adipiscing elit
- 25 Analytics Campaigns
- Marketing Automation
- 300 Keywords for SEO
- Campaign Reporting
- 24/7 Customer Support
$99,9/month
Business Plan
Lorem ipsum dolor sit amet, consectetur adipiscing elit
- 15 Analytics Campaigns
- Marketing Automation
- 300 Keywords for SEO
- 24/7 Customer Support
Quantum secure Multi-sig NFT platform coming soon...
Sign up and get notified of the launch!
How anchoring works:
Quantum computers were not considered to be likely built in the 21st century when secp256k1 was chosen as the signature method for Bitcoin in 2008. secp256k1 is one type of public key cryptography method (which is analogous to sharing an opened lock to a friend, who locks a message in a box and only you have the key to open the lock and read the message). A public key on the secp256k1 elliptic curve can be broken for its private key by Quantum Computers in less than a day. Our wallet upgrades/protects your ETH and EVM blockchains now so you don’t lose later.
Current quantum computers are very noisy, but are steadily getting less noisy as hardware improves. In the next 2 years, we’ll reach the point where experimental methods can use all those noisy qubits to encode “logical” qubits with even less noise. This exponential suppression of noise and errors is called “fault-tolerance”. In itself, this is not sufficient to break the current cryptography of blockchains, but is a complete prototype for future devices. There are few applications for those intermediate quantum computers other than validating simple quantum algorithms that can be replicated (at large cost) on classical computers. This regime is what we refer to as “early fault-tolerant experiments”. The larger and bigger devices that will be built subsequently are the ones that will become increasingly threatening for cryptography.
Current quantum computers are very noisy, but are steadily getting less noisy as hardware improves. In the next 2 years, we’ll reach the point where experimental methods can use all those noisy qubits to encode “logical” qubits with even less noise. This exponential suppression of noise and errors is called “fault-tolerance”. In itself, this is not sufficient to break the current cryptography of blockchains, but is a complete prototype for future devices. There are few applications for those intermediate quantum computers other than validating simple quantum algorithms that can be replicated (at large cost) on classical computers. This regime is what we refer to as “early fault-tolerant experiments”. The larger and bigger devices that will be built subsequently are the ones that will become increasingly threatening for cryptography.
PG Measures threat and protects against it the wallet. Given the advancement of hardware roadmaps, milestones, and the resource requirements for breaking secp256k1, it can be estimated that quantum computers will be able to break blockchains by 2031-2033. We’ve deployed challenges to directly measure the progress of quantum computers at breaking the cryptography of blockchains to use this data to refine and calibrate our risk models. (measurement down on proofofquantum.com)
The security of the elliptic curve depends on the difficulty of solving discrete and uncommon logarithm problems, which quantum computers can do easily. A better known, widely used public key cryptography method is RSA. RSA security rests on the difficulty of factoring large numbers, which quantum computers are also good at. For the current implementations, secp256k1 is easier to break with quantum computers than the commonly-used security benchmark, RSA-2048. RSA-2048 will likely break a few months after secp256k1. When we hear “quantum computers are good at factoring”, this is often in reference to breaking the security of RSA. For blockchains the equivalent statement is that “quantum computers are good at discrete logarithms”. The fact that there is more jargon involved may partially explain why the problem is not well known for blockchains.
Blog
Lates Blog & Articles
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua
Partners
About Quantum Computing
Understanding the power and impact of quantum computing.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.
Play Video
The Problem
Eliptic curve cryptography is the Achille's heel of web3.
Blockchain Eliptic Curve
Sollicitudin massa maecenas purus adipiscing egestas natoque fringilla odio ac sodales
Empirical Risk Assessment
Sollicitudin massa maecenas purus adipiscing egestas natoque fringilla odio ac sodales
Current Best Estimates
Sollicitudin massa maecenas purus adipiscing egestas natoque fringilla odio ac sodales
Early Fault-Tolerant Experiments
Sollicitudin massa maecenas purus adipiscing egestas natoque fringilla odio ac sodales
Projections For Breaking RSA
Sollicitudin massa maecenas purus adipiscing egestas natoque fringilla odio ac sodales
secp256k1
Sollicitudin massa maecenas purus adipiscing egestas natoque fringilla odio ac sodales
The Pauli Group Solution
With great power comes great responsibility.
Quantum Computing Threat
Sollicitudin massa maecenas purus adipiscing egestas natoque fringilla odio ac sodales
Solution Implementation
Sollicitudin massa maecenas purus adipiscing egestas natoque fringilla odio ac sodales
Securing Vulnerability
Sollicitudin massa maecenas purus adipiscing egestas natoque fringilla odio ac sodales
Community Buzz
What industry leading companies are saying
Community Buzz
What industry leaders are saying
FAQ
Frequently Ask Questions
Lorem ipsum dolor sit amet, consectetur adipiscing elit.
Quantum computers are physical devices that harness the laws of quantum mechanics to efficiently solve some types of problems that would otherwise take ages on machines designed to operate only from classical physics principles.
Quantum computers will have the ability to recover the private keys from the public keys stored on blockchains. Almost all blockchains use elliptic curve cryptography for signing transactions on a ledger. While elliptic curve cryptography cannot be hacked with a classical computer, it is one of the easiest methods to break with a large enough quantum computer using Shor's discrete logarithm algorithm.
Quantum computers will have the ability to recover the private keys from the public keys stored on blockchains. Almost all blockchains use elliptic curve cryptography for signing transactions on a ledger. While elliptic curve cryptography cannot be hacked with a classical computer, it is one of the easiest methods to break with a large enough quantum computer using Shor's discrete logarithm algorithm.
secp256k1 refers to the parameters of the elliptic curve used in Bitcoin's public-key cryptography, and is defined in Standards for Efficient Cryptography (SEC) (Certicom Research, http://www.secg.org/sec2-v2.pdf). Currently Bitcoin uses secp256k1 with the ECDSA algorithm, though the same curve with the same public/private keys can be used in some other algorithms such as Schnorr.
secp256k1 was almost never used before Bitcoin became popular, but it is now gaining in popularity due to its several nice properties. Most commonly-used curves have a random structure, but secp256k1 was constructed in a special non-random way which allows for especially efficient computation. As a result, it is often more than 30% faster than other curves if the implementation is sufficiently optimized. Also, unlike the popular NIST curves, secp256k1's constants were selected in a predictable way, which significantly reduces the possibility that the curve's creator inserted any sort of backdoor into the curve.
secp256k1 was almost never used before Bitcoin became popular, but it is now gaining in popularity due to its several nice properties. Most commonly-used curves have a random structure, but secp256k1 was constructed in a special non-random way which allows for especially efficient computation. As a result, it is often more than 30% faster than other curves if the implementation is sufficiently optimized. Also, unlike the popular NIST curves, secp256k1's constants were selected in a predictable way, which significantly reduces the possibility that the curve's creator inserted any sort of backdoor into the curve.
P2PK addresses on Bitcoin (for which the public key is recorded on the blockchain) are at imminent risk.
The Pauli Group solution: assess the risk empirically with application benchmark challenges that can be used to measure the progress of the large-scale integration of quantum computing systems. Specifically, these benchmarks will take the form of challenge for near- and mid-term fault-tolerant devices meant to quantitatively assess the risks of cryptographic assets.
Lorem ipsum dolor sit amet, consectet adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore