• Passa alla navigazione primaria
  • Passa al contenuto principale
  • Passa alla barra laterale primaria
  • Passa al piè di pagina

Joao Carlos Leandro da Silva

  • RESEARCH
    • Cryptography – design new codes
    • Cryptanalysis – break existing codes
    • Cybersecurity – identify cyberweapons
    • Algorithm development – develop a new algorithm
  • SERVICES
    • Consulting – individual or other
    • Writing – technical or creative
    • Speaking – private or public
  • PRODUCTS
    • Book – The Rainbow of Primes
  • TECHNOLOGY
    • Algorithm – 3D cryptography
    • Algorithm – 3D integer factorization
    • Software – Graphical Integer Factorization Technique
  • IDEAS
    • Patternprimes = Pattern among the prime numbers
    • 3Dintegers = Three-dimensional integers
    • 3Dlanguage = Three-dimensional language
    • Gameprimes = Game involving prime numbers
    • Imes3D = I message in three-dimensions
    • My3Dsms = My three-dimensional SMS
    • SMSgoes3D = SMS goes three-dimensional
  • PARTNERS
    • Partners
  • INVESTORS
    • Investors
3D integer factorization

Algorithm – 3D integer factorization

I am a one person company (OPC) that does research in both cryptography and cryptanalysis with the aim to create new products and/ or services.

3D integer factorization.

We propose a new view for integer factorization based on a radical design. In the traditional model, the computer experiment consists of physical devices (hardware) which in turn contain programs (software) that run an algorithm equivalent to some mathematical theory.
In the present model, the mathematical theory corresponds to a finite set of basic algorithms distributed among the hardware and all of these constitute the computer experiment itself. All of the currently known factoring algorithms consist of several steps in order to find any non-trivial factor. Such algorithms may run on a single or many machines.
Our method is a single step – the generation of a multiple of any prime factor. Consequently, factoring reduces to searching efficiently for one such multiple. If the given modulus has m decimal digits then m-squared machines are required. The resulting search experiment is a square matrix of m-by-m computers. This method is deterministic and revolves around finding a three-dimensional point (x, y, z) that will lead to a successful factorization.

Algorithm – 3D cryptography
Software – Graphical Integer Factorization Technique

Archiviato in:TECHNOLOGY

Interazioni del lettore

Lascia un commento Annulla risposta

Il tuo indirizzo email non sarà pubblicato. I campi obbligatori sono contrassegnati *

Barra laterale primaria

Footer

Joao Carlos Leandro Da Silva

© Joao Carlos Leandro da Silva

Via Medole 22, 46043 Castiglione delle Stiviere (MN) - Italy
P.I. 02298830205

Tel/Fax +39 0376 944100
Email: joaodasilva@rainbowofprimes.com

ResearchGate Terms of use Privacy

  • About me
  • Contact me
  • Company News

Powered by studiopz.net