Cryptography

Subscribe to Cryptography feed
Updated: 4 min 1 sec ago

Help

3 hours 35 min ago

How should i get into cryptography

submitted by /u/LtErikson
[link] [comments]
Categories: Information Security

[ News ] ONLINE SHOP WITH CRYPTO ( BITCOIN, ETHEREUM )

Thu, 01/17/2019 - 10:48

Website offering antminer S15 , antminer T15 , laptops , phones , camera , video games , Tablets and others electro with good prices Guaranteed! with ( bitcoins, ethereum ) and they have promotions of -15% of bulk orders , and shipping ( dhl ,ups , Fedex, Free Shipping ) worldwide.

Coupon code for bulk orders : SHOP15OFF

Website : https://electroshop.io/

submitted by /u/GwenGarci
[link] [comments]
Categories: Information Security

It's a cipher that I need help to solve, I don't know if this is the right place to ask, so sorry if it is. I would appreciate anything really, so if you see anything.

Thu, 01/17/2019 - 06:41

NBSI: 97882…

  1. of …10050961

  2. of …05395473

  3. of …10053504

  4. of …03251092

  5. of …03248092

  6. of …48903130

  7. of …49510795

  8. of …04086600

submitted by /u/biggybertha
[link] [comments]
Categories: Information Security

Transpositon cipher. Is there any easy method or program to solve this?

Tue, 01/15/2019 - 14:07

I've been trying to solve this transposion cipher for few past days but I was not able to figure out the solution for this.

Is there some program which can help me with this?

RUYST ASETB ISVLK KUNEE OBCDZ AEORA AIOBI RNOCO DPTER TPOOA HUUOL INILC NPONB VDNUO AOSPA ISDEC DOPHS VSIZN SDJZP KKSNI NANJP JCLTC EHOMT LATPT AHTNA YTLEE UDSIZ ZVOKU NLNPI POVEI ZEZOO NEOSZ IRADT REIOE TSEPD EEEDE ORYOT INISE EREIN EHSOD UOASS TCYTA IDEDP OANEO AUBNN VTRAS ETVEL UOAUI ZUEAD DCYUV EIOZY ZIUAE H

submitted by /u/Zedcze
[link] [comments]
Categories: Information Security

HARD TRANSPOSITION CIPHER. Can someone please help me?

Tue, 01/15/2019 - 13:31

I've been trying to solve this transposion cipher for few past days but I was not able to figure out the solution for this. Could someone please help with that?

RUYST ASETB ISVLK KUNEE OBCDZ AEORA AIOBI RNOCO DPTER TPOOA HUUOL INILC NPONB VDNUO AOSPA ISDEC DOPHS VSIZN SDJZP KKSNI NANJP JCLTC EHOMT LATPT AHTNA YTLEE UDSIZ ZVOKU NLNPI POVEI ZEZOO NEOSZ IRADT REIOE TSEPD EEEDE ORYOT INISE EREIN EHSOD UOASS TCYTA IDEDP OANEO AUBNN VTRAS ETVEL UOAUI ZUEAD DCYUV EIOZY ZIUAE H

submitted by /u/Zedcze
[link] [comments]
Categories: Information Security

Lottery inspired by Fomo3d on ETH flatform

Tue, 01/15/2019 - 05:58

Fomo2moon, new lottery get ideas from Fomo3d: blockchain Lottery that is built for Balanced Benefits, Sustainability, Maximum Excitement, and with love.

Overview:

  1. This is a Blockchain Lottery for everyone to win!
  2. A round ends and Lottery is drawn when 1 of the 2 Timers reaches zero to decide 3 Winners of the Grand Prizes.

3.At a round’s start, Timer 1 counts down from 3 hours, Timer 2 counts down from 7 days.

  1. During a round, you can purchase 1 or more Tickets, which adds more time to Timer 1 (until a cap of 12 hours). The starting Ticket price is 0.002 ETH. With each Ticket purchase, the Ticket price increases slightly.
  2. Each Ticket purchase draws 2 times to decide whether you win 1 or 2 Side Prizes or not.
  3. You can Buy Tokens to earn passive income for the current and all future rounds. The starting Token price is 0.002 ETH. Token price increases very fast based on the Dividend-generating rate of each Token.
  4. You receive a stream of passive income from your purchased Tickets, Tokens, and Referrals.
  5. When any Prize (Grand, Major, Minor) is won, all Token holders get a piece too!
  6. When a round ends, a portion of all Prizes (Grand, Major, Minor) would be transferred to the next Prizes of the same type, so that each Prize is never empty at the start of a round.
  7. After a round ends, the next round starts in 24 hours.

Setup:

You can start playing anytime by going to the Fomo2Moon site. In order to play, you’ll need:

  1. Metamask set up on your computer and/or TrustWallet (iOS or Android on your mobile phone;
  2. Ethereum available in your Metamask Wallet and/or Trustwallet;
  3. Visit the Fomo2Moon site and start buying Tickets/Tokens!
  4. Check out the detailed Setup Instructions for a step-by-step rundown on everything you need to get going.

*Note: More than 800 ETH were sold out yesterday in minutes

* Round 1 will start in about 7 hours

If you find this to be profitable for you in the early days of the year, please sign here: https://fomo2moon.io/play

There were 21.6ETH winners

submitted by /u/SandunRonc12
[link] [comments]
Categories: Information Security

Alex V Publishes Zero Confidential Transactions White Paper for Peer Review

Mon, 01/14/2019 - 19:14

Hi r/cryptography

NavCoin engineer/researcher Alex V has been working on a new iteration of the zero coin protocol "Zero Confidential Transactions" that's been published for peer review. While the implementation details are relevant to cryptocurrency (and i know this isn't a cryptocurrency sub), the core of the paper is focused on the mathematics. We've had the paper reviewed in advance by various cryptographers who are familiar with cryptocurrency and are now seeking public peer review by anyone who is interested in what we've designed.

All feedback and comments welcome.

https://www.researchgate.net/publication/330366788_Zero_Confidential_Transactions

submitted by /u/pakage
[link] [comments]
Categories: Information Security

Relevant cryptography algorithms for web authentication

Mon, 01/14/2019 - 11:54

Hi, dear member of cryptography subreddit! I'm trying to understand better cryptography in the way of its usage for cybersecurity of corporate data and employees identity. I'm working in the open source project (its github repo is here) that aims to make authentication prepared to the modern level of cyber criminality on the Internet. I would be grateful for any tips and articles about cryptography that is used for user and application authentication. Especially I want to know more about algorithms that used for X 509 certificates.

submitted by /u/fedotovcorp
[link] [comments]
Categories: Information Security

New Programmer

Sun, 01/13/2019 - 19:28

I’m a sophomore in college right now taking several math and computer science courses. I have read that cryptography often times combines both subjects which sounded really interesting to me. Can anyone provide any information (articles, websites) that would turn me in the right direction of learning more about this? Or what you guys have done to learn about cryptography. Thank you!

submitted by /u/creehiker16
[link] [comments]
Categories: Information Security

Can you decrypt this?

Sun, 01/13/2019 - 13:00

B¬Šh,³ž¶\¨*.rz[j¹,™§tÊÚr÷§‰ùèæ«jØ^­ëpm{0z¸^­ÊâoÀ

7022236332432065815287274932014608860239538629462265094088355037793059395972486421479990942318181377424419039346054986362918385876446271602652071440717835555374560744331164710810007608114139213523677219173284495862250274575202353543841083099801083870130980573794900238370732601595697148734662117620677557164806402642438666516166613443335697798614423728736612619746555052115871707743120823567672005911799547417729579519161993697721645871602488338162665152706112174277842749569137477308532405837517281703453982909442131132235639906627957097794622632363580453502762146538624549238287148216982831416596500715888897558188858288868658129413586022086366002141069325569174326907926931703104349473310199489397024052063108742361236956198975731124412530520152156521687776905003954504204137130306419868296192152792586776244569474855632859842240915034042798231625980556624837470288532955213957463452978007714078635041889190187714451017823715291531907857402620459656721563433483586833540717745270659460194923259056996152238708156715476999930253735479395741538865532348015435947468368712225125681942888768069399945854593435300699814836902803012927648220283861221683492198107677205372424398548276013101029910124613038887615230224557840037578835825332391049593284979655548954976473594615031954862872952314737085728379999748938425430138804495373650988289486867571184688431692024987089067503910992640529052239638153900079826077766700616957883818401288292433202733423257799897208857251326079854978553705828695759617901541714685230508695876844638640807852224113366398717465263789843900171207622990624016704861655950431991588286601728240673334747264909938369571167505288011729079028121696151194345977068532737370744202519960988828851616600046532144064433187744213644644872990725939920309196679560647685471489870891493389912981362042119134787745280752577994145531377890103

submitted by /u/Apprehensive_Comb
[link] [comments]
Categories: Information Security

Read recommendation

Sat, 01/12/2019 - 13:20

Simple as the title: do you have any recommendation of reading in cryptography? Articles, magazines, books

I am studying and any new knowledge will be welcome

submitted by /u/kauanm
[link] [comments]
Categories: Information Security

Online encrpytion and decryption

Fri, 01/11/2019 - 15:46

How secure are sites like aesencryption.net/ and https://www.devglan.com/online-tools/aes-encryption-decryption and more. Do these sites track users and data being transferred and how "footprint-less" are they. If they are not secure what would be a good way to securely encrypt plain text to AES and decrypt it as privacy is paramount?

submitted by /u/joesmith0789
[link] [comments]
Categories: Information Security

Is my deniable encryption scheme reasonable?

Fri, 01/11/2019 - 12:04

I was experimenting with RubberhoseFS, but since it is very hard to compile on anything modern, I decided to implement my own version, stripped of many unnecessary features. Namely, my implementation would only work on files (as opposed to drives/volumes/partitions), and in batch mode (no random access). However, before I start implementing it, I would like to verify that my understanding of RubberhoseFS is correct.

I wrote a full documentation of my intended implementation here, it contains all details of what I intend to do.

It boils down to this:

  1. A file of fixed size is created, regardless of how much actual content is intended to be in it. This file is split into blocks, initialised to random noise.
  2. A fixed number of "aspects" (views) is created, regardless of how many are actually used.
  3. Each aspect holds one symmetric master key protected by a password (or a key); one lattice key generator encrypted by the key; and one map of blocks used by that aspect (initially empty, until data is written to it), also encrypted by the key
  4. If a block is referenced by a map of one aspect, it holds data encrypted by a key generated by the aspect's "Lattice Generator", seeded by the block sequence number (i.e. if this is the 3rd block of that aspect, the lattice generator will be seeded with "3". If the block is not referenced by any aspect, it contains random noise.

Is this comparable to what RubberhoseFS does? Does this seem like a reasonable implementation of Deniable Encryption?

Additionally, what is meant by the "Lattice generator"? Which primitives would I use to implement this?

And finally, RubberhoseFS uses a "whitening code" to prevent Known Plaintext Attacks. To my understanding, for each block, a random noise of the same size as half of the block is generated. The other half is then the plaintext, XORed with the random noise. Both of these are then encrypted using the key from the lattice generator, and stored in the block. Is this interpretation correct? And is whitening really necessary, if the key space is large?

submitted by /u/programagor
[link] [comments]
Categories: Information Security

Was this conjecture from the original RSA paper ever proved?

Thu, 01/10/2019 - 10:36

I was reading through the original paper and saw this section about the provability of the security of the algorithm.

Although this problem of “computing e-th roots modulo n without factoring n” is not a well-known difficult problem like factoring, we feel reasonably confident that it is computationally intractable. It may be possible to prove that any general method of breaking our scheme yields an efficient factoring algorithm. This would establish that any way of breaking our scheme must be as difficult as factoring. We have not been able to prove this conjecture, however.

Just wondering if this conjecture was ever proved in the intervening years (since 1977).

submitted by /u/sou-ght
[link] [comments]
Categories: Information Security

Wondering If Someone Could Lend Me A Hand (not a cryptogram)

Wed, 01/09/2019 - 23:28

About three, nearly four years back, I got really into cryptography with the website http://www.ancientsocieties.com/ through the Endgame book series. I thoroughly enjoyed the website, but eventually, all good things come to an end and the website shut down long ago. I was cleaning out my folders on the computer when I found an old folder dedicated to the website and it's picture puzzles. It rekindled an old enjoyment, trying to figure out how I did these. Did anyone have experiences with the website and there any website with similar challenges?

submitted by /u/The1LessTraveledBy
[link] [comments]
Categories: Information Security

Pages