This blog post will provide announcements and insights on the updates and progress that has been made by the Abelian Foundation, and the technological advancements and upcoming changes to look forward to from the second week of April, 2024.

Things to Look Forward to:

New Update for Abelian Pro Mobile Wallet: Customizable Gas Fees and Enhanced Transaction Prioritization

This week, the tech team was working on an update for the Abelian Pro mobile wallet. The update includes a couple of fine touches for bug fixes and a new feature which will allow users to set the gas fee for each transaction. Currently, the gas fee for each transaction is hardcoded to 0.05 ABELs (or 500,000 Neutrinos) where 1 ABEL is 10⁷ Neutrinos. With this new feature, users can set the gas fee in the range from 0.005 ABEL (namely, 50,000 Neutrinos) to 0.1 ABEL. The more gas fee a user pays for a transaction, the higher priority the transaction would have. This implies that the faster and more likely the transaction will be recorded onto the Blockchain, hence, completing the transaction in a shorter period of time. On the other side, if the gas fee is low, the transaction will have a lower priority to be written onto the blockchain when compared with other transactions with higher gas fees. Hence it will take longer time to complete the transaction.

The tech team is working hard to develop more features for users to manage and transact their ABELs using this secure and non-custodial mobile wallet. Please stay tuned for the release of this new version.

The Abelian Pro be available for download on both Apple App Store and Android Play Store. It can also be found at the Abelian Foundation’s official download page

Insights

Breakthrough in Quantum Algorithms for Lattice Problems: Implications for Abelian’s Security

Prof. Yilei Chen from Tsinghua University has published a paper at titled Quantum Algorithms for Lattice Problems describing an efficient quantum algorithm for solving the Learning With Errors (LWE) problem. LWE is the underlying security assumption of lattice-based cryptosystems. Solving LWE means breaking lattice-based cryptosystems but in practice, it is not that simple. Below is the elaboration. An efficient quantum algorithm means an algorithm which can solve a problem efficiently and practically if there exists a universal quantum computer, which is expected to be able to build the first but not so powerful one for breaking elliptic curve cryptosystems in 5 to 10 years time from now. At this moment, if Prof. Chen’s algorithm is correct with all proofs verified to be correct, this implies that we are getting close to showing that lattice-based cryptosystems are not much more difficult to crack than those based on factoring or discrete logarithm under the quantum era. It may take a few months or more for the proofs to be verified. Then if it is true, NIST may have to restart the Post-Quantum Cryptosystem (PQC) selection. If so, the underlying lattice-based algorithms of Abelian has to be changed as well. However, as Prof. Chen says, his algorithm does not imply the breaking of Kyber/Dilithium parameters yet. Nevertheless, the fact is that the lattice-based cryptosystems in practice are still multi-fold much harder to break in the quantum era than factoring or discrete logarithm based, for example, those elliptic curve cryptosystems. Also, this quantum algorithm is not able to break Kyber/Dilithium parameters. In a nutshell, lattice-based cryptosystems used by Abelian are still “quantumly” harder to be cracked when compared with all the existing non-quantum-safe elliptic curve based schemes. For the illustration purpose, if we say 100,000 qubits are needed to crack elliptic curve based cryptographic schemes, then it requires more than 10,000,000,000 qubits to crack a lattice-based counterparty.

The Abelian research team will keep a close eye on this research work and keep all of our supporters posted on updates and our insights.

Read our latest in-depth Medium blog about Quantum Algorithms for Lattice Problems and it’s implications on Abelian’s security:

Breakthrough in Quantum Algorithms for Lattice Problems: Implications for Abelian’s Security

Prof. Yilei Chen’s research on quantum algorithms for LWE poses theoretical risks to lattice cryptography, previously…

pqabelian.medium.com

Ifyou are interested in learning more about how Shor’s quantum algorithm can make use of quantum computer to break factorization problem, and hence discrete logarithm problem, the following link is a good video explaining that clearly:

‍

‍