English
Related papers

Related papers: A Continued Fraction-Hyperbola based Attack on RSA…

200 papers

The growing complexity of Deep Neural Networks (DNNs) has led to the adoption of Split Inference (SI), a collaborative paradigm that partitions computation between edge devices and the cloud to reduce latency and protect user privacy.…

Computer Vision and Pattern Recognition · Computer Science 2025-08-29 Yixiang Qiu , Yanhan Liu , Hongyao Yu , Hao Fang , Bin Chen , Shu-Tao Xia , Ke Xu

Using password based authentication technique, a system maintains the login credentials (username, password) of the users in a password file. Once the password file is compromised, an adversary obtains both the login credentials. With the…

Cryptography and Security · Computer Science 2017-05-31 Nilesh Chakraborty , Samrat Mondal

We investigate the scalar, gravitational, and electromagnetic quasinormal mode spectra of Schwarzschild anti-de Sitter black holes using the numerical continued fraction method. The spectra have similar, almost linear structures. With a few…

General Relativity and Quantum Cosmology · Physics 2023-02-01 Ramin G. Daghigh , Michael D. Green , Jodin C. Morey

In this paper, we use a notion of ratio based on a division algorithm, to extend to a symmetric cone the definition of a continued fraction in its more general form. We then give a criteria of convergence of a non ordinary random continued…

Probability · Mathematics 2017-01-20 Abdelhamid Hassairi

The security of RSA algorithm depends upon the positive integer N, which is the multiple of two precise large prime numbers. Factorization of such great numbers is a problematic process. There are many algorithms has been implemented in the…

Cryptography and Security · Computer Science 2015-01-13 Nidhi Lal , Anurag Prakash Singh , Shishupal Kumar

The continued fraction method (also known as Leaver's method) is one of the most effective techniques used to determine the quasinormal modes of a black hole. For extremal black holes, however, the method does not work (since, in such a…

General Relativity and Quantum Cosmology · Physics 2016-08-22 Maurício Richartz

Cryptographic protocols are the cornerstone of security in distributed systems. The formal analysis of their properties is accordingly one of the focus points of the security community, and is usually split among two groups. In the first…

Logic in Computer Science · Computer Science 2011-05-10 Yannick Chevalier

We revisit Fermat's factorization method for a positive integer $n$ that is a product of two primes $p$ and $q$. Such an integer is used as the modulus for both encryption and decryption operations of an RSA cryptosystem. The security of…

Cryptography and Security · Computer Science 2009-10-23 Sounak Gupta , Goutam Paul

The algorithm of Shor for prime factorization is a hybrid algorithm consisting of a quantum part and a classical part. The main focus of the classical part is a continued fraction analysis. The presentation of this is often short, pointing…

History and Overview · Mathematics 2022-07-20 Johanna Barzen , Frank Leymann

In this study, we extend Leaver's continued fraction method to evaluate black hole quasinormal modes (QNMs) in systems where the effective potential exhibits a discontinuity. Besides the low-lying modes, we particularly focus on high…

General Relativity and Quantum Cosmology · Physics 2026-02-20 Guan-Ru Li , Jodin C. Morey , Wei-Liang Qian , Ramin G. Daghigh , Michael D. Green , Kai Lin , Rui-Hong Yue

Multidimensional Continued Fraction Algorithms are generalizations of the Euclid algorithm and find iteratively the gcd of two or more numbers. They are defined as linear applications on some subcone of $\mathbb{R}^d$. We consider…

Dynamical Systems · Mathematics 2015-11-30 Sébastien Labbé

Logic locking refers to a set of techniques that can protect integrated circuits (ICs) from counterfeiting, piracy and malicious functionality changes by an untrusted foundry. It achieves these goals by introducing new inputs, called key…

Cryptography and Security · Computer Science 2020-01-20 Deepak Sirone , Pramod Subramanyan

In some recent papers, the authors considered regular continued fractions of the form \[ [a_{0};\underbrace{a,...,a}_{m}, \underbrace{a^{2},...,a^{2}}_{m}, \underbrace{a^{3},...,a^{3}}_{m}, ... ], \] where $a_{0} \geq 0$, $a \geq 2$ and $m…

Number Theory · Mathematics 2019-01-01 James Mc Laughlin , Nancy J. Wyshinski

In this paper, we identify a new form of attack, called the Balance attack, against proof-of-work blockchain systems. The novelty of this attack consists of delaying network communications between multiple subgroups of nodes with balanced…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-01-02 Christopher Natoli , Vincent Gramoli

We propose the new rank-metric code-based cryptosystem LIGA which is based on the hardness of list decoding and interleaved decoding of Gabidulin codes. LIGA is an improved variant of the Faure-Loidreau (FL) system, which was broken in a…

Cryptography and Security · Computer Science 2020-05-19 Julian Renner , Sven Puchinger , Antonia Wachter-Zeh

We introduce the concept of Minkowski normality, a different type of normality for the regular continued fraction expansion. We use the ordering \[ \frac{1}{2},\quad \frac{1}{3}, \frac{2}{3},\quad \frac{1}{4}, \frac{3}{4},\frac{2}{5},…

Dynamical Systems · Mathematics 2019-02-28 K. Dajani , M. R. de Lepper , E. A. Robinson

Recent adversarial attack developments have made reinforcement learning more vulnerable, and different approaches exist to deploy attacks against it, where the key is how to choose the right timing of the attack. Some work tries to design…

Machine Learning · Computer Science 2022-05-03 Yang Li , Quan Pan , Erik Cambria

Recent years have witnessed the great success of deep learning algorithms in the geoscience and remote sensing realm. Nevertheless, the security and robustness of deep learning models deserve special attention when addressing…

Computer Vision and Pattern Recognition · Computer Science 2023-07-14 Nikolaus Dräger , Yonghao Xu , Pedram Ghamisi

The key-generation algorithm for the RSA cryptosystem is specified in several standards, such as PKCS#1, IEEE 1363-2000, FIPS 186-3, ANSI X9.44, or ISO/IEC 18033-2. All of them substantially differ in their requirements. This indicates that…

Cryptography and Security · Computer Science 2012-10-02 Daniel Loebenberger , Michael Nüsken

With the advancement of quantum computing, symmetric cryptography faces new challenges from quantum attacks. These attacks are typically classified into two models: Q1 (classical queries) and Q2 (quantum superposition queries). In this…

Quantum Physics · Physics 2025-08-04 Yan-Ying Zhu , Bin-Bin Cai , Fei Gao , Song Lin