Generating and decoding Hamming codes
Wolfram Community » Cryptography
by Peter Burbery
16h ago
&[Wolfram Notebook][1] [1]: https://www.wolframcloud.com/obj/32f4a824-15cc-4631-bb8a-ac2336b07afc ..read more
Visit website
[R&DL] Wolfram R&D LIVE: application of ZeroKnowledgeProofs paclet for web authentication
Wolfram Community » Cryptography
by Armando Benjamín Cruz Hinojosa
16h ago
*MODERATOR NOTE: This is the notebook used in the livestream "Zero Knowledge Authentication" on Wednesday, February 28 -- a part of Wolfram R&D livestream series announced and scheduled here: https://wolfr.am/RDlive. Subscribe to [**@WolframRD**] (https://wolfr.am/1eatWLcDA) on YouTube for more livestreams, exclusive VODs, creator presentations, behind-the-scenes insider videos, and so much more.* &[Wolfram Notebook][1] [1]: https://www.wolframcloud.com/obj/3527b65f-c631-4e1a-87a8-f715771f3e87 ..read more
Visit website
Simple equations that approximate semiPrime factors. Lots of them. Graphing to find estimate.
Wolfram Community » Cryptography
by Bobby Joe Snyder
5d ago
&[Wolfram Notebook][1] [1]: https://www.wolframcloud.com/obj/48038383-2ffb-4a07-8e1f-b60d64d62472 Clear[x, pnp] pnp = 2564855351 Show[ Plot[(( (((pnp^2/x) + x^2)) / x) /pnp), {x, 0, 60000}] ] Plot[((pnp - (Sqrt[(x^2 * pnp^4 + 2 *pnp*x^5) + x^8])/ pnp^4 - (1 - (x^2/(2*pnp))) *(pnp^2/x^2))), {x, 40000, 60000}] Plot[(1/((pnp / (((pnp^2/x) + x^2)) / x))), {x, 0, 60000}] The middle equation crosses the x-axis at zero where x is 41227 the smaller Prime factor of pnp. These equations approximate x and y where pnp = x*y. The larger the pop however the more factors to test. But the graph gives a st ..read more
Visit website
The German Enigma Enciphering Machine
Wolfram Community » Cryptography
by Charles Stevens
2M ago
![enter image description here][1] &[Wolfram Notebook][2] [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=fw54hsdvsasdadsfv.jpg&userId=11733 [2]: https://www.wolframcloud.com/obj/42077220-2fbc-44d5-b411-7de6967733ac ..read more
Visit website
Diophantine imaging reveals the broken symmetry of sums of integer cubes
Wolfram Community » Cryptography
by Eldar Sultanow
3M ago
![enter image description here][1] ![enter image description here][2] &[Wolfram Notebook][3] [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=Main2.gif&userId=20103 [2]: https://community.wolfram.com//c/portal/getImageAttachment?filename=4320Hero2.png&userId=20103 [3]: https://www.wolframcloud.com/obj/ff2658c6-1dac-4589-b0d2-f0a90a9e5def ..read more
Visit website
Creates a matching public key for the given private key
Wolfram Community » Cryptography
by AA AA
3M ago
Can someone explain to me how to work with this command? Giving a private key to the input and getting the public key to the output Ethereum network . PublicKey[PrivateKey[...]] [PublicKey][1] Thanks...... [1]: https://reference.wolfram.com/language/ref/PublicKey.html ..read more
Visit website
Seeking advice for a new cryptographic tech, to be used for daily privacy protection
Wolfram Community » Cryptography
by Ruby He
4M ago
Hi there, I wish to present a new cryptographic technology that our team developed. It can be used for whole-file encryptions. We name it fusionTAP and believe it's cool, and can be easily used by anyone to protect their valuable files and privacy. Here is a video demo of an application case on MAC: [File ciphering has never been this easy! fusionTAP™Intuitive Ciphering -- Cipher for Everyone!][1] As you can see, file ciphering is very easy and intuitive, no passwords, no whitelists, no sandbox, no secret/hidden enclaves. We are happy that our tech can achieve the following: - The core algorit ..read more
Visit website
Finding ways to make a new factoring method work reliably: completed
Wolfram Community » Cryptography
by Zek Celovek
4M ago
In previous post, i shared method of factoring with example, and noted problems to be fixed. I have found a solution already, and it fundamentally changes the process (completes it). Previous post was deleted by moderators, so thank you to anyone who read it and maybe is working on it. There are likely more solutions, maybe even better than the one already discovered. Thank you ..read more
Visit website
Finding ways to make a new factoring method work reliably
Wolfram Community » Cryptography
by Zek Celovek
4M ago
If others find this interesting, maybe they can find ways to make it reliable the first time.   TO FACTOR WITH THIS METHOD: 1.  Start by finding the next higher square from the target number (the one to be factored), 2.  Subtract target number from square (or from the product, if after the first iteration), 3. Find the square root of the difference, round up, and add/subtract from the square (e.g., 324-319 or 18 squared minus 319, sqrt 5 is 2.23, so use three; 18 squared becomes 15x21), 4.  Subtract new product from target number, if the difference is less than either ..read more
Visit website
[WSS23] From elliptic curves to Diophantine equations: a journey through rational points
Wolfram Community » Cryptography
by Aditi Kulkarni
10M ago
![enter image description here][1] &[Wolfram Notebook][2] [1]: https://community.wolfram.com//c/portal/getImageAttachment?filename=imgonline-com-ua-twotoone-laMQyHS7X6GneWQ.jpg&userId=2953299 [2]: https://www.wolframcloud.com/obj/7b6fb55c-3c74-43d6-b79c-48448ec4d674 ..read more
Visit website

Follow Wolfram Community » Cryptography on FeedSpot

Continue with Google
Continue with Apple
OR