A note on Low Order assumptions in RSA groups

DOI10.21857/y54jofkjqmzbMath1482.94058OpenAlexW3196780870WikidataQ114591917 ScholiaQ114591917MaRDI QIDQ5025952

Péter Burcsi, István András Seres

Publication date: 7 February 2022

Published in: Sv. 25(2021)=knj. 60 (Search for Journal in Brave)

Full work available at URL: https://hrcak.srce.hr/file/380444

zbMATH Keywords

RSAverifiable delay functionslow order assumption

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Sieving by large prime factors
• Analysis of iterated modular exponentiation: The orbits of \(x^\alpha \mod N\)
• On the iteration of certain quadratic maps over GF(\(p\)).
• Verifiable delay functions
• On the cycle structure of repeated exponentiation modulo a prime
• Generic-group delay functions require hidden-order groups
• Efficient noninteractive certification of RSA moduli and beyond
• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Non-interactive cryptographic timestamping based on verifiable delay functions
• Integers free of prime divisors from an interval, I
• Approximately counting semismooth integers
• A method for obtaining digital signatures and public-key cryptosystems
• FACTORING VIA SUPERENCYRPTION
• Efficient verifiable delay functions

This page was built for publication: A note on Low Order assumptions in RSA groups