MOSCOW FORENSICS DAY '25MFD '25

Slides / 3 of 19

Talk slides

Specifics of accelerating password brute-forcing on mobile devices

Vyacheslav Chikin · ACE Lab
Day 1 — Thursday, 11 September 2025: digital forensics day · Scheduled 11:20–11:55 · In the recording 00:47:57–01:03:44

An English deck and the text under the slides

These slides are an English version of the Russian deck shown in the recording: the text the authors set in the presentation has been translated and redrawn in place, while everything captured from a screen — program windows, logs, evidence — is left exactly as it was, in Russian. The fonts are the closest available ones, not the originals. The Russian deck is on the RU version of this page. Under each slide its text is set out for word search and machine reading.

  1. Slide 1 — Specifics of accelerating password brute-forcing on mobile devices
    Page 100:49:14

    Slide text

    MOSCOW

    FORENSICS

    DAY '25

    VYACHESLAV CHIKIN

    “SPECIFICS OF ACCELERATING PASSWORD BRUTE-FORCING ON MOBILE DEVICES”

    ACELAB

    MFD

    MED

  2. Slide 2 — Specifics of accelerating password brute-forcing on mobile devices
    Page 200:50:05

    Slide text

    THE TASK

    Crack an 8-character password

    Введите пароль

    Вы не вводили пароль более 72 часов. Введите пароль.

    Введите пароль

    SACELab®

    9

    123

    Пробел

    OK

    2025

    SOS

    НАЗАД

  3. Slide 3 — Specifics of accelerating password brute-forcing on mobile devices
    Page 300:50:41

    Slide text

    POSSIBLE CHARACTERS

    "ACELab®

    • 1 - 9 (10)

    a-z (26)

    • A - Z (26)

    • Пробел ! «» # $ % & ' ( )

    { |} ~ (33)

    TOTAL: 95 possible characters

    2025

  4. Slide 4 — Specifics of accelerating password brute-forcing on mobile devices
    Page 400:51:26

    Slide text

    KEYBOARD SPECIFICS

    ACELab®

    2025

  5. Slide 5 — Specifics of accelerating password brute-forcing on mobile devices
    Page 500:52:18

    Slide text

    COMMON ALGORITHMS

    • SHA256

    • SCRYPT

    2025

  6. Slide 6 — Specifics of accelerating password brute-forcing on mobile devices
    Page 600:53:31

    Slide text

    HOW SCRYPT WORKS

    DATA

    SALT

    ACELab®

    Generate data

    Data in memory

    Compute hash

    2025

    SCRYPT

  7. Slide 7 — Specifics of accelerating password brute-forcing on mobile devices
    Page 700:54:59

    Slide text

    SCRYPT

    ACELab®

    1. N (cost factor) - CPU/memory cost factor

    What is it? The main parameter, it sets the overall difficulty. It defines the number of iterations of the core algorithm. The memory required for the computation is proportional to N.

    Note: doubling N does not just double the run time, it increases it about fourfold (it raises both the iteration count and the memory).

    2025

  8. Slide 8 — Specifics of accelerating password brute-forcing on mobile devices
    Page 800:55:31

    Slide text

    SCRYPT

    ACELab® ж

    2. r (blockSize) - Block size

    What is it? Sets the size of the block the memory is split into for processing. Affects the total memory used.

    In practice:

    Usually set to 8.

    2025

  9. Slide 9 — Specifics of accelerating password brute-forcing on mobile devices
    Page 900:55:41

    Slide text

    SCRYPT

    ACELab®

    3. p (parallelization) - Parallelization factor

    What is it? Sets the number of independent computation threads. Raising p loads the CPU without affecting memory use.

    Important: for most password verification scenarios, which are sequential operations, it is set to 1.

    2025

  10. Slide 10 — Specifics of accelerating password brute-forcing on mobile devices
    Page 1000:56:44

    Slide text

    SCRYPT CALCULATIONS

    YACELab®

    Memory = (N + p + 2) * r * 128 bytes.

    Asic - 1024:1:1 - 130 KB

    Android PFE - 2048:8:1 - 2 MB

    Android FDE - 32768:8:1 - 32 MB

    2025

  11. Slide 11 — Specifics of accelerating password brute-forcing on mobile devices
    Page 1100:58:44

    Slide text

    TEST RESULTS

    Windows 10

    | Node

    | Threads

    |Script (N=2048, 1=8, p=2) |

    ACELab®

    IRyzen 9 9950X + 2*NVidia 4060T1

    16/32 + 8704

    5125 P/s

    4352

    INVidia 4060Ti

    1482 P/s

    | Ryzen 7 5800X + NVidia 3080Ti

    8/16 + 10240(44%)

    2454

    INVidia 3080Ti

    1728

    |Ryzen 7 2700 + NVidia 2060 SUPER

    8/16 + 2176

    1592 P/s

    2176

    INVidia 2060 SUPER

    900 P/s 1180 P/s

    115-9400F + NVidia

    3060

    6/6 + 3584

    3584

    776 ₽/s

    INVidia 3060

    2826 ₽/s

    24/24

    |Core Ultra 9 285K

    | Ryzen 9 9950X

    2250 P/s

    16/32

    7 7700X

    1065 P/s

    |Ryzen

    8/16

    IRyzen 7 8845H

    8/16

    945

    (laptop)

    Ryzen 7 5800X

    726

    8/16

    Ryzen 75800H (laptop)

    573

    8/16

    7 6800H

    Ryzen

    (laptop)

    8/16

    499

    5 5600G

    6/12

    | Ryzen

    491

    5 3600X

    6/12

    Ryzen

    465

    5 5500u

    (laptop)

    6/12

    | Ryzen

    408

    115-9400F

    404

    Ununtu 24.04

    | Node

    | Threads

    IScript (N=2048, r=8, p=2) |

    9 9950X + 2*NVidia 4060T1

    16/32 + 8704

    | Ryzen Ryzen 9 9950X

    16/32

    Core Ultra 9 285K

    24/24

    7456 P/s

    4240 P/s 4226 ₽/s

    2025

  12. Slide 12 — Specifics of accelerating password brute-forcing on mobile devices
    Page 1201:00:09

    Slide text

    TIME TO SOLVE THE TASK

    ACELab®

    95^8 = 6 634 204 312 890 625.

    At a rate of 20,000 passwords/sec. 10,518 years.

    2025