Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

``Quantum-Computing''(Q-C) = Simple-Arithmetic Since Digits = Quanta/Bosons Via Algebraic-INVERSION 1881(<1901-05-25) of Digits On-Average Logarithmic-Law = ONLY BEQS!!!

Ermakov Pi, Edward Carl-Ludwig Siegel

Published Mar 22, 2011• 0 citations
OpenAlex

Related papers

Multi-digit arithmetic in sequential, parallel and quantum computational models

V. K. Zadiraka, Andrii Tereshchenko, Інна Віталіївна Швідченко

Physico-mathematical modelling and informational technologies•Jul 1, 2023•2 citations

DIGIT-PHYSICS: Digits Are Bosons Are Quanta Because (On Average) Quanta and Bosons Are and Always Were Digits!!!;Contra Wigner, ``On the Unreasonable Effectiveness of \textbf{\textit{Physics in}} Mathematics!''; Do Physics-NECESSARY-Averages Equal or VS. DIGITS-Log-LawS(!!!) Averages???

Hermon Chernoff, Edward Carl-Ludwig Siegel, Marvin Antonoff +2 more

Bulletin of the American Physical Society•Mar 19, 2013•0 citations

Quantum Computing for Discrete Logarithms

Song Yuan Yan

Springer eBooks•Jan 1, 2015•3 citations

DIGIT-PHYSICS: Digits Are Bosons Are Quanta Because (On Average) Quanta and Bosons Are and Always Were Digits!!! DIGITS?: For a Very Long Time Giving Us All The FINGER!!!

Edward Carl-Ludwig Siegel, Simon Newcomb, John William Strutt-Rayleigh +4 more

Bulletin of the American Physical Society•Mar 4, 2015•0 citations

Algorithms for quantum computation: Discrete log and factoring

Peter W. Shor

•Jan 1, 1994•269 citations

Number-theoretic foundations of post-quantum cryptographic protocols

Osama Rawi, M. Thamizhsudar, N. Nivetha +4 more

Conventional cryptographic systems such as factorization and discrete logarithm problems are threatened by the quick development of quantum computing.This paper offers a thorough study of number-theoretic problems and structures underlying post-quantum cryptographic protocols based on modular arithmetic, algebraic structures, lattices and computational hardness assumptions.The research is based on the mathematical problems of Learning with Errors (LWE) and Short Integer Solution (SIS) which are used for secure quantum-resistant encryption, digital signature and key exchange mechanisms.In secure communication scenarios, a framework of structured protocol is analyzed, which combines lattice-based operations and modular polynomial transformations.Experimental comparisons show that these schemes are not only practically efficient in computation but also have a level of security greater than 95% @ E-mail:

Journal of Discrete Mathematical Sciences and Cryptography•Oct 31, 2026•0 citations
Conventional cryptographic systems such as factorization and discrete logarithm problems are threatened by the quick development of quantum computing.This paper offers a thorough study of number-theoretic problems and structures underlying post-quantum cryptographic protocols based on modular arithmetic, algebraic structures, lattices and computational hardness assumptions.The research is based on the mathematical problems of Learning with Errors (LWE) and Short Integer Solution (SIS) which are used for secure quantum-resistant encryption, digital signature and key exchange mechanisms.In secure communication scenarios, a framework of structured protocol is analyzed, which combines lattice-based operations and modular polynomial transformations.Experimental comparisons show that these schemes are not only practically efficient in computation but also have a level of security greater than 95% @ E-mail: